Content deleted Content added
Seagull123 (talk | contribs) Undid revision 691894324 by Seagull123 (talk), whoops, talk page discussion was started, it was just unsigned |
m removed irrelevant link on "self-contained" that redirected to self-sufficiency |
||
Line 2:
{{cleanup-rewrite|date=November 2015}}
A '''supercombinator''' is a [[mathematical expression]] which is [[Free variables and bound variables|fully bound]] and
In mathematical terms, a [[Lambda calculus|lambda expression]] ''S'' is a supercombinator of [[arity]] ''n'' if it has no free variables and is of the form λx<sub>1</sub>.λx<sub>2</sub>...λx<sub>n</sub>.''E'' (with ''n'' ≥ 0, so that lambdas are not required) such that ''E'' itself is not a [[lambda abstraction]] and any lambda abstraction in ''E'' is again a supercombinator.
| |||