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.

N="left">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 ]