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.

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 ]