Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Curry HB and Feys R, "Combinatory logic Vol II", North Holland, 1969.
De Bruijn NG, "Lambda calculus notation with nameless dummies", Indag Math 34, pp381–392, 1972.
Fairbairn J, "Removing redundant laziness from supercombinators", Proc Aspenas Workshop on Implementation of Functional Languages, Chalmers Institute, Goteborg, Jan 1985.
Henderson P, "Functional programming", Prentice Hall, 1980.
Hoffman CM and O'Donnell MJ, "Programming with equations", ACM TOPLAS 4(1), pp83–112, Jan 1982.
Hudak P and Goldberg B, "Serial combinators", Proc IFIP Conference on Functional Programming and Computer Architecture, Nancy, Sept 1985.
Hudak P and Goldberg B, "Serial combinators", Functional Programming and Computer Architecture, ed Jouannaud, LNCS 201, Springer Verlag, Sept 1985.
Hughes RJM, "The design and implementation of programming languages", PhD thesis, Programming Research Group, Oxford, Sept 1984.
Johnsson T, "Efficient compilation of lazy evaluation", ACM Symposium on Compiler Construction, Montreal, pp58–69, June 1984.
Johnsson T, "Lambda lifting", Proc Aspenas workshop on implementations of functional languages, Sweden, Feb 1985.
Johnsson T, "Lambda-lifting", in Functional Programming and Computer Architecture, ed Jouannaud, Springer Verlag LNCS 201, pp190–203, Feb 1985.
Keller RM, "Distributed graph reduction from first principles", Proc Aspenas workshop on implementations of functional languages, Sweden, Feb 1985.
Klop JW, "Combinatory reduction systems", PhD thesis, Mathematisch Centrum, Amsterdam, 1980.
Landin PJ, "The mechanical evaluation of expressions", Computer Journal, Jan 1964.
O'Donnell MJ, "Computing in systems described by equations", LNCS 58, Springer Verlag, 1977.
Peyton Jones SL, "The implementation of functional languages", Prentice Hall, 1986.
Stoy JE, "Denotational semantics", MIT Press, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peyton Jones, S.L. (1986). An introduction to fully-lazy supercombinators. In: Cousineau, G., Curien, PL., Robinet, B. (eds) Combinators and Functional Programming Languages. LITP 1985. Lecture Notes in Computer Science, vol 242. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17184-3_45
Download citation
DOI: https://doi.org/10.1007/3-540-17184-3_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17184-3
Online ISBN: 978-3-540-47253-7
eBook Packages: Springer Book Archive