Abstract

The G-machine (Johnsson, 1987; Peyton Jones, 1987) is a compiled graph reduction machine for lazy functional languages. The G-machine compiler contains many optimisations to improve performance. One set of such optimisations is designed to improve the performance of tail recursive functions. Unfortunately the abstract machine is subject to a space leak---objects are unnecessarily preserved by the garbage collector. This paper analyses why a particular form of space leak occurs in the G-machine, and presents some ideas for fixing this problem. This phenomena in other abstract machines is also examined briefly. 1. Compilers for conventional imperative languages How might a simple Pascal procedure, like the one shown below, be implemented ? procedure f; begin ... g; end; Typically the procedure which called f would set up a new stack frame for it, including such information as return addresses and any arguments passed to f. In turn, a naïve implementation of f might set up a further stack...

Citations

515	The Implementation of Functional Programming Languages - Jones - 1987
178	A new implementation technique for applicative languages - Turner - 1979
62	Compiling Lazy Functional Languages - Johnsson - 1987
57	The design and implementation of programming languages - Hughes - 1983
46	The spineless tagless g-machine - Jones, Salkild, et al. - 1989
41	TIM: A Simple, Lazy Abstract Machine to Execute Supercombinators - Fairbairn, Wray - 1987
31	The Spineless G-machine - Burn, Jones - 1988
28	The Implementation of Functional Languages using Custom Hardware - Stoye - 1985
19	Some practical methods for rapid combinator reduction - Stoye, Clarke - 1984
2	Lambda --- the ultimate goto - Steele - 1977
1	Plumbers and dustmen: Fixing a space leak with a garbage collector - Wadler - 1987