Articles liés à Graph Reduction: Proceedings of a Workshop Santa Fe,...
Graph Reduction: Proceedings of a Workshop Santa Fe, New Mexico, USA, September 29 - October 1, 1986 - Couverture souple
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 54,33
EUR 2,27 expédition vers Etats-Unis
Destinations, frais et délais
Résultats de recherche pour Graph Reduction: Proceedings of a Workshop Santa Fe,...
Image d'archives
Lecture Notes in Computer Science, Volume 279: Graph Reduction, Proceedings, 29 September-1 October 1986, Santa Fe, New Mexico.
Edité par
Springer-Verlag, Berlin, Germany, 1987
ISBN 10 : 3540184201
ISBN 13 : 9783540184201
Ancien ou d'occasion
Paperback
Edition originale
Vendeur : SUNSET BOOKS 2, Newark, OH, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Good. No Jacket. 1st. w/full markings, pocket, and/or bookplate. Wear, soil. Size: 8vo. Ex-Library. N° de réf. du vendeur 015948
Quantité disponible : 1 disponible(s)
Image d'archives
Graph Reduction: Proceedings of a Workshop Santa Fe, New Mexico, USA, September 29 - October 1, 1986 (Lecture Notes in Computer Science)
Edité par
Springer, 1987
ISBN 10 : 3540184201
ISBN 13 : 9783540184201
Ancien ou d'occasion
Paperback
Vendeur : GuthrieBooks, Spring Branch, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Very Good. We are unable to ship to Canada at this time.Ex-library paperback in very nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding. N° de réf. du vendeur UTD14a-0877
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Graph Reduction : Proceedings of a Workshop Santa Fe, New Mexico, USA, September 29 - October 1, 1986
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 5899056-n
Quantité disponible : 15 disponible(s)
Image d'archives
Graph Reduction: Proceedings of a Workshop Santa Fe, New Mexico, USA, September 29 - October 1, 1986 (Lecture Notes in Computer Science, 279)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020161734
Quantité disponible : Plus de 20 disponibles
Image d'archives
Graph Reduction (Paperback)
Edité par
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 1987
ISBN 10 : 3540184201
ISBN 13 : 9783540184201
Neuf
Paperback
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : new. Paperback. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9783540184201
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Graph Reduction : Proceedings of a Workshop Santa Fe, New Mexico, USA, September 29 - October 1, 1986
Edité par
Springer, 1987
ISBN 10 : 3540184201
ISBN 13 : 9783540184201
Ancien ou d'occasion
Couverture souple
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 5899056
Quantité disponible : 15 disponible(s)
Image d'archives
Graph Reduction: Proceedings of a Workshop Santa Fe, New Mexico, USA, September 29 - October 1, 1986 (Lecture Notes in Computer Science, 279)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783540184201_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Graph Reduction : Proceedings of a Workshop Santa Fe, New Mexico, USA, September 29 - October 1, 1986
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
PF. Etat : New. N° de réf. du vendeur 6666-IUK-9783540184201
Quantité disponible : 10 disponible(s)
Image fournie par le vendeur
Graph Reduction
Edité par
Springer Berlin Heidelberg, 1987
ISBN 10 : 3540184201
ISBN 13 : 9783540184201
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : 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. N° de réf. du vendeur 4883783
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Graph Reduction
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Okt 1987, 1987
ISBN 10 : 3540184201
ISBN 13 : 9783540184201
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783540184201
Quantité disponible : 1 disponible(s)