(Enter summary)
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... (Update)
Context of citations to this paper: More
...strictness analysis. Some work to implement lazy functional languages using evaluation transformers has already been done [1, 6, 8, 10, 12]. But all these approaches mainly deal with evaluators for simple structured types like lists and trees. The problems arising when...
...strictness analysis. Some work to implement lazy functional languages using evaluation transformers has already been done [1, 6, 9, 11, 13]. But all these approaches mainly deal with evaluators for simple structured types like lists and trees. The problems arising when...
Cited by: More
Optimising the Memory Management of Higher-Order Functional.. - Mohnen (1997)
(Correct)
Compilation of Functional Languages Using Flow Graph Analysis - Hartel, Glaser, Wild (1994)
(Correct)
Efficient Runtime Representation of Evaluation Transformers - Horn
(Correct)
Active bibliography (related documents): More All
0.1: Using Projection Analysis in Compiling Lazy Functional Programs - Burn (1990)
(Correct)
0.0: Non-stop Haskell - Cheadle, Field, Marlow, Jones, While (2000)
(Correct)
0.0: Tail Recursion Without Space Leaks - Jones (1991)
(Correct)
Similar documents based on text: More All
0.1: Implementing lazy functional languages on stock hardware: the.. - Jones (1992)
(Correct)
0.1: Uniform Ideals and Strictness Analysis - Ernoult, Mycroft (1991)
(Correct)
0.1: Proving the Correctness of Compiler Optimisations Based on .. - Burn, Métayer (1993)
(Correct)
Related documents from co-citation: More All
9: Projections for strictness analysis
- Wadler, Hughes - 1987
7: Evaluation transformers -- a model for the parallel evaluation of functional lan.. (context) - Burn - 1987
6: Strictness analysis on non-flat domains (context) - Wadler - 1987
BibTeX entry: (Update)
S. O. Finne and G. L. Burn. Assessing the evaluation transformer model of reduction on the spineless G-machine. In 6th Functional programming languages and computer architecture, pages 331--340, Copenhagen, Denmark, Jun 1993. ACM, New York. http://citeseer.ist.psu.edu/finne93assessing.html More
@inproceedings{ finne93assessing,
author = "Sigbjorn Finne and Geoffrey Burn",
title = "Assessing the Evaluation Transformer Model of Reduction on the Spineless G-machine",
booktitle = "Functional Programming Languages and Computer Architecture",
pages = "331-340",
year = "1993",
url = "citeseer.ist.psu.edu/finne93assessing.html" }
Citations (may not include all citations):
27
Evaluation transformers -- A model for the parallel evaluati.. (context) - Burn
14
Peyton Jones (context) - Burn - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://sunsite.doc.ic.ac.uk/ic.doc/theory/guests/Burn/): More
Implementing the Evaluation Transformer Model of Reduction on.. - Burn (1991)
(Correct)
The Evaluation Transformer Model of Reduction and Its Correctness - Burn (1991)
(Correct)
The HDG-Machine: A Highly Distributed Graph-Reducer for a.. - Kingdon (1991)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC