Advanced Topics in Term Rewriting:
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
New York, NY
Springer New York
2002
|
| Edition: | 1st ed. 2002 |
| Subjects: | |
| Online Access: | UBY01 Volltext |
| Summary: | 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 |
| Physical Description: | 1 Online-Ressource (XVI, 414 p) |
| ISBN: | 9781475736618 |
| DOI: | 10.1007/978-1-4757-3661-8 |
Staff View
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV047064344 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 201216s2002 |||| o||u| ||||||eng d | ||
| 020 | |a 9781475736618 |9 978-1-4757-3661-8 | ||
| 024 | 7 | |a 10.1007/978-1-4757-3661-8 |2 doi | |
| 035 | |a (ZDB-2-SCS)978-1-4757-3661-8 | ||
| 035 | |a (OCoLC)1227484139 | ||
| 035 | |a (DE-599)BVBBV047064344 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 082 | 0 | |a 003.3 |2 23 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 100 | 1 | |a Ohlebusch, Enno |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Advanced Topics in Term Rewriting |c by Enno Ohlebusch |
| 250 | |a 1st ed. 2002 | ||
| 264 | 1 | |a New York, NY |b Springer New York |c 2002 | |
| 300 | |a 1 Online-Ressource (XVI, 414 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 520 | |a 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 | ||
| 650 | 4 | |a Computer System Implementation | |
| 650 | 4 | |a Logics and Meanings of Programs | |
| 650 | 4 | |a Mathematical Logic and Formal Languages | |
| 650 | 4 | |a Programming Techniques | |
| 650 | 4 | |a Architecture, Computer | |
| 650 | 4 | |a Computer logic | |
| 650 | 4 | |a Mathematical logic | |
| 650 | 4 | |a Computer programming | |
| 650 | 0 | 7 | |a Termersetzungssystem |0 (DE-588)4117189-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Termersetzungssystem |0 (DE-588)4117189-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781441929211 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780387952505 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781475736625 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4757-3661-8 |x Verlag |z URL des Eerstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SCS | ||
| 940 | 1 | |q ZDB-2-SCS_2000/2004 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032471456 | ||
| 966 | e | |u https://doi.org/10.1007/978-1-4757-3661-8 |l UBY01 |p ZDB-2-SCS |q ZDB-2-SCS_2000/2004 |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1804182062242988032 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Ohlebusch, Enno |
| author_facet | Ohlebusch, Enno |
| author_role | aut |
| author_sort | Ohlebusch, Enno |
| author_variant | e o eo |
| building | Verbundindex |
| bvnumber | BV047064344 |
| classification_rvk | ST 130 |
| collection | ZDB-2-SCS |
| ctrlnum | (ZDB-2-SCS)978-1-4757-3661-8 (OCoLC)1227484139 (DE-599)BVBBV047064344 |
| dewey-full | 003.3 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 003 - Systems |
| dewey-raw | 003.3 |
| dewey-search | 003.3 |
| dewey-sort | 13.3 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1007/978-1-4757-3661-8 |
| edition | 1st ed. 2002 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03372nmm a2200541zc 4500</leader><controlfield tag="001">BV047064344</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">201216s2002 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781475736618</subfield><subfield code="9">978-1-4757-3661-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4757-3661-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-1-4757-3661-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1227484139</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047064344</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">003.3</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ohlebusch, Enno</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Advanced Topics in Term Rewriting</subfield><subfield code="c">by Enno Ohlebusch</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2002</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer New York</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVI, 414 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer System Implementation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logics and Meanings of Programs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical Logic and Formal Languages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming Techniques</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Architecture, Computer</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer logic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical logic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Termersetzungssystem</subfield><subfield code="0">(DE-588)4117189-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Termersetzungssystem</subfield><subfield code="0">(DE-588)4117189-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</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">9781441929211</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">9780387952505</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">9781475736625</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4757-3661-8</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Eerstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2000/2004</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032471456</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4757-3661-8</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">ZDB-2-SCS_2000/2004</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV047064344 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T16:12:22Z |
| indexdate | 2024-07-10T09:01:34Z |
| institution | BVB |
| isbn | 9781475736618 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032471456 |
| oclc_num | 1227484139 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 1 Online-Ressource (XVI, 414 p) |
| psigel | ZDB-2-SCS ZDB-2-SCS_2000/2004 ZDB-2-SCS ZDB-2-SCS_2000/2004 |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Springer New York |
| record_format | marc |
| spelling | Ohlebusch, Enno Verfasser aut Advanced Topics in Term Rewriting by Enno Ohlebusch 1st ed. 2002 New York, NY Springer New York 2002 1 Online-Ressource (XVI, 414 p) txt rdacontent c rdamedia cr rdacarrier 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 Computer System Implementation Logics and Meanings of Programs Mathematical Logic and Formal Languages Programming Techniques Architecture, Computer Computer logic Mathematical logic Computer programming Termersetzungssystem (DE-588)4117189-5 gnd rswk-swf Termersetzungssystem (DE-588)4117189-5 s DE-604 Erscheint auch als Druck-Ausgabe 9781441929211 Erscheint auch als Druck-Ausgabe 9780387952505 Erscheint auch als Druck-Ausgabe 9781475736625 https://doi.org/10.1007/978-1-4757-3661-8 Verlag URL des Eerstveröffentlichers Volltext |
| spellingShingle | Ohlebusch, Enno Advanced Topics in Term Rewriting Computer System Implementation Logics and Meanings of Programs Mathematical Logic and Formal Languages Programming Techniques Architecture, Computer Computer logic Mathematical logic Computer programming Termersetzungssystem (DE-588)4117189-5 gnd |
| subject_GND | (DE-588)4117189-5 |
| title | Advanced Topics in Term Rewriting |
| title_auth | Advanced Topics in Term Rewriting |
| title_exact_search | Advanced Topics in Term Rewriting |
| title_exact_search_txtP | Advanced Topics in Term Rewriting |
| title_full | Advanced Topics in Term Rewriting by Enno Ohlebusch |
| title_fullStr | Advanced Topics in Term Rewriting by Enno Ohlebusch |
| title_full_unstemmed | Advanced Topics in Term Rewriting by Enno Ohlebusch |
| title_short | Advanced Topics in Term Rewriting |
| title_sort | advanced topics in term rewriting |
| topic | Computer System Implementation Logics and Meanings of Programs Mathematical Logic and Formal Languages Programming Techniques Architecture, Computer Computer logic Mathematical logic Computer programming Termersetzungssystem (DE-588)4117189-5 gnd |
| topic_facet | Computer System Implementation Logics and Meanings of Programs Mathematical Logic and Formal Languages Programming Techniques Architecture, Computer Computer logic Mathematical logic Computer programming Termersetzungssystem |
| url | https://doi.org/10.1007/978-1-4757-3661-8 |
| work_keys_str_mv | AT ohlebuschenno advancedtopicsintermrewriting |