Difference between revisions of "Supercombinator"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (Created page with "A '''supercombinator''' is a mathematical expression which is fully bound and self-contained. It may be either a constant or a combinator where a...") |
(No difference)
|
Revision as of 11:59, 1 September 2016
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
- [] @ Wikipedia.org
[[Category:]]
