Supercombinator
From Wiki @ Karl Jones dot com
Revision as of 13:00, 1 September 2016 by Karl Jones (Talk | contribs)
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
- Supercombinator @ Wikipedia.org
