Items related to Graph Reduction: Proceedings of a Workshop Santa Fe,...
Graph Reduction: Proceedings of a Workshop Santa Fe, New Mexico, USA, September 29 - October 1, 1986 (Lecture Notes in Computer Science, 279) - Softcover
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.
"synopsis" may belong to another edition of this title.
Search results for Graph Reduction: Proceedings of a Workshop Santa Fe,...
Stock Image
Lecture Notes in Computer Science, Volume 279: Graph Reduction, Proceedings, 29 September-1 October 1986, Santa Fe, New Mexico.
Published by
Springer-Verlag, Berlin, Germany, 1987
ISBN 10: 3540184201
ISBN 13: 9783540184201
Used
Paperback
First Edition
Seller: SUNSET BOOKS 2, Newark, OH, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Good. No Jacket. 1st. w/full markings, pocket, and/or bookplate. Wear, soil. Size: 8vo. Ex-Library. Seller Inventory # 015948
Quantity: 1 available
Stock Image
Graph Reduction: Proceedings of a Workshop Santa Fe, New Mexico, USA, September 29 - October 1, 1986 (Lecture Notes in Computer Science)
Seller: GuthrieBooks, Spring Branch, TX, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding. Seller Inventory # UTD14a-0877
Quantity: 1 available
Stock Image
Graph Reduction: Proceedings of a Workshop Santa Fe, New Mexico, USA, September 29 - October 1, 1986 (Lecture Notes in Computer Science, 279)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020161734
Quantity: Over 20 available
Stock Image
Graph Reduction: Proceedings of a Workshop Santa Fe, New Mexico, USA, September 29 - October 1, 1986 (Lecture Notes in Computer Science, 279)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540184201_new
Quantity: Over 20 available
Stock Image
Graph Reduction : Proceedings of a Workshop Santa Fe, New Mexico, USA, September 29 - October 1, 1986
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 4 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9783540184201
Quantity: 10 available
Seller Image
Graph Reduction : Proceedings of a Workshop Santa Fe, New Mexico, USA, September 29 - October 1, 1986
Published by
Springer Berlin Heidelberg, 1987
ISBN 10: 3540184201
ISBN 13: 9783540184201
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783540184201
Quantity: 1 available
Seller Image
Graph Reduction
Published by
Springer Berlin Heidelberg, 1987
ISBN 10: 3540184201
ISBN 13: 9783540184201
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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, th. Seller Inventory # 4883783
Quantity: Over 20 available
Seller Image
Graph Reduction
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Okt 1987, 1987
ISBN 10: 3540184201
ISBN 13: 9783540184201
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. 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. Seller Inventory # 9783540184201
Quantity: 1 available
Seller Image
Graph Reduction
Published by
Springer Berlin Heidelberg Okt 1987, 1987
ISBN 10: 3540184201
ISBN 13: 9783540184201
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - 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. 472 pp. Englisch. Seller Inventory # 9783540184201
Quantity: 2 available