Abstract

Lambda lifting is a technique for transforming a functional program with local function definitions, possibly with free variables in the function definitions, into a program consisting only of global function (combinator) definitions which will be used as rewrite rules. Different ways of doing lambda lifting are presented, as well as reasons for rejecting or selecting the method used in our Lazy ML compiler. An attribute grammar and a functional program implementing the chosen algorithm is given. Originally publised in Proceedings 1985 Conference on Functional Programming Languages and Computer Architecture, Lecture Notes in Computer Science 201, Nancy, France, 1985. Springer Verlag. y As part B of author's thesis. Main addition: the attribute grammar formulation. 1 Introduction When compiling a lazy functional language using the technique described in [Joh84] it is presumed that the input program is in the form of a set of function definitions, possibly mutually recursive, tog...

Citations

178	A new implementation technique for applicative languages - Turner - 1979
164	The next 700 programming languages - Landin - 1966
118	Efficient compilation of lazy evaluation - Johnsson - 1984
83	A compiler for lazy ml - Augustsson - 1984
74	Compiling pattern-matching - Augustsson - 1985
73	Using circular programs to eliminate multiple traversals of data - Bird - 1984
71	Attribute grammars as a functional programming paradigm - Johnsson - 1987
42	The Design and Analysis of Algorithms - Aho, Hopcroft, et al. - 1974
6	Super Combinators---A New Implementation Method for Applicative Languages - Hughes - 1982