Thunk-lifting: Reducing heap usage in an implementation of a lazy functional language

Share/Save/Bookmark

Haydarlou, A.R. and Hartel, P.H. (1995) Thunk-lifting: Reducing heap usage in an implementation of a lazy functional language. Journal of functional programming, 1 (1). ISSN 0956-7968

open access
[img]
Preview
PDF
149kB
Abstract:Thunk-lifting is a programtransformation for lazy functional programs. The transforma- tion aims at reducing the amount of heap space allocated to the program when it executes. Thunk-lifting transforms a function application that contains as arguments further, nested, function applications into a new function application without nesting. The transformation thus essentially folds some function applications. The applications to be folded are selected on the basis of a set of conditions, which have been chosen such that thunk-lifting never increases the amount of heap space required by a transformed program. Thunk-lifting has been implemented and applied to a number ofmediumsize benchmark programs. The results show that the number of cell claims in the heap decreases on average by 5%, with a maximum of 16%.
Item Type:Article
Copyright:© 1995 Cambridge University Press
Link to this item:http://purl.utwente.nl/publications/55714
Official URL:http://eprints.eemcs.utwente.nl/1144/01/EJFLP_thunklift.pdf
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page