Vendeur : GuthrieBooks, Spring Branch, TX, Etats-Unis
EUR 17,59
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. 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.
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 54,57
Autre deviseQuantité disponible : 15 disponible(s)
Ajouter au panierEtat : New.
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 53,43
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 62,28
Autre deviseQuantité disponible : 15 disponible(s)
Ajouter au panierEtat : As New. Unread book in perfect condition.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 58,33
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Vendeur : Chiron Media, Wallingford, Royaume-Uni
EUR 56,95
Autre deviseQuantité disponible : 10 disponible(s)
Ajouter au panierPF. Etat : New.
Edité par Springer Berlin Heidelberg, 1987
ISBN 10 : 3540184201 ISBN 13 : 9783540184201
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 53,49
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : 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.