Articles liés à Advanced Topics in Term Rewriting
Synopsis
New advanced text/reference book on term rewriting theory and application. Essential, state-of-the-art reference for computer scientists and advanced graduates working in field of computational 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 48,37
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Advanced Topics in Term Rewriting
Image fournie par le vendeur
Advanced Topics in Term Rewriting
Edité par
Springer New York, 2010
ISBN 10 : 1441929215
ISBN 13 : 9781441929211
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. First book on advanced topics in term rewritingCovers the newest techniques for proving termination of rewrite systemsContains a comprehensive chapter on conditional term rewriting systemsContains a state-of-the-art survey of modularity in term . N° de réf. du vendeur 4173390
Quantité disponible : Plus de 20 disponibles
Image d'archives
Advanced Topics in Term Rewriting
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9781441929211_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Advanced Topics in Term Rewriting
Edité par
Springer New York Dez 2010, 2010
ISBN 10 : 1441929215
ISBN 13 : 9781441929211
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Unlike current survey articles and textbooks, here the so-called confluence and termination hierarchies play a key role. Throughout, the relationships between the properties in the hierarchies are reviewed, and it is shown that for every implication X = Y in the hierarchies, the property X is undecidable for all term rewriting systems satisfying Y. Topics covered include: the newest techniques for proving termination of rewrite systems; a comprehensive chapter on conditional term rewriting systems; a state-of-the-art survey of modularity in term rewriting, and a uniform framework for term and graph rewriting, as well as the first result on conditional graph rewriting. 432 pp. Englisch. N° de réf. du vendeur 9781441929211
Quantité disponible : 2 disponible(s)
Image d'archives
Advanced Topics in Term Rewriting
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
PF. Etat : New. N° de réf. du vendeur 6666-IUK-9781441929211
Quantité disponible : 10 disponible(s)
Image fournie par le vendeur
Advanced Topics in Term Rewriting
Edité par
Springer New York, Springer US Dez 2010, 2010
ISBN 10 : 1441929215
ISBN 13 : 9781441929211
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 -Term rewriting techniques are applicable in various fields of computer sci ence: in software engineering (e.g., equationally specified abstract data types), in programming languages (e.g., functional-logic programming), in computer algebra (e.g., symbolic computations, Grabner bases), in pro gram verification (e.g., automatically proving termination of programs), in automated theorem proving (e.g., equational unification), and in algebra (e.g., Boolean algebra, group theory). In other words, term rewriting has applications in practical computer science, theoretical computer science, and mathematics. Roughly speaking, term rewriting techniques can suc cessfully be applied in areas that demand efficient methods for reasoning with equations. One of the major problems one encounters in the theory of term rewriting is the characterization of classes of rewrite systems that have a desirable property like confluence or termination. If a term rewriting system is conflu ent, then the normal form of a given term is unique. A terminating rewrite system does not permit infinite computations, that is, every computation starting from a term must end in a normal form. Therefore, in a system that is both terminating and confluent every computation leads to a result that is unique, regardless of the order in which the rewrite rules are applied. This book provides a comprehensive study of termination and confluence as well as related properties.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 432 pp. Englisch. N° de réf. du vendeur 9781441929211
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Advanced Topics in Term Rewriting
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Term rewriting techniques are applicable in various fields of computer sci ence: in software engineering (e.g., equationally specified abstract data types), in programming languages (e.g., functional-logic programming), in computer algebra (e.g., symbolic computations, Grabner bases), in pro gram verification (e.g., automatically proving termination of programs), in automated theorem proving (e.g., equational unification), and in algebra (e.g., Boolean algebra, group theory). In other words, term rewriting has applications in practical computer science, theoretical computer science, and mathematics. Roughly speaking, term rewriting techniques can suc cessfully be applied in areas that demand efficient methods for reasoning with equations. One of the major problems one encounters in the theory of term rewriting is the characterization of classes of rewrite systems that have a desirable property like confluence or termination. If a term rewriting system is conflu ent, then the normal form of a given term is unique. A terminating rewrite system does not permit infinite computations, that is, every computation starting from a term must end in a normal form. Therefore, in a system that is both terminating and confluent every computation leads to a result that is unique, regardless of the order in which the rewrite rules are applied. This book provides a comprehensive study of termination and confluence as well as related properties. N° de réf. du vendeur 9781441929211
Quantité disponible : 1 disponible(s)
Image d'archives
Advanced Topics in Term Rewriting
Edité par
Springer-Verlag New York Inc., 2010
ISBN 10 : 1441929215
ISBN 13 : 9781441929211
Neuf
Paperback / softback
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 633. N° de réf. du vendeur C9781441929211
Quantité disponible : Plus de 20 disponibles
Image d'archives
Advanced Topics in Term Rewriting
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 432. N° de réf. du vendeur 263091321
Quantité disponible : 4 disponible(s)
Image d'archives
Advanced Topics in Term Rewriting
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Print on Demand pp. 432 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. N° de réf. du vendeur 5805222
Quantité disponible : 4 disponible(s)
Image d'archives
Advanced Topics in Term Rewriting
impression à la demandeVendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. PRINT ON DEMAND pp. 432. N° de réf. du vendeur 183091315
Quantité disponible : 4 disponible(s)