Heap profiling of lazy functional programs
- 1 April 1993
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Functional Programming
- Vol. 3 (2), 217-245
- https://doi.org/10.1017/s0956796800000708
Abstract
We describe the design, implementation and use of a new kind of profiling tool that yields valuable information about the memory use of lazy functional programs. The tool has two parts: a modified functional language implementation which generates profiling information during the execution of programs, and a separate program which converts this information to graphical form. With the aid of profile graphs, one can make alterations to a functional program which dramatically reduce its space consumption. We demonstrate this in the case of a genuine example - the first to which the tool was applied - for which the results are strikingly successful.Keywords
This publication has 8 references indexed in Scilit:
- Tail recursion without space leaksJournal of Functional Programming, 1992
- Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machineJournal of Functional Programming, 1992
- Time analysis, cost equivalence and program refinementLecture Notes in Computer Science, 1991
- A composition approach to time analysis of first order lazy functional programsPublished by Association for Computing Machinery (ACM) ,1989
- The Chalmers Lazy-ML CompilerThe Computer Journal, 1989
- Statistics on graph reduction of SASL programsSoftware: Practice and Experience, 1988
- Fixing some space leaks with a garbage collectorSoftware: Practice and Experience, 1987
- Lambda lifting: Transforming programs to recursive equationsLecture Notes in Computer Science, 1985