Graph Reduction: Proceedings of a Workshop Santa Fe, New Mexico, USA, September 29 - October 1, 1986: 279 (Lecture Notes in Computer Science) - Softcover

Keller, Robert M.; Fasel, Joseph H.

 
9783540184201: Graph Reduction: Proceedings of a Workshop Santa Fe, New Mexico, USA, September 29 - October 1, 1986: 279 (Lecture Notes in Computer Science)
Softcover
ISBN 10: 3540184201 ISBN 13: 9783540184201
Verlag: Springer, 2008

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Springer
Erscheinungsdatum
2008
Sprache
Englisch
ISBN 10 
3540184201
ISBN 13 
9783540184201
Einband
Tapa blanda
Anzahl der Seiten
472
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Deutschland

Weitere beliebte Ausgaben desselben Titels

9786136617466: Graph Reduction

Vorgestellte Ausgabe

ISBN 10:  6136617463 ISBN 13:  9786136617466
Softcover