Supercombinator
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
A supercombinator is a mathematical expression which is fully bound and self-contained. It may be either a constant or a combinator where all the subexpressions are supercombinators. Supercombinators are used in the implementation of functional languages. 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 1 .λx 2 ...λ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.
A supercombinator is a mathematical expression which is fully bound and self-contained. It may be either a constant or a combinator where all the subexpressions are supercombinators. Supercombinators are used in the implementation of functional languages. 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 1 .λx 2 ...λ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. ==References== S. L. Peyton Jones, The Implementation of Functional Programming Languages. Prentice Hall, 1987.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1078602416 under CC BY-SA 4.0; modifications have been made.