A program transformation to remove free variables. An expression containing a free variable is replaced by a function applied to that variable. E.g. f x = g 3 where g y = y + x x is a free variable of g so it is added as an extra argument: f x = g 3 x where g y x = y + x Functions like this with no free variables are known as supercombinators and are traditionally given upper-case names beginning with "$". This transformation tends to produce many supercombinators of the form f x = g x which can be eliminated by eta reduction and substitution. Changing the order of the parameters may also allow more optimisations. References to global (top-level) constants and functions are not transformed to function parameters though they are technically free variables. A closely related technique is closure conversion. See also Full laziness.

In addition suitable contents:
[ = ] [ ad ] [ ai ] [ al ] [ am ] [ an ] [ app ] [ ar ] [ arc ] [ arg ] [ argument ] [ as ] [ at ] [ az ] [ b ] [ ba ] [ be ] [ bi ] [ bs ] [ by ] [ C ] [ ca ] [ case ] [ Ch ] [ ch ] [ cl ] [ closure ] [ closure conversion ] [ co ] [ com ] [ combinator ] [ con ] [ cons ] [ dd ] [ de ] [ du ] [ E ] [ ec ] [ ed ] [ edu ] [ ee ] [ eg ] [ er ] [ es ] [ et ] [ eta reduction ] [ expression ] [ fi ] [ file ] [ fo ] [ for ] [ fr ] [ free ] [ free variable ] [ Fun ] [ function ] [ gh ] [ gi ] [ gl ] [ glob ] [ gr ] [ gu ] [ h ] [ hang ] [ hat ] [ hn ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ io ] [ iq ] [ is ] [ it ] [ ke ] [ kn ] [ la ] [ laziness ] [ Lex ] [ li ] [ like this ] [ lose ] [ ls ] [ ly ] [ ma ] [ man ] [ meter ] [ mo ] [ mod ] [ module ] [ na ] [ nc ] [ ne ] [ ng ] [ ni ] [ nn ] [ no ] [ ns ] [ om ] [ op ] [ pa ] [ param ] [ parameter ] [ pe ] [ ph ] [ pl ] [ pr ] [ program ] [ program transformation ] [ pt ] [ query ] [ rc ] [ re ] [ reduction ] [ ro ] [ S ] [ sa ] [ se ] [ si ] [ so ] [ st ] [ su ] [ supercombinators ] [ T ] [ th ] [ to ] [ tr ] [ transformation ] [ ug ] [ um ] [ up ] [ va ] [ var ] [ variable ] [ ve ] [ version ]