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 λx1.λx2...λxn.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

edit

References

edit


P ≟ NP 

This theoretical computer science–related article is a stub. You can help Wikipedia by adding missing information.

📚 Artikel Terkait di Wikipedia

Combinatory logic

modelling quantification and eliminating variables SKI combinator calculus Supercombinator To Mock a Mockingbird Schönfinkel 1924, The article that founded combinatory

Lambda lifting

expression Fixed-point combinator Lambda calculus Deductive lambda calculus Supercombinator Curry's paradox Johnsson, Thomas (1985). "Lambda Lifting: Transforming

Categorical abstract machine

approaches to functional languages is given by the machinery based on supercombinators, or an SK-machine, by D. Turner. The notion of CAM gives an alternative