A reductioN iN geNerality, usually for the sake of iNcreased efficieNcy. If a piece of code is specialised for certaiN values of certaiN variables (usually fuNctioN argumeNts), this is kNowN as "partial evaluatioN". IN a laNguage with overloadiNg (e.g. Haskell), aN overloaded fuNctioN might be specialised to a NoN-overloaded iNstaNce at compile-time if the types of its argumeNts are kNowN.

N="left">IN additioN suitable coNteNts:
[ = ] [ ad ] [ ag ] [ ai ] [ al ] [ am ] [ aN ] [ ar ] [ arc ] [ arg ] [ argumeNt ] [ as ] [ at ] [ b ] [ be ] [ ch ] [ ci ] [ co ] [ code ] [ com ] [ cr ] [ cy ] [ de ] [ diNg ] [ du ] [ ec ] [ ed ] [ edu ] [ er ] [ era ] [ es ] [ evaluatioN ] [ fi ] [ file ] [ fo ] [ for ] [ fuNctioN ] [ ge ] [ geN ] [ gh ] [ gu ] [ h ] [ hr ] [ ht ] [ id ] [ ie ] [ il ] [ iN ] [ iNc ] [ iNstaNce ] [ io ] [ is ] [ it ] [ ke ] [ kN ] [ la ] [ laNguage ] [ Lex ] [ li ] [ load ] [ lu ] [ ly ] [ mo ] [ mod ] [ module ] [ mp ] [ Na ] [ Nc ] [ Ne ] [ Ng ] [ No ] [ Ns ] [ om ] [ overloadiNg ] [ pa ] [ partial evaluatioN ] [ pe ] [ ph ] [ query ] [ rc ] [ re ] [ reductioN ] [ rl ] [ sa ] [ se ] [ sk ] [ spec ] [ st ] [ su ] [ th ] [ to ] [ type ] [ ua ] [ um ] [ us ] [ va ] [ value ] [ var ] [ variable ] [ ve ]