Articles liés à Term Rewriting Systems
Synopsis
A comprehensive 2003 introduction to term rewriting for researchers. Features exercises, solutions and applications.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Présentation de l'éditeur
Term rewriting systems developed out of mathematical logic and are an important part of theoretical computer science. They consist of sequences of discrete transformation steps where one term is replaced with another and have applications in many areas, from functional programming to automatic theorem proving and computer algebra. This 2003 book starts at an elementary level with the earlier chapters providing a foundation for the rest of the work. Much of the advanced material appeared here for the first time in book form. Subjects treated include orthogonality, termination, completion, lambda calculus, higher-order rewriting, infinitary rewriting and term graph rewriting. Many exercises are included with selected solutions provided on the web. A comprehensive bibliography makes this book ideal both for teaching and research. A chapter is included presenting applications of term rewriting systems, with many pointers to actual implementations.
Revue de presse
'The book presents the state of the art of rewriting techniques, it gives (or scratches) proofs on a very precise level and gives hints to historical sources of the results and to further readings, so it is highly recommended to researchers working in this area.' Zentralblatt für Mathematik
'... has extensive material ... suffice it to say that this book is indispensable for a any serious student of rewriting.' Journal of TLP
'... it will soon be a compulsory reference for anyone working in the area.' Journal of Functional Programming
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 238,99
EUR 31,64 expédition depuis Australie vers France
Destinations, frais et délaisRésultats de recherche pour Term Rewriting Systems
Image d'archives
Term Rewriting Systems (Hardcover)
Edité par
Cambridge University Press, Cambridge, 2003
ISBN 10 : 0521391156
ISBN 13 : 9780521391153
Neuf
Couverture rigide
Vendeur : AussieBookSeller, Truganina, VIC, Australie
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : new. Hardcover. Term rewriting systems developed out of mathematical logic and are an important part of theoretical computer science. They consist of sequences of discrete transformation steps where one term is replaced with another and have applications in many areas, from functional programming to automatic theorem proving and computer algebra. This book starts at an elementary level with the earlier chapters providing a foundation for the rest of the work. Much of the advanced material appears here for the first time in book form. Subjects treated include orthogonality, termination, completion, lambda calculus, higher-order rewriting, infinitary rewriting and term graph rewriting. Many exercises are included with selected solutions provided on the web. A comprehensive bibliography makes this book ideal both for teaching and research. A chapter is included presenting applications of term rewriting systems, with many pointers to actual implementations. Term rewriting systems, which developed out of mathematical logic, consist of sequences of discrete steps where one term is replaced with another. Their many applications range from automatic theorem proving systems to computer algebra. This book begins with several examples, followed by a chapter on basic notions that provides a foundation for the rest of the work. First-order and higher-order theories are presented, with much of the latter material appearing for the first time in book form. Subjects treated include orthogonality, termination, lambda calculus and term graph rewriting. There is also a chapter detailing the required mathematical background. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. N° de réf. du vendeur 9780521391153
Quantité disponible : 1 disponible(s)
Image d'archives
Term Rewriting Systems (Cambridge Tracts in Theoretical Computer Science, Series Number 55)
Edité par
Cambridge University Press, 2003
ISBN 10 : 0521391156
ISBN 13 : 9780521391153
Neuf
Couverture rigide
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9780521391153
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Term Rewriting Systems
Edité par
Cambridge University Press, 2011
ISBN 10 : 0521391156
ISBN 13 : 9780521391153
Neuf
Couverture rigide
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Gebunden. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A comprehensive 2003 treatment of term rewriting systems from an elementary to an advanced level. Much of this material appeared here for the first time in book form. Ideal for teaching or research, it features numerous exercises with selected solutions on . N° de réf. du vendeur 446933901
Quantité disponible : Plus de 20 disponibles
Image d'archives
Term Rewriting Systems (Cambridge Tracts in Theoretical Computer Science, Series Number 55)
Edité par
Cambridge University Press, 2003
ISBN 10 : 0521391156
ISBN 13 : 9780521391153
Neuf
Couverture rigide
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9780521391153_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Term Rewriting Systems
Edité par
Cambridge Univ Pr, 2003
ISBN 10 : 0521391156
ISBN 13 : 9780521391153
Neuf
Couverture rigide
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : Brand New. 680 pages. 9.50x6.25x1.75 inches. In Stock. This item is printed on demand. N° de réf. du vendeur __0521391156
Quantité disponible : 1 disponible(s)
Image d'archives
Term Rewriting Systems (Cambridge Tracts in Theoretical Computer Science, Series Number 55)
Edité par
Cambridge University Press, 2003
ISBN 10 : 0521391156
ISBN 13 : 9780521391153
Neuf
Couverture rigide
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Feb2416190001411
Quantité disponible : Plus de 20 disponibles
Image d'archives
Term Rewriting Systems (Hardcover)
Edité par
Cambridge University Press, Cambridge, 2003
ISBN 10 : 0521391156
ISBN 13 : 9780521391153
Neuf
Couverture rigide
Vendeur : CitiRetail, Stevenage, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : new. Hardcover. Term rewriting systems developed out of mathematical logic and are an important part of theoretical computer science. They consist of sequences of discrete transformation steps where one term is replaced with another and have applications in many areas, from functional programming to automatic theorem proving and computer algebra. This book starts at an elementary level with the earlier chapters providing a foundation for the rest of the work. Much of the advanced material appears here for the first time in book form. Subjects treated include orthogonality, termination, completion, lambda calculus, higher-order rewriting, infinitary rewriting and term graph rewriting. Many exercises are included with selected solutions provided on the web. A comprehensive bibliography makes this book ideal both for teaching and research. A chapter is included presenting applications of term rewriting systems, with many pointers to actual implementations. Term rewriting systems, which developed out of mathematical logic, consist of sequences of discrete steps where one term is replaced with another. Their many applications range from automatic theorem proving systems to computer algebra. This book begins with several examples, followed by a chapter on basic notions that provides a foundation for the rest of the work. First-order and higher-order theories are presented, with much of the latter material appearing for the first time in book form. Subjects treated include orthogonality, termination, lambda calculus and term graph rewriting. There is also a chapter detailing the required mathematical background. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. N° de réf. du vendeur 9780521391153
Quantité disponible : 1 disponible(s)
Image d'archives
Term Rewriting Systems (Cambridge Tracts in Theoretical Computer Science, Series Number 55)
Edité par
Cambridge University Press, 2003
ISBN 10 : 0521391156
ISBN 13 : 9780521391153
Neuf
Couverture rigide
Vendeur : Best Price, Torrance, CA, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. SUPER FAST SHIPPING. N° de réf. du vendeur 9780521391153
Quantité disponible : 1 disponible(s)
Image d'archives
Term Rewriting Systems (Hardcover)
Edité par
Cambridge University Press, Cambridge, 2003
ISBN 10 : 0521391156
ISBN 13 : 9780521391153
Neuf
Couverture rigide
Vendeur : Grand Eagle Retail, Fairfield, OH, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : new. Hardcover. Term rewriting systems developed out of mathematical logic and are an important part of theoretical computer science. They consist of sequences of discrete transformation steps where one term is replaced with another and have applications in many areas, from functional programming to automatic theorem proving and computer algebra. This book starts at an elementary level with the earlier chapters providing a foundation for the rest of the work. Much of the advanced material appears here for the first time in book form. Subjects treated include orthogonality, termination, completion, lambda calculus, higher-order rewriting, infinitary rewriting and term graph rewriting. Many exercises are included with selected solutions provided on the web. A comprehensive bibliography makes this book ideal both for teaching and research. A chapter is included presenting applications of term rewriting systems, with many pointers to actual implementations. Term rewriting systems, which developed out of mathematical logic, consist of sequences of discrete steps where one term is replaced with another. Their many applications range from automatic theorem proving systems to computer algebra. This book begins with several examples, followed by a chapter on basic notions that provides a foundation for the rest of the work. First-order and higher-order theories are presented, with much of the latter material appearing for the first time in book form. Subjects treated include orthogonality, termination, lambda calculus and term graph rewriting. There is also a chapter detailing the required mathematical background. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9780521391153
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Term Rewriting Systems
Edité par
Cambridge University Press, 2003
ISBN 10 : 0521391156
ISBN 13 : 9780521391153
Neuf
Couverture rigide
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Comprehensive introduction to term rewriting for researchers. Features exercises, solutions and applications. N° de réf. du vendeur 9780521391153
Quantité disponible : 1 disponible(s)