This paper reports on the experimental application of heap profiling to Augustsson and Johnsson's Lazy ML (LML) compiler [1]. Since our implementation of heap profiling is itself based on the LML compiler, this amounts to a boot-strapping exercise. The LML compiler extends to some 16,500 lines of code in almost 200 modules, and is by any standard a large and sophisticated piece of software. As it has been developed over a period of almost a decade, with each successive version outperforming its predecessor, the sort of dramatic improvement obtained for the clausify program is hardly to be expected; bu
Lazy functional languages such as LML [4], Haskell [21], and Concurrent Clean [35] typically feature...
Five implementations of different lazy functional languages are compared using a common benchmark of...
Starting from a theoretical understanding of the issues involved in the implementation of a heap gar...
We describe the design, implementation and use of a new kind of profiling tool that yields valuable ...
Automatic memory management is an important concept in many high order languages. It improves produc...
A signicant problem with lazy functional programs is that they often demand a great deal of space. M...
This paper presents a big-step operational semantics for distributed lazy evaluation. Our semantics ...
Lazy functional languages are known for their semantic elegance. They liberate programmers from many...
We present a new parallel implementation of lazy ML. Our scheme is a direct extension of the G-machi...
. To deepen our quantitative understanding of the performance of lazy evaluation, we have studied th...
Compiler generation is often emphasized as being the most important application of partial evaluatio...
This thesis describes a complete compiler back-end for lazy functional languages, which uses various...
First-generation heap profilers for lazy functional languages have proved to be effective tools for ...
This paper presents a scheme to manage heap data in the local memory present in each core of a limit...
Thunk-lifting is a programtransformation for lazy functional programs. The transforma- tion aims at ...
Lazy functional languages such as LML [4], Haskell [21], and Concurrent Clean [35] typically feature...
Five implementations of different lazy functional languages are compared using a common benchmark of...
Starting from a theoretical understanding of the issues involved in the implementation of a heap gar...
We describe the design, implementation and use of a new kind of profiling tool that yields valuable ...
Automatic memory management is an important concept in many high order languages. It improves produc...
A signicant problem with lazy functional programs is that they often demand a great deal of space. M...
This paper presents a big-step operational semantics for distributed lazy evaluation. Our semantics ...
Lazy functional languages are known for their semantic elegance. They liberate programmers from many...
We present a new parallel implementation of lazy ML. Our scheme is a direct extension of the G-machi...
. To deepen our quantitative understanding of the performance of lazy evaluation, we have studied th...
Compiler generation is often emphasized as being the most important application of partial evaluatio...
This thesis describes a complete compiler back-end for lazy functional languages, which uses various...
First-generation heap profilers for lazy functional languages have proved to be effective tools for ...
This paper presents a scheme to manage heap data in the local memory present in each core of a limit...
Thunk-lifting is a programtransformation for lazy functional programs. The transforma- tion aims at ...
Lazy functional languages such as LML [4], Haskell [21], and Concurrent Clean [35] typically feature...
Five implementations of different lazy functional languages are compared using a common benchmark of...
Starting from a theoretical understanding of the issues involved in the implementation of a heap gar...