Content deleted Content added
Faizhaider (talk | contribs) m Fixing links to disambiguation pages using AWB |
SpiralSource (talk | contribs) No edit summary Tags: Mobile edit Mobile app edit Android app edit |
||
(6 intermediate revisions by 5 users not shown) | |||
Line 1:
{{Short description|Bound and self-contained mathematical expression}}
A '''supercombinator''' is a [[mathematical expression]] which is [[Free variables and bound variables|fully bound]] and [[self-contained]]. It may be either a [[constant (mathematics)|constant]] or a [[combinator]] where all the subexpressions are supercombinators. Supercombinators are used in the implementation of functional languages.▼
{{disputed|date=November 2015}}
{{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.
|