Supercombinator: Difference between revisions

Revision as of 10:25, 2 March 2012

Revision as of 14:38, 6 September 2012

Line 1:

A '''supercombinator''' is a [[mathematical expression]] which is [[Free variables and bound variables|fully bound]] and [[self-contained]]. It may either be a [[constant]] or a [[combinator]] where all the subexpressions are supercombinators.

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λx₁.λxλx₂...λxλx_n.''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.

== See also ==

Line 8:

==References==

*S. L. Peyton Jones, ''The Implementation of Functional Programming Languages''. Prentice Hall, 1987.

{{comp-sci-theory-stub}}

[[Category:Functional programming]]

[[Category:Implementation of functional programming languages]]

[[Category:Lambda calculus]]

{{comp-sci-theory-stub}}

[[hr:Superkombinator]]