Completeness of combinations of constructor systems:
Abstract: "A term rewriting system is called complete if it is both confluent and strongly normalizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems does not need to be complete. In other words, completeness is not a modular property of term rewriting sy...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1990
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS
90,58 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | Abstract: "A term rewriting system is called complete if it is both confluent and strongly normalizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems does not need to be complete. In other words, completeness is not a modular property of term rewriting systems. Toyama, Klop and Barendregt showed that completeness is a modular property of left-linear TRS's. In this paper we show that it is sufficient to impose the constructor discipline for obtaining the modularity of completeness. This result is a simple consequence of a quite powerful divide and conquer technique for establishing completeness of such constructor systems Our approach is not limited to systems which are composed of disjoint parts. The importance of our method is that we may decompose a given constructor system into parts which possibly share function symbols and rewrite rules in order to infer completeness. We obtain a similar technique for semi-completeness, i.e. the combination of confluence and weak normalization. |
| Beschreibung: | 18 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008974434 | ||
| 003 | DE-604 | ||
| 005 | 20220228 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)24021577 | ||
| 035 | |a (DE-599)BVBBV008974434 | ||
| 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 Completeness of combinations of constructor systems |c A. Middeldorp ; Y. Toyama |
| 264 | 1 | |a Amsterdam |c 1990 | |
| 300 | |a 18 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,58 | |
| 520 | 3 | |a Abstract: "A term rewriting system is called complete if it is both confluent and strongly normalizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems does not need to be complete. In other words, completeness is not a modular property of term rewriting systems. Toyama, Klop and Barendregt showed that completeness is a modular property of left-linear TRS's. In this paper we show that it is sufficient to impose the constructor discipline for obtaining the modularity of completeness. This result is a simple consequence of a quite powerful divide and conquer technique for establishing completeness of such constructor systems | |
| 520 | 3 | |a Our approach is not limited to systems which are composed of disjoint parts. The importance of our method is that we may decompose a given constructor system into parts which possibly share function symbols and rewrite rules in order to infer completeness. We obtain a similar technique for semi-completeness, i.e. the combination of confluence and weak normalization. | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 700 | 1 | |a Toyama, Yoshihito |e Verfasser |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |
| 830 | 0 | |a Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS |v 90,58 |w (DE-604)BV008928356 |9 90,58 | |
| 856 | 4 | 1 | |u https://ir.cwi.nl/pub/5644 |x Verlag |z kostenfrei |3 Volltext |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005926008 | ||
Datensatz im Suchindex
| _version_ | 1804123312469573632 |
|---|---|
| any_adam_object | |
| author | Middeldorp, Aart 1963- Toyama, Yoshihito |
| author_GND | (DE-588)121450279 |
| author_facet | Middeldorp, Aart 1963- Toyama, Yoshihito |
| author_role | aut aut |
| author_sort | Middeldorp, Aart 1963- |
| author_variant | a m am y t yt |
| building | Verbundindex |
| bvnumber | BV008974434 |
| collection | ebook |
| ctrlnum | (OCoLC)24021577 (DE-599)BVBBV008974434 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02268nam a2200349 cb4500</leader><controlfield tag="001">BV008974434</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220228 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24021577</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008974434</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">Completeness of combinations of constructor systems</subfield><subfield code="c">A. Middeldorp ; Y. Toyama</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">18 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,58</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A term rewriting system is called complete if it is both confluent and strongly normalizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems does not need to be complete. In other words, completeness is not a modular property of term rewriting systems. Toyama, Klop and Barendregt showed that completeness is a modular property of left-linear TRS's. In this paper we show that it is sufficient to impose the constructor discipline for obtaining the modularity of completeness. This result is a simple consequence of a quite powerful divide and conquer technique for establishing completeness of such constructor systems</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Our approach is not limited to systems which are composed of disjoint parts. The importance of our method is that we may decompose a given constructor system into parts which possibly share function symbols and rewrite rules in order to infer completeness. We obtain a similar technique for semi-completeness, i.e. the combination of confluence and weak normalization.</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">Toyama, Yoshihito</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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="830" ind1=" " ind2="0"><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS</subfield><subfield code="v">90,58</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">90,58</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://ir.cwi.nl/pub/5644</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-005926008</subfield></datafield></record></collection> |
| id | DE-604.BV008974434 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:46Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005926008 |
| oclc_num | 24021577 |
| open_access_boolean | 1 |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 18 S. |
| psigel | ebook |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series | Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS |
| spelling | Middeldorp, Aart 1963- Verfasser (DE-588)121450279 aut Completeness of combinations of constructor systems A. Middeldorp ; Y. Toyama Amsterdam 1990 18 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS 90,58 Abstract: "A term rewriting system is called complete if it is both confluent and strongly normalizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems does not need to be complete. In other words, completeness is not a modular property of term rewriting systems. Toyama, Klop and Barendregt showed that completeness is a modular property of left-linear TRS's. In this paper we show that it is sufficient to impose the constructor discipline for obtaining the modularity of completeness. This result is a simple consequence of a quite powerful divide and conquer technique for establishing completeness of such constructor systems Our approach is not limited to systems which are composed of disjoint parts. The importance of our method is that we may decompose a given constructor system into parts which possibly share function symbols and rewrite rules in order to infer completeness. We obtain a similar technique for semi-completeness, i.e. the combination of confluence and weak normalization. Rewriting systems (Computer science) Toyama, Yoshihito Verfasser aut Erscheint auch als Online-Ausgabe Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS 90,58 (DE-604)BV008928356 90,58 https://ir.cwi.nl/pub/5644 Verlag kostenfrei Volltext |
| spellingShingle | Middeldorp, Aart 1963- Toyama, Yoshihito Completeness of combinations of constructor systems Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS Rewriting systems (Computer science) |
| title | Completeness of combinations of constructor systems |
| title_auth | Completeness of combinations of constructor systems |
| title_exact_search | Completeness of combinations of constructor systems |
| title_full | Completeness of combinations of constructor systems A. Middeldorp ; Y. Toyama |
| title_fullStr | Completeness of combinations of constructor systems A. Middeldorp ; Y. Toyama |
| title_full_unstemmed | Completeness of combinations of constructor systems A. Middeldorp ; Y. Toyama |
| title_short | Completeness of combinations of constructor systems |
| title_sort | completeness of combinations of constructor systems |
| topic | Rewriting systems (Computer science) |
| topic_facet | Rewriting systems (Computer science) |
| url | https://ir.cwi.nl/pub/5644 |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT middeldorpaart completenessofcombinationsofconstructorsystems AT toyamayoshihito completenessofcombinationsofconstructorsystems |