A compiler for lazy ML
L Augustsson - Proceedings of the 1984 ACM Symposium on LISP and …, 1984 - dl.acm.org
L Augustsson
Proceedings of the 1984 ACM Symposium on LISP and functional programming, 1984•dl.acm.orgLML 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.
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.
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.