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

References in periodicals archive

Tim: A simple, lazy abstract machine to execute supercombinators. In Proceedings of FPCA '87.

A systematic study of functional language implementations

TIM -- A simple lazy abstract machine to execute supercombinators. In the Proceedings of the IFIP Conference on Functional Programming Languages and Computer Architecture, G.

Formally based profiling for higher-order functional languages

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.