Supercombinator

Supercombinator

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 λ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.

References

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


Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • CAF — may refer to: * Cactus Air Force, American aviation force during the early stages of the Battle of Guadalcanal * Caisse d allocations familiales, French governmental agencies for family supporting subsidies * Cambridge Application Form, a… …   Wikipedia

  • List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …   Wikipedia

  • Lambda lifting — or closure conversion is the process of eliminating free variables from local function definitions from a computer program. The elimination of free variables allows the compiler to hoist local definitions out of their surrounding contexts into a… …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”