Abstract

This paper describes the principles underlying an efficient implementation of a lazy functional language, compiling to code for ordinary computers. It is based on combinator-like graph reduction: the user defined functions are used as rewrite rules in the graph. Each function is compiled into an instruction sequence for an abstract graph reduction machine, called the G-machine, the code reduces a function application graph to its value. The G-machine instructions are then translated into target code. Speed improvements by almost two orders of magnitude over previous lazy evaluators have been measured; we provide some performance figures.

Citations

874	A theory of type polymorphism in programming - Milner - 1978
408	Can functional programming be liberated from the Von Neumann style - Backus - 1978
299	The mechanical evaluation of expressions - Landin - 1964
164	The next 700 programming languages - Landin - 1966
78	CONS Should Not Evaluate its Arguments - Friedman, Wise - 1976
76	Yochelson: A LISP garbage-collector for virtual-memory computer systems - Fenichel, J - 1969
72	The theory and practice of transforming call-by-need into call-by-value - Mycroft - 1980
10	combinators: A new implementation method for applicative languages - Super - 1982
4	A combinator-based compiler for a functional language - Hudak, Kranz - 1984
3	Code Generation for Lazy Evaluation - Johnsson - 1981
2	ML Under UNIX. Polymorphism: The ML/LCF/Hope Newletter - Cardelli - 1983
2	Edinburgh LCF. Volume 78 - Gordon, Milner, et al. - 1979
2	A fixed-program machine for combinator expression evaluation - Jones, Muchnick - 1982
1	FC mamual - Augustsson - 1982