Graph reduction has emerged as a poverful implementation model for lazy functional languages, especially for parallel machines. Supercombinators and full laziness are two of the key techniques available for the efficient implementation of graph reduction, and the purpose of this paper is to provide an accessible introduction to these techniques.
CITATION STYLE
Peyton Jones, S. L. (1986). An introduction to fully-lazy supercombinators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 242 LNCS, pp. 176–208). Springer Verlag. https://doi.org/10.1007/3-540-17184-3_45
Mendeley helps you to discover research relevant for your work.