• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Graph Reduction: Proceedings of a Workshop Santa Fe, New Mexico, Usa, September 29 - October 1, 1986

Graph Reduction: Proceedings of a Workshop Santa Fe, New Mexico, Usa, September 29 - October 1, 1986

Paperback

Series: Lecture Notes in Computer Science, Book 279

General ComputersGeneral Mathematics

ISBN10: 3540184201
ISBN13: 9783540184201
Publisher: Springer Nature
Published: Oct 7 1987
Pages: 450
Weight: 1.44
Height: 0.95 Width: 6.14 Depth: 9.21
Language: English
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.

Also in

General Mathematics