Graph reduction

Known as: Combinator graph reduction 
In computer science, graph reduction implements an efficient version of non-strict evaluation, an evaluation strategy where the arguments to a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1981-2017
0102019812017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2003
2003
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The foundation of a process model lies in its structural specifications. Using a generic process modeling language for workflows… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1995
1995
This paper introduces an operational semantics for call-by-need reduction in terms of Milner's-calculus. The functional… (More)
Is this relevant?
1992
1992
The results of cache-simulation experiments with an abstract machine for reducing combinator graphs are presented. The abstract… (More)
  • figure 1
  • figure 4
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Lamping discovered an optimal graph-reduction implementation of the λ-calculus. Simultaneously, Girard invented the geometry… (More)
  • figure 1
  • figure 2
Is this relevant?
1991
1991
The performance of program-derived combinator graph reduction is known to be superior to that of graph reduction based on a fixed… (More)
  • figure 3
  • figure 4
  • figure 7
  • figure 8
  • figure 12
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Wc show how membership in classes of graphs definable m monwhc second-order ]oglc and of bounded treewldth can be decided by… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1989
1989
Parallel graph reduction is an attractive implementation for functional programming languages because of its simplicity and… (More)
Is this relevant?
1989
1989
Programmed graph reduction has been shown to be an eecient implementation technique for lazy functional languages on sequential… (More)
  • figure 2
Is this relevant?
1986
1986
1. Introduction NORMA (Normal Order Reduction MAchine) is a special-purpose machine designed explicitly for graph reduction, with… (More)
  • figure I
  • figure 3-1
  • figure 4.2
  • figure 4-3
  • figure 4.3
Is this relevant?