# supercombinator meaning

[Computer]

Combinators with coarser granularity than those proposed by David Turner. A functional program is translated to a set of functions without free variables. The members of the set are selected to be optimal for that program. Supercombinators were proposed by John Hughes at University of Edinburgh.

Combinators with coarser granularity than those proposed by David Turner. A functional program is translated to a set of functions without free variables. The members of the set are selected to be optimal for that program. Supercombinators were proposed by John Hughes at University of Edinburgh.

## Examples

- A "'
*supercombinator*"'is a mathematical expression which is 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 �x 1 . �x 2 . . . �x n . " E " ( with " n " e " 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. - In mathematical terms, a lambda expression " S " is a supercombinator of arity " n " if it has no free variables and is of the form �x 1 . �x 2 . . . �x n . " E " ( with " n " e " 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*.