Term rewriting and all that:
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, unif...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Weitere beteiligte Personen: | |
| Format: | E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
1998
|
| Links: | https://doi.org/10.1017/CBO9781139172752 |
| Zusammenfassung: | 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. |
| Umfang: | 1 Online-Ressource (xii, 301 Seiten) |
| ISBN: | 9781139172752 |
Internformat
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9781139172752 | ||
| 003 | UkCbUP | ||
| 005 | 20151005020621.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 111013s1998||||enk o ||1 0|eng|d | ||
| 020 | |a 9781139172752 | ||
| 100 | 1 | |a Baader, Franz | |
| 245 | 1 | 0 | |a Term rewriting and all that |c Franz Baader and Tobias Nipkow |
| 246 | 3 | |a Term Rewriting & All That | |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 1998 | |
| 300 | |a 1 Online-Ressource (xii, 301 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 520 | |a 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. | ||
| 700 | 1 | |a Nipkow, Tobias |d 1958- | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521455206 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521779203 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/CBO9781139172752 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9781139172752 |
|---|---|
| _version_ | 1825574051609837569 |
| adam_text | |
| any_adam_object | |
| author | Baader, Franz |
| author2 | Nipkow, Tobias 1958- |
| author2_role | |
| author2_variant | t n tn |
| author_facet | Baader, Franz Nipkow, Tobias 1958- |
| author_role | |
| author_sort | Baader, Franz |
| author_variant | f b fb |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01828nam a2200277 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9781139172752</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20151005020621.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">111013s1998||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139172752</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Baader, Franz</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Term rewriting and all that</subfield><subfield code="c">Franz Baader and Tobias Nipkow</subfield></datafield><datafield tag="246" ind1="3" ind2=" "><subfield code="a">Term Rewriting & All That</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xii, 301 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nipkow, Tobias</subfield><subfield code="d">1958-</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780521455206</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780521779203</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/CBO9781139172752</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9781139172752 |
| illustrated | Not Illustrated |
| indexdate | 2025-03-03T11:58:05Z |
| institution | BVB |
| isbn | 9781139172752 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (xii, 301 Seiten) |
| psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Baader, Franz Term rewriting and all that Franz Baader and Tobias Nipkow Term Rewriting & All That Cambridge Cambridge University Press 1998 1 Online-Ressource (xii, 301 Seiten) txt c cr 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. Nipkow, Tobias 1958- Erscheint auch als Druck-Ausgabe 9780521455206 Erscheint auch als Druck-Ausgabe 9780521779203 |
| spellingShingle | Baader, Franz Term rewriting and all that |
| title | Term rewriting and all that |
| title_alt | Term Rewriting & All That |
| title_auth | Term rewriting and all that |
| title_exact_search | Term rewriting and all that |
| title_full | Term rewriting and all that Franz Baader and Tobias Nipkow |
| title_fullStr | Term rewriting and all that Franz Baader and Tobias Nipkow |
| title_full_unstemmed | Term rewriting and all that Franz Baader and Tobias Nipkow |
| title_short | Term rewriting and all that |
| title_sort | term rewriting and all that |
| work_keys_str_mv | AT baaderfranz termrewritingandallthat AT nipkowtobias termrewritingandallthat AT baaderfranz termrewritingallthat AT nipkowtobias termrewritingallthat |