Graph Reduction

Robert M. Keller

ISBN 10: 3540184201 / ISBN 13: 9783540184201

Edité par Springer Berlin Heidelberg, Springer Berlin Heidelberg Okt 1987, 1987

A propos de cet article

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 GmbH, Tiergartenstr. 17, 69121 Heidelberg 472 pp. Englisch.

N° de réf. du vendeur 9783540184201

Détails bibliographiques

• Titre: Graph Reduction
• Éditeur: Springer Berlin Heidelberg, Springer Berlin Heidelberg Okt 1987
• Date de parution: 1987
• Langue: anglais
• ISBN à 10 chiffres: 3540184201
• ISBN à 13 chiffres: 9783540184201
• Reliure: Taschenbuch
• État de l'article: Neu
• Dimensions: 235 L x 155 H x 26 P (en millimètres) 235 millimètres de largeur par 155 millimètres de hauteur par 26 millimètres de profondeur
• Poids: 709 grammes

A propos de ce titre

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.