In computer science, graph reduction implements an efficient version of non-strict evaluation, an evaluation strategy where the arguments to aâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2003

2003

- Adam Bakewell, Detlef Plump, Colin Runciman
- AGTIVE
- 2003

Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). Theyâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Wasim Sadiq, Maria E. Orlowska
- Inf. Syst.
- 2000

The foundation of a process model lies in its structural specifications. Using a generic process modeling language for workflowsâ€¦Â (More)

Is this relevant?

1995

1995

- Simon Brock, Gerald Ostheimer
- CONCUR
- 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

- Philip Koopman, Peter Lee, Daniel P. Siewiorek
- ACM Trans. Program. Lang. Syst.
- 1992

The results of cache-simulation experiments with an abstract machine for reducing combinator graphs are presented. The abstractâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- Georges Gonthier, MartÃn Abadi, Jean-Jacques LÃ©vy
- POPL
- 1992

Lamping discovered an optimal graph-reduction implementation of the λ-calculus. Simultaneously, Girard invented the geometryâ€¦Â (More)

Is this relevant?

1991

1991

- Pieter H. Hartel
- Softw., Pract. Exper.
- 1991

The performance of program-derived combinator graph reduction is known to be superior to that of graph reduction based on a fixedâ€¦Â (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese
- Graph-Grammars and Their Application to Computerâ€¦
- 1990

Wc show how membership in classes of graphs definable m monwhc second-order ]oglc and of bounded treewldth can be decided byâ€¦Â (More)

Is this relevant?

1989

1989

- Simon L. Peyton Jones, Chris D. Clack, Jon Salkild
- PARLE
- 1989

Parallel graph reduction is an attractive implementation for functional programming languages because of its simplicity andâ€¦Â (More)

Is this relevant?

1989

1989

- Rita Loogen, Herbert Kuchen, Klaus Indermark, Werner Damm
- PARLE
- 1989

Programmed graph reduction has been shown to be an eecient implementation technique for lazy functional languages on sequentialâ€¦Â (More)

Is this relevant?

1986

1986

- Mark Scheevel
- LISP and Functional Programming
- 1986

1. Introduction NORMA (Normal Order Reduction MAchine) is a special-purpose machine designed explicitly for graph reduction, withâ€¦Â (More)

Is this relevant?