Content deleted Content added
Nomoteretes (talk | contribs) m Added a note sketching the use of supercombinators. Also added link to online version of SPJ text. |
grammar: it may be (either X or Y) -- not "it may either (be X or Y)" |
||
Line 1:
A '''supercombinator''' is a [[mathematical expression]] which is [[Free variables and bound variables|fully bound]] and [[self-contained]]. It may
In mathematical terms, a [[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.
| |||