Graph Reduction

Joseph H. Fasel

ISBN 10: 3540184201 / ISBN 13: 9783540184201

Published by Springer, Springer Okt 1987, 1987

About this Item

This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 472 pp. Englisch.

Seller Inventory # 9783540184201

Bibliographic Details

• Title: Graph Reduction
• Publisher: Springer, Springer Okt 1987
• Publication Date: 1987
• Language: English
• ISBN 10: 3540184201
• ISBN 13: 9783540184201
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 26D millimeters 235 millimeters width by 155 millimeters height by 26 millimeters depth
• Weight: 709 grams

About this title

Synopsis

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.