supercombinators

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.

This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)

Mentioned in

combinator
constant applicative form
G-Code
lambda lifting
University of Edinburgh

All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.