Supercombinator

From Wiki @ Karl Jones dot com
Jump to: navigation, search

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.

See also

External links