Thomas Johnsson  Home/Search
Context Related
Links: ACM DBLP | md.chalmers.se/~jo...yevaluation.ps.gz cs.chalmers.se/~jo...yevaluation.ps.gz math.chalmers.se/~...yevaluation.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF Problem Downloading? From: md.chalmers.se/~johnsson/ (more) From: math.chalmers.se/~johnsson/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper describes the principles underlying an efficient implementation of a lazy functional language, compiling to code for ordinary computers. It is based on combinator-like graph reduction: the user defined functions are used as rewrite rules in the graph. Each function is compiled into an instruction sequence for an abstract graph reduction machine, called the G-machine, the code reduces a function application graph to its value. The G-machine instructions are then translated into target ... (Update)
Context of citations to this paper: More
...This typically happens for variables with several occurrences, at least one of which is strict. Both the Chalmers LML Haskell compiler [9] and the Glasgow Haskell compiler [14] include this optimization. In order to go further than this, a global analysis is needed. The...
Cited by: More
Making a Fast Curry - Push Enter Vs (Correct)
Analysis and Efficient Implementation of Functional Programs - Sestoft (1991) (Correct)
Operational Machine Specification in a Functional Programming.. - Koopman (1995) (Correct)
Active bibliography (related documents): More All
1.2: Compiling Lazy Functional Languages: An introduction - Johnsson (Correct)
0.3: Graph Reduction, and how to avoid it (extended abstract of talk) - Johnsson (1995) (Correct)
0.2: Semantic Analyses for Storage Management Optimizations in.. - Park (1991) (Correct)
Similar documents based on text: More All
0.1: Implementing lazy functional languages on stock hardware: the.. - Jones (1992) (Correct)
0.1: Assessing the Evaluation Transformer Model of Reduction on the.. - Finne, Burn (1993) (Correct)
0.1: Parallel Graph Reduction with the -machine - Augustsson, Johnsson (1989) (Correct)
Related documents from co-citation: More All
27: The Implementation of Functional Programming Languages (context) - Jones - 1987
22: A new implementation technique for applicative languages (context) - Turner - 1979
20: A compiler for lazy ML (context) - Augustsson - 1984
BibTeX entry: (Update)
T. Johnsson, Efficient compilation of lazy evaluation, in: Proc. ACM Conference on Compiler Construction, pp 58--69, 1984. http://citeseer.ist.psu.edu/johnsson84efficient.html More
@article{ johnsson84efficient,
author = "T. Johnsson",
title = "Efficient Compilation of Lazy Evaluation",
booktitle = "Proceedings of the {ACM} {SIGPLAN}'84 Symposium on Compiler Con struction",
journal = "SIGPLAN Notices",
volume = "19",
number = "6",
month = "June",
publisher = "ACM Press",
pages = "58--69",
year = "1984",
url = "citeseer.ist.psu.edu/johnsson84efficient.html" }
Citations (may not include all citations):809 A theory of type polymorphism in programming (context) - Milner - 1978 DBLP
322 Volume 78 of Lecture Notes in Computer Science (context) - Gordon, Milner et al. - 1979
273 Can programming be liberated from the von Neumann style (context) - Backus - 1978
218 The mechanical evaluation of expressions (context) - Landin - 1964
143 A new implementation technique for applicative languages (context) - Turner - 1979
84 The next 700 programming languages (context) - Landin - 1966
73 A lisp garbage-collector for virtual memory computer systems (context) - Fenichel, Yochelson - 1969
61 The theory and practice of transforming call-by-need into ca.. (context) - Mycroft - 1980
49 Cons should not evaluate its arguments (context) - Friedman - 1976
35 Super combinators - a new implementation method for applicat.. (context) - Hughes - 1982
13 Programming Methodology Group (context) - Augustsson, Technical - 1982
6 ML under UNIX (context) - Cardelli - 1984
4 A combinator-based compiler for a functional language (context) - Hudak, Kranz - 1984 ACM DBLP
4 Code Generation for Lazy Evaluation (context) - Johnsson - 1981
2 An implementation of SASL (context) - Turner - 1975
2 A fixed-program machine for combinator expression evaluation (context) - Jones, Muchnick - 1982
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.md.chalmers.se/~johnsson/): More
Parallel Evaluation of Functional Programs: The G-machine approach - Johnsson (1991) (Correct)
Parallel Graph Reduction with the -machine - Augustsson, Johnsson (1989) (Correct)
The GRIN Project: A Highly Optimising Back End for Lazy.. - Boquist, Johnsson (1996) (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