Supercombinator: Difference between revisions

Revision as of 17:27, 29 September 2014

Revision as of 04:21, 20 November 2015

Line 1:

{{Requires attention}}

{{cleanup-rewrite}}

A '''supercombinator''' is a [[mathematical expression]] which is [[Free variables and bound variables|fully bound]] and [[self-contained]]. It may be either a [[constant (mathematics)|constant]] or a [[combinator]] where all the subexpressions are supercombinators. Supercombinators are used in the implementation of functional languages.