Assessing the Evaluation Transformer Model of Reduction on the Spineless G-machine (1993)
| Citations: | 11 - 1 self |
BibTeX
@MISC{Finne93assessingthe,
author = {Sigbjørn Finne and Spineless G-machine and Geoffrey Burn},
title = {Assessing the Evaluation Transformer Model of Reduction on the Spineless G-machine},
year = {1993}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper reports on our initial work on assessing how using the evaluation transformer model of reduction affects the performance of lazy functional programs. The model uses information about how much evaluation of an expression is required in order to evaluate an expression as much as possible, as early as possible. Our results show that there is a definite gain over just using strictness information, but that it is difficult to characterise exactly how much gain there will be, and in what programs it will occur. 1 Introduction A large number of papers have been written on various analysis techniques for lazy functional languages, but there has been little systematic work determining how this information can be used most effectively in an implementation. The folklore says that exploiting strictness information is beneficial, especially when combined with passing values unboxed, but this conclusion has not been reached by careful experimentation, and without careful experiment we r...
Citations
No citations identified.
