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. A functional program implementing the chosen algorithm is given.
CITATION STYLE
Johnsson, T. (1985). Lambda lifting: Transforming programs to recursive equations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 201 LNCS, pp. 190–203). Springer Verlag. https://doi.org/10.1007/3-540-15975-4_37
Mendeley helps you to discover research relevant for your work.