Graph Reduction

1. Front Matter

   PDF

2. On the correspondence of lambda style reduction and combinator style reduction

   • Hans-Georg Oberhauser

   Pages 1-25

3. Head order reduction: A graph reduction scheme for the operational lambda calculus

   • Klaus Berkling

   Pages 26-48

4. A simple abstract machine to execute supercombinators

   • Jon Fairbairn

   Pages 49-52

5. Concurrent term rewriting as a model of computation

   • Joseph Goguen, Claude Kirchner, José Meseguer

   Pages 53-93

6. Alfalfa: Distributed graph reduction on a hypercube multiprocessor

   • Benjamin Goldberg, Paul Hudak

   Pages 94-113

7. Parallel graph reduction on a supercomputer: A status report

   • Randy Michelsen, Lauren Smith, Elizabeth Williams, Bonnie Yantis

   Pages 114-118

8. Target code generation from G-machine code

   • Thomas Johnsson

   Pages 119-159

9. Toward the design of a parallel graph reduction machine the MaRS project

   • Michel Castan, Guy Durrieu, Bernard Lecussan, Michel Lemaître, Alessandro Contessa, Eric Cousin et al.

   Pages 160-180

10. The parallel graph reduction machine, ALICE

    • P. G. Harrison, M. J. Reeve

    Pages 181-202

11. Overview of Rediflow II development

    • Robert M. Keller, Jon W. Slater, Kevin T. Likes

    Pages 203-214

12. Specification of reduction strategies in term rewriting systems

    • M. C. J. D. van Eekelen, M. J. Plasmeijer

    Pages 215-239

13. Controlling reduction partial order in functional parallel programs

    • F. Warren Burton

    Pages 240-251

14. Parallel garbage collection for graph machines

    • Ashoke Deb

    Pages 252-264

15. Graph reduction in a parallel virtual memory environment

    • Ian Watson, Paul Watson

    Pages 265-274

16. Performance measurement of a G-machine implementation

    • Richard B. Kieburtz

    Pages 275-296

17. A flexible architectural study methodology

    • Steven Tighe, Ken Zink, Richard Brice, William Alexander

    Pages 297-311

18. Arrays, non-determinism, side-effects, and parallelism: A functional perspective

    • Paul Hudak

    Pages 312-327

19. A new array operation

    • Philip Wadler

    Pages 328-335

20. I-Structures: Data structures for parallel computing

    • Arvind, Rishiyur S. Nikhil, Keshav K. Pingali

    Pages 336-369

This volume describes recent research in graph reduction and related areas of functional and logic programming, as reported at a workshop in 1986. The papers are based on the presentations, and because the final versions were prepared after the workshop, they reflect some of the discussions as well. Some benefits of graph reduction can be found in these papers: - A mathematically elegant denotational semantics - Lazy evaluation, which avoids recomputation and makes programming with infinite data structures (such as streams) possible - A natural tasking model for fine-to-medium grain parallelism. The major topics covered are computational models for graph reduction, implementation of graph reduction on conventional architectures, specialized graph reduction architectures, resource control issues such as control of reduction order and garbage collection, performance modelling and simulation, treatment of arrays, and the relationship of graph reduction to logic programming.

• Variable
• computer
• data structure
• lambda calculus
• logic
• processor
• programming
• semantics
• supercomputer

Policies and ethics