Unique normal forms for disjoint unions of conditional term rewriting systems:
Abstract: "In [14] we have shown that every term rewriting system with the unique normal form property can be conservatively extended to a confluent term rewriting system with the same set of normal forms. This paper gives a simplified construction, which moreover yields a positive answer to a...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1990
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
90,3 |
| Subjects: | |
| Online Access: | Volltext |
| Summary: | Abstract: "In [14] we have shown that every term rewriting system with the unique normal form property can be conservatively extended to a confluent term rewriting system with the same set of normal forms. This paper gives a simplified construction, which moreover yields a positive answer to a conjecture in [14] stating that the normal form property is a modular property of left-linear term rewriting systems. We further show that the main result of [14] -- the modularity of unique normal forms -- can be generalized to semi-equational conditional term rewriting systems; however, for join and normal conditional term rewriting systems the method of [14] fails." |
| Physical Description: | 16 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008949491 | ||
| 003 | DE-604 | ||
| 005 | 20220207 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)23953863 | ||
| 035 | |a (DE-599)BVBBV008949491 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 100 | 1 | |a Middeldorp, Aart |d 1963- |e Verfasser |0 (DE-588)121450279 |4 aut | |
| 245 | 1 | 0 | |a Unique normal forms for disjoint unions of conditional term rewriting systems |
| 264 | 1 | |a Amsterdam |c 1990 | |
| 300 | |a 16 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 90,3 | |
| 520 | 3 | |a Abstract: "In [14] we have shown that every term rewriting system with the unique normal form property can be conservatively extended to a confluent term rewriting system with the same set of normal forms. This paper gives a simplified construction, which moreover yields a positive answer to a conjecture in [14] stating that the normal form property is a modular property of left-linear term rewriting systems. We further show that the main result of [14] -- the modularity of unique normal forms -- can be generalized to semi-equational conditional term rewriting systems; however, for join and normal conditional term rewriting systems the method of [14] fails." | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 90,3 |w (DE-604)BV008928356 |9 90,3 | |
| 856 | 4 | 1 | |u https://ir.cwi.nl/pub/5764 |x Verlag |z kostenfrei |3 Volltext |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005905148 | ||
Record in the Search Index
| _version_ | 1804123282591449088 |
|---|---|
| any_adam_object | |
| author | Middeldorp, Aart 1963- |
| author_GND | (DE-588)121450279 |
| author_facet | Middeldorp, Aart 1963- |
| author_role | aut |
| author_sort | Middeldorp, Aart 1963- |
| author_variant | a m am |
| building | Verbundindex |
| bvnumber | BV008949491 |
| collection | ebook |
| ctrlnum | (OCoLC)23953863 (DE-599)BVBBV008949491 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01828nam a2200325 cb4500</leader><controlfield tag="001">BV008949491</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220207 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)23953863</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008949491</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Middeldorp, Aart</subfield><subfield code="d">1963-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121450279</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Unique normal forms for disjoint unions of conditional term rewriting systems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 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">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">90,3</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In [14] we have shown that every term rewriting system with the unique normal form property can be conservatively extended to a confluent term rewriting system with the same set of normal forms. This paper gives a simplified construction, which moreover yields a positive answer to a conjecture in [14] stating that the normal form property is a modular property of left-linear term rewriting systems. We further show that the main result of [14] -- the modularity of unique normal forms -- can be generalized to semi-equational conditional term rewriting systems; however, for join and normal conditional term rewriting systems the method of [14] fails."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rewriting systems (Computer science)</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">90,3</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">90,3</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://ir.cwi.nl/pub/5764</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005905148</subfield></datafield></record></collection> |
| id | DE-604.BV008949491 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:18Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005905148 |
| oclc_num | 23953863 |
| open_access_boolean | 1 |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 16 S. |
| psigel | ebook |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Middeldorp, Aart 1963- Verfasser (DE-588)121450279 aut Unique normal forms for disjoint unions of conditional term rewriting systems Amsterdam 1990 16 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 90,3 Abstract: "In [14] we have shown that every term rewriting system with the unique normal form property can be conservatively extended to a confluent term rewriting system with the same set of normal forms. This paper gives a simplified construction, which moreover yields a positive answer to a conjecture in [14] stating that the normal form property is a modular property of left-linear term rewriting systems. We further show that the main result of [14] -- the modularity of unique normal forms -- can be generalized to semi-equational conditional term rewriting systems; however, for join and normal conditional term rewriting systems the method of [14] fails." Rewriting systems (Computer science) Erscheint auch als Online-Ausgabe Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 90,3 (DE-604)BV008928356 90,3 https://ir.cwi.nl/pub/5764 Verlag kostenfrei Volltext |
| spellingShingle | Middeldorp, Aart 1963- Unique normal forms for disjoint unions of conditional term rewriting systems Rewriting systems (Computer science) |
| title | Unique normal forms for disjoint unions of conditional term rewriting systems |
| title_auth | Unique normal forms for disjoint unions of conditional term rewriting systems |
| title_exact_search | Unique normal forms for disjoint unions of conditional term rewriting systems |
| title_full | Unique normal forms for disjoint unions of conditional term rewriting systems |
| title_fullStr | Unique normal forms for disjoint unions of conditional term rewriting systems |
| title_full_unstemmed | Unique normal forms for disjoint unions of conditional term rewriting systems |
| title_short | Unique normal forms for disjoint unions of conditional term rewriting systems |
| title_sort | unique normal forms for disjoint unions of conditional term rewriting systems |
| topic | Rewriting systems (Computer science) |
| topic_facet | Rewriting systems (Computer science) |
| url | https://ir.cwi.nl/pub/5764 |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT middeldorpaart uniquenormalformsfordisjointunionsofconditionaltermrewritingsystems |