Supercombinator

From Wikipedia, the free encyclopedia

A supercombinator is a mathematical expression which is 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_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.

[edit] References

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