Higher-order rewrite systems and their confluence:
Abstract: "We introduce Higher-Order Rewrite Systems (HRS) which extend term rewriting to [lambda]-terms. HRS can describe computations on arbitrary terms with bound variables. We show that rewriting is closely related to undirected equational reasoning, and extend three confluence results from...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
München
1994
|
| Series: | Technische Universität <München>: TUM-I
9433 |
| Subjects: | |
| Summary: | Abstract: "We introduce Higher-Order Rewrite Systems (HRS) which extend term rewriting to [lambda]-terms. HRS can describe computations on arbitrary terms with bound variables. We show that rewriting is closely related to undirected equational reasoning, and extend three confluence results from term rewriting to HRS: the critical pair lemma by Knuth and Bendix, confluence of rewriting modulo equations à la Huet, and confluence of orthogonal HRS." |
| Physical Description: | 28 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV013489040 | ||
| 003 | DE-604 | ||
| 005 | 20040416 | ||
| 007 | t | ||
| 008 | 001211s1994 |||| 00||| eng d | ||
| 035 | |a (OCoLC)35519399 | ||
| 035 | |a (DE-599)BVBBV013489040 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Mayr, Richard |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Higher-order rewrite systems and their confluence |c Richard Mayr and Tobias Nipkow |
| 264 | 1 | |a München |c 1994 | |
| 300 | |a 28 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Technische Universität <München>: TUM-I |v 9433 | |
| 520 | 3 | |a Abstract: "We introduce Higher-Order Rewrite Systems (HRS) which extend term rewriting to [lambda]-terms. HRS can describe computations on arbitrary terms with bound variables. We show that rewriting is closely related to undirected equational reasoning, and extend three confluence results from term rewriting to HRS: the critical pair lemma by Knuth and Bendix, confluence of rewriting modulo equations à la Huet, and confluence of orthogonal HRS." | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 700 | 1 | |a Nipkow, Tobias |d 1958- |e Verfasser |0 (DE-588)17275660X |4 aut | |
| 830 | 0 | |a Technische Universität <München>: TUM-I |v 9433 |w (DE-604)BV006185376 |9 9433 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-009206019 | ||
Record in the Search Index
| _version_ | 1804128279472373760 |
|---|---|
| any_adam_object | |
| author | Mayr, Richard Nipkow, Tobias 1958- |
| author_GND | (DE-588)17275660X |
| author_facet | Mayr, Richard Nipkow, Tobias 1958- |
| author_role | aut aut |
| author_sort | Mayr, Richard |
| author_variant | r m rm t n tn |
| building | Verbundindex |
| bvnumber | BV013489040 |
| ctrlnum | (OCoLC)35519399 (DE-599)BVBBV013489040 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01404nam a2200301 cb4500</leader><controlfield tag="001">BV013489040</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040416 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">001211s1994 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35519399</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013489040</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mayr, Richard</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Higher-order rewrite systems and their confluence</subfield><subfield code="c">Richard Mayr and Tobias Nipkow</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">28 S.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Technische Universität <München>: TUM-I</subfield><subfield code="v">9433</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We introduce Higher-Order Rewrite Systems (HRS) which extend term rewriting to [lambda]-terms. HRS can describe computations on arbitrary terms with bound variables. We show that rewriting is closely related to undirected equational reasoning, and extend three confluence results from term rewriting to HRS: the critical pair lemma by Knuth and Bendix, confluence of rewriting modulo equations à la Huet, and confluence of orthogonal HRS."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rewriting systems (Computer science)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nipkow, Tobias</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)17275660X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Technische Universität <München>: TUM-I</subfield><subfield code="v">9433</subfield><subfield code="w">(DE-604)BV006185376</subfield><subfield code="9">9433</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009206019</subfield></datafield></record></collection> |
| id | DE-604.BV013489040 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:46:43Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009206019 |
| oclc_num | 35519399 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 28 S. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| record_format | marc |
| series | Technische Universität <München>: TUM-I |
| series2 | Technische Universität <München>: TUM-I |
| spelling | Mayr, Richard Verfasser aut Higher-order rewrite systems and their confluence Richard Mayr and Tobias Nipkow München 1994 28 S. txt rdacontent n rdamedia nc rdacarrier Technische Universität <München>: TUM-I 9433 Abstract: "We introduce Higher-Order Rewrite Systems (HRS) which extend term rewriting to [lambda]-terms. HRS can describe computations on arbitrary terms with bound variables. We show that rewriting is closely related to undirected equational reasoning, and extend three confluence results from term rewriting to HRS: the critical pair lemma by Knuth and Bendix, confluence of rewriting modulo equations à la Huet, and confluence of orthogonal HRS." Rewriting systems (Computer science) Nipkow, Tobias 1958- Verfasser (DE-588)17275660X aut Technische Universität <München>: TUM-I 9433 (DE-604)BV006185376 9433 |
| spellingShingle | Mayr, Richard Nipkow, Tobias 1958- Higher-order rewrite systems and their confluence Technische Universität <München>: TUM-I Rewriting systems (Computer science) |
| title | Higher-order rewrite systems and their confluence |
| title_auth | Higher-order rewrite systems and their confluence |
| title_exact_search | Higher-order rewrite systems and their confluence |
| title_full | Higher-order rewrite systems and their confluence Richard Mayr and Tobias Nipkow |
| title_fullStr | Higher-order rewrite systems and their confluence Richard Mayr and Tobias Nipkow |
| title_full_unstemmed | Higher-order rewrite systems and their confluence Richard Mayr and Tobias Nipkow |
| title_short | Higher-order rewrite systems and their confluence |
| title_sort | higher order rewrite systems and their confluence |
| topic | Rewriting systems (Computer science) |
| topic_facet | Rewriting systems (Computer science) |
| volume_link | (DE-604)BV006185376 |
| work_keys_str_mv | AT mayrrichard higherorderrewritesystemsandtheirconfluence AT nipkowtobias higherorderrewritesystemsandtheirconfluence |