Skip to search formSkip to main contentSkip to account menu

Graph reduction machine

A graph reduction machine is a special-purpose computer built to perform combinator calculations by graph reduction. Examples include the SKIM ("S-K… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
1999
Review
1999
Escher is a functional logic programming language which is based on a rewriting computational model with residuation. Similar to… 
1993
1993
Graph reduction is an implementation technique for the lazy λ-calculus. It has been used to implement many non-strict functional… 
1992
1992
This paper is concerned with resource management on Flagship: a packet-based parallel graph reduction machine specifically… 
Highly Cited
1991
Highly Cited
1991
It has been argued for many years that functional programs are well suited to parallel evaluation. This thesis investigates this… 
Highly Cited
1990
Highly Cited
1990
The paper investigates the implementation of lazy narrowing in the framework of a graph reduction machine. By extending an… 
1988
1988
This article deals with the issue of fault tolerance and error recovery in a parallel graph reduction computer such as the "MaRS… 
1987
1987
GRIP - Graph Reduction In Parallel - is a Fifth Generation machine designed to execute functional languages in parallel, using… 
1986
1986
© 1986 ACM. Functional languages are widely claimed to be amenable to concurrent execution by multiple processors. This paper… 
1985
1985
An implementation technique for functional languages that has rcceived recent attention is graph reduction, which offers…