论文信息 - A compiler for lazy ML

A compiler for lazy ML

LML is a strongly typed, statically scoped functional Language with Lazy evaluation. It is compiled trough a number of program transformations which makes the code generation easier. Code is generated in two steps, first code for an abstract graph manipulation machine, the G-machine. From this code machine code is generated. Some benchmark tests are also presented.

Lennart Augustsson | L. Augustsson

[1] Alan Mycroft,et al. The Theory and Practice of Transforming Call-by-need into Call-by-value , 1980, Symposium on Programming.

[2] Rod M. Burstall,et al. HOPE: An experimental applicative language , 1980, LISP Conference.

[3] Robin Milner,et al. A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[4] Paul Hudak,et al. A combinator-based compiler for a functional language , 1984, POPL '84.

[5] D. A. Turner,et al. A new implementation technique for applicative languages , 1979, Softw. Pract. Exp..

[6] Neil D. Jones,et al. A fixed-program machine for combinator expression evaluation , 1982, LFP '82.

[7] R. J. M. Hughes,et al. Super-combinators a new implementation method for applicative languages , 1982, LFP '82.

[8] J. Fairbairn,et al. Ponder and its type system , 1982 .

[9] Thomas Johnsson,et al. Efficient compilation of lazy evaluation , 1984, SIGPLAN '84.