Johnsson's G-Machine is a major achievement in the efficient implementation of lazy functional languages. In this paper we provide figures of time and space performance of the original G-Machine and each optimisation step. The figures presented not only help to understand the G-machine, but can also serve as a basis for choosing which optimisations to use in a different machine for the implementation of lazy functional languages. To appear in: Microprocessing & Microprogramming North-Holland, April 1993.
展开▼
