A fresh look at combinator graph reduction

Authors:
P. J. Koopman, Jr.;P. Lee
Affiliations:
Department of Electrical and Computer Engineering;School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania
Venue:
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Year:
1989

Citing 11
Cited 6

Miranda: a non-strict functional language with polymorphic types

Proc. of a conference on Functional programming languages and computer architecture
Serial combinators: “optimal” grains of parallelism

Proc. of a conference on Functional programming languages and computer architecture
TIM: A simple, lazy abstract machine to execute supercombinators

Proc. of a conference on Functional programming languages and computer architecture
Faster combinator reduction using stock hardware

LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
NORMA: a graph reduction processor

LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
List processing in real time on a serial computer

Communications of the ACM
Threaded code

Communications of the ACM
Efficient compilation of lazy evaluation

SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
A compiler for lazy ML

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Super-combinators a new implementation method for applicative languages

LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)

The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)

A portable interface for on-the-fly instruction space modification

ASPLOS IV Proceedings of the fourth international conference on Architectural support for programming languages and operating systems
Cache behavior of combinator graph reduction

ACM Transactions on Programming Languages and Systems (TOPLAS)
A natural semantics for lazy evaluation

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Linear logic and permutation stacks—the Forth shall be first

ACM SIGARCH Computer Architecture News - Special issue: panel sessions of the 1991 workshop on multithreaded computers
Techniques for embedding postfix languages in Haskell

Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
The call-by-need lambda calculus

Journal of Functional Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new abstract machine for graph reduction called TIGRE. Benchmark results show that TIGRE's execution speed compares quite favorably with previous combinator-graph reduction techniques on similar hardware. Furthermore, the mapping of TIGRE onto conventional hardware is simple and efficient. Mainframe implementations of TIGRE provide performance levels exceeding those previously available on custom graph reduction hardware.