Articoli correlati a Term Rewriting Systems
Sinossi
A comprehensive 2003 introduction to term rewriting for researchers. Features exercises, solutions and applications.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Recensione
'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
Descrizione del libro
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 the web, an extensive bibliography and a chapter on applications.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreCambridge University Press
- Data di pubblicazione2003
- ISBN 10 0521391156
- ISBN 13 9780521391153
- RilegaturaCopertina rigida
- LinguaInglese
- Numero di pagine908
- Contatto del produttorenon disponibile
Compra nuovo
Visualizza questo articolo
EUR 238,38
EUR 31,90 per la spedizione da Australia a Italia
Destinazione, tempi e costiRisultati della ricerca per Term Rewriting Systems
Foto dell'editore
Term Rewriting Systems (Hardcover)
Editore:
Cambridge University Press, Cambridge, 2003
ISBN 10: 0521391156
ISBN 13: 9780521391153
Nuovo
Rilegato
Da: AussieBookSeller, Truganina, VIC, Australia
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: 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. Codice articolo 9780521391153
Quantità: 1 disponibili
Immagini fornite dal venditore
Term Rewriting Systems
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Gebunden. Condizione: 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 . Codice articolo 446933901
Quantità: Più di 20 disponibili
Foto dell'editore
Term Rewriting Systems (Cambridge Tracts in Theoretical Computer Science, Series Number 55)
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo I-9780521391153
Quantità: Più di 20 disponibili
Foto dell'editore
Term Rewriting Systems (Cambridge Tracts in Theoretical Computer Science, Series Number 55)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9780521391153_new
Quantità: Più di 20 disponibili
Foto dell'editore
Term Rewriting Systems
Print on DemandDa: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Brand New. 680 pages. 9.50x6.25x1.75 inches. In Stock. This item is printed on demand. Codice articolo __0521391156
Quantità: 1 disponibili
Foto dell'editore
Term Rewriting Systems (Cambridge Tracts in Theoretical Computer Science, Series Number 55)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Feb2416190001411
Quantità: Più di 20 disponibili
Foto dell'editore
Term Rewriting Systems (Hardcover)
Editore:
Cambridge University Press, Cambridge, 2003
ISBN 10: 0521391156
ISBN 13: 9780521391153
Nuovo
Rilegato
Da: CitiRetail, Stevenage, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: 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. Codice articolo 9780521391153
Quantità: 1 disponibili
Foto dell'editore
Term Rewriting Systems (Cambridge Tracts in Theoretical Computer Science, Series Number 55)
Da: Best Price, Torrance, CA, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. SUPER FAST SHIPPING. Codice articolo 9780521391153
Quantità: 1 disponibili
Foto dell'editore
Term Rewriting Systems (Hardcover)
Editore:
Cambridge University Press, Cambridge, 2003
ISBN 10: 0521391156
ISBN 13: 9780521391153
Nuovo
Rilegato
Da: Grand Eagle Retail, Fairfield, OH, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: 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. Codice articolo 9780521391153
Quantità: 1 disponibili
Immagini fornite dal venditore
Term Rewriting Systems
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Comprehensive introduction to term rewriting for researchers. Features exercises, solutions and applications. Codice articolo 9780521391153
Quantità: 1 disponibili