Thunk-lifting: Reducing heap usage in an implementation of a lazy functional language
| Autor: | Haydarlou, A.R., Hartel, Pieter H. |
|---|---|
| Přispěvatelé: | Computer Systems, System and Network Engineering (IVI, FNWI) |
| Jazyk: | angličtina |
| Rok vydání: | 1995 |
| Předmět: | |
| Zdroj: | Journal of Functional Programming, 1(1). Cambridge University Press Haydarlou, A R & Hartel, P 1995, ' Thunk-lifting: Reducing heap usage in an implementation of a lazy functional language ', Journal of Functional Programming, vol. 1, no. 1 . Journal Functional and Logic Programming, 1(1) Journal of functional programming, 1(1). Cambridge University Press |
| ISSN: | 0956-7968 1080-5230 |
| Popis: | 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%. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|