(Enter summary)
Abstract: For a number of years, this author together with Lennart Augustsson have been developing
fast implementations of lazy functional languages, based on graph reduction,
for ordinary (sequential) computers. Our approach to sequential implementation can be
summarised very briefly as follows.
Our approach stems from Turner's S, K, I standard combinator reduction approach
[Tur79]. But instead of using a standard, fixed set of combinators, the compiler tranforms
the program into a new set of... (Update)
Active bibliography (related documents): More All
0.9: Parallel Graph Reduction with the -machine - Augustsson, Johnsson (1989)
(Correct)
0.5: A Parallel Functional Language Compiler for Message-Passing.. - Junaidu (1998)
(Correct)
0.4: Fast Parallel Implementation of Lazy Languages -.. - Kaser, Pawagi.. (1992)
(Correct)
Similar documents based on text: More All
0.2: Target code generation from G-machine code - Johnsson (1986)
(Correct)
0.2: The Categorical Multi-Combinator Machine: CMCM - Thompson, Lins (1992)
(Correct)
0.2: Bracket abstraction in the combinator system Cl(K) - Broda, Damas
(Correct)
BibTeX entry: (Update)
@inproceedings{ johnsson91parallel,
author = "Thomas Johnsson",
title = "{Parallel Evaluation of Functional Programs: The $\langle\nu,G\rangle$ Approach (Summary)}",
booktitle = "{PARLE} '91, Parallel Architectures and Languages Europe, Volume I: Parallel Architectures and Algorithms",
volume = "505",
publisher = "Springer, Berlin",
address = "Eindhoven, The Netherlands, June 10--13",
editor = "E. H. L. Aarts and J. van Leeuwen and M. Rem",
pages = "1--5",
year = "1991",
url = "citeseer.ist.psu.edu/article/johnsson91parallel.html" }
Citations (may not include all citations):
143
A New Implementation Technique for Applicative Languages (context) - Turner - 1979
84
Lambda Lifting: Transforming Programs to Recursive Equations
- Johnsson - 1985
69
Compiling Lazy Functional Languages (context) - Johnsson - 1987
66
Efficient Compilation of Lazy Evaluation
- Johnsson - 1984
64
The Chalmers Lazy-ML Compiler (context) - Augustsson, Johnsson - 1989
59
A Compiler for Lazy ML (context) - Augustsson - 1984
36
Compiling Lazy Functional Languages (context) - Augustsson - 1987
35
Super Combinators---A New Implementation Method for Applicat.. (context) - Hughes - 1982
34
Compiling Pattern Matching (context) - Augustsson - 1985
26
High-Performance Parallel Graph Reduction (context) - Jones, Clack et al. - 1989
16
GAML: a Parallel Implementation of Lazy ML
- Maranget - 1991
15
Parallel Graph Reduction with the h; Gi- machine (context) - Augustsson, Johnsson - 1989
14
Peyton Jones (context) - Burn, Robson - 1988
9
GRIP: A Parallel Graph Reduction Machine (context) - Jones - 1987
7
Stacklessness: compiling recursion for a distributed archite.. (context) - Lester - 1989
7
An abstract machine for Parallel graph reduction (context) - George - 1989
6
The Four-Stroke Reduction Engine (context) - Clack, Jones - 1986
2
Code Generation from G-machine code (context) - Johnsson - 1986
1
A Concurrent Garbage Collector for the h; Gi-machine (context) - Rojemo - 1991
Documents on the same site (http://www.md.chalmers.se/~johnsson/): More
Parallel Graph Reduction with the -machine - Augustsson, Johnsson (1989)
(Correct)
The GRIN Project: A Highly Optimising Back End for Lazy.. - Boquist, Johnsson (1996)
(Correct)
Efficient Compilation of Lazy Evaluation - Johnsson (1984)
(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