PPN: | 883406853 |
Titel: | |
Person/en: | |
Sprache/n: | Englisch |
Veröffentlichungsangabe: | Cambridge : Cambridge University Press, 1998 |
Umfang: | 1 online resource (xii, 301 pages) |
Anmerkung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
Bibliogr. Zusammenhang: | |
ISBN: | ebook 978-0-521-45520-6 hardback hardback 978-0-521-77920-3 paperback paperback 978-1-139-17275-2 : ebook |
Identifier: | |
Schlagwörter: | |
Sachgebiete: | |
Mehr zum Thema: | Klassifikation der Library of Congress: QA267Mathematics Subject Classification: *68Q42Mathematics Subject Classification: 03B35Mathematics Subject Classification: 08A70Mathematics Subject Classification: 68-02 |
Inhalt: | This textbook offers a unified and self-contained introduction to the field of term rewriting. It covers all the basic material (abstract reduction systems, termination, confluence, completion, and combination problems), but also some important and closely connected subjects: universal algebra, unification theory, Gröbner bases and Buchberger's algorithm. The main algorithms are presented both informally and as programs in the functional language Standard ML (an appendix contains a quick and easy introduction to ML). Certain crucial algorithms like unification and congruence closure are covered in more depth and Pascal programs are developed. The book contains many examples and over 170 exercises. This text is also an ideal reference book for professional researchers: results that have been spread over many conference and journal articles are collected together in a unified notation, proofs of almost all theorems are provided, and each chapter closes with a guide to the literature. |
Mehr zum Titel: | |
| |
Anmerkung: | Vervielfältigungen (z.B. Kopien, Downloads) sind nur von einzelnen Kapiteln oder Seiten und nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Die Weitergabe an Dritte sowie systematisches Downloaden sind untersagt. |
Volltext: | |
| |
|
|
| |