Termination for direct sums of left-linear complete term rewriting systems:
Abstract: "A Term Rewriting System is called complete if it is confluent and terminating. We prove that completeness of TRSs is a 'modular' property (meaning that it stays preserved under direct sums), provided the constituent TRSs are left-linear. Here the direct sum [formula] is the...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1989
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
89,23 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "A Term Rewriting System is called complete if it is confluent and terminating. We prove that completeness of TRSs is a 'modular' property (meaning that it stays preserved under direct sums), provided the constituent TRSs are left-linear. Here the direct sum [formula] is the union of TRSs R[subscript 0], R[subscript 1] with disjoint signature. The proof hinges crucially upon the (non)deterministic collapsing behaviour of terms from the sum TRS." |
| Beschreibung: | 31 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009257906 | ||
| 003 | DE-604 | ||
| 005 | 19950504 | ||
| 007 | t | ||
| 008 | 940313s1989 |||| 00||| eng d | ||
| 035 | |a (OCoLC)22431591 | ||
| 035 | |a (DE-599)BVBBV009257906 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Toyama, Yoshihito |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Termination for direct sums of left-linear complete term rewriting systems |c Y. Tomaya, J. W. Klop, H. P. Barendregt |
| 264 | 1 | |a Amsterdam |c 1989 | |
| 300 | |a 31 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 89,23 | |
| 520 | 3 | |a Abstract: "A Term Rewriting System is called complete if it is confluent and terminating. We prove that completeness of TRSs is a 'modular' property (meaning that it stays preserved under direct sums), provided the constituent TRSs are left-linear. Here the direct sum [formula] is the union of TRSs R[subscript 0], R[subscript 1] with disjoint signature. The proof hinges crucially upon the (non)deterministic collapsing behaviour of terms from the sum TRS." | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 700 | 1 | |a Klop, Jan Willem |d 1945- |e Verfasser |0 (DE-588)130644498 |4 aut | |
| 700 | 1 | |a Barendregt, Hendrik P. |d 1947- |e Verfasser |0 (DE-588)124647219 |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 89,23 |w (DE-604)BV008928356 |9 89,23 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006160016 | ||
Datensatz im Suchindex
| _version_ | 1804123704929550336 |
|---|---|
| any_adam_object | |
| author | Toyama, Yoshihito Klop, Jan Willem 1945- Barendregt, Hendrik P. 1947- |
| author_GND | (DE-588)130644498 (DE-588)124647219 |
| author_facet | Toyama, Yoshihito Klop, Jan Willem 1945- Barendregt, Hendrik P. 1947- |
| author_role | aut aut aut |
| author_sort | Toyama, Yoshihito |
| author_variant | y t yt j w k jw jwk h p b hp hpb |
| building | Verbundindex |
| bvnumber | BV009257906 |
| ctrlnum | (OCoLC)22431591 (DE-599)BVBBV009257906 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01639nam a2200313 cb4500</leader><controlfield tag="001">BV009257906</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19950504 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1989 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22431591</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009257906</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></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Toyama, Yoshihito</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Termination for direct sums of left-linear complete term rewriting systems</subfield><subfield code="c">Y. Tomaya, J. W. Klop, H. P. Barendregt</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">31 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">89,23</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A Term Rewriting System is called complete if it is confluent and terminating. We prove that completeness of TRSs is a 'modular' property (meaning that it stays preserved under direct sums), provided the constituent TRSs are left-linear. Here the direct sum [formula] is the union of TRSs R[subscript 0], R[subscript 1] with disjoint signature. The proof hinges crucially upon the (non)deterministic collapsing behaviour of terms from the sum TRS."</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">Klop, Jan Willem</subfield><subfield code="d">1945-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)130644498</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Barendregt, Hendrik P.</subfield><subfield code="d">1947-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)124647219</subfield><subfield code="4">aut</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">89,23</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">89,23</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006160016</subfield></datafield></record></collection> |
| id | DE-604.BV009257906 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:34:00Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006160016 |
| oclc_num | 22431591 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 31 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Toyama, Yoshihito Verfasser aut Termination for direct sums of left-linear complete term rewriting systems Y. Tomaya, J. W. Klop, H. P. Barendregt Amsterdam 1989 31 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 89,23 Abstract: "A Term Rewriting System is called complete if it is confluent and terminating. We prove that completeness of TRSs is a 'modular' property (meaning that it stays preserved under direct sums), provided the constituent TRSs are left-linear. Here the direct sum [formula] is the union of TRSs R[subscript 0], R[subscript 1] with disjoint signature. The proof hinges crucially upon the (non)deterministic collapsing behaviour of terms from the sum TRS." Rewriting systems (Computer science) Klop, Jan Willem 1945- Verfasser (DE-588)130644498 aut Barendregt, Hendrik P. 1947- Verfasser (DE-588)124647219 aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 89,23 (DE-604)BV008928356 89,23 |
| spellingShingle | Toyama, Yoshihito Klop, Jan Willem 1945- Barendregt, Hendrik P. 1947- Termination for direct sums of left-linear complete term rewriting systems Rewriting systems (Computer science) |
| title | Termination for direct sums of left-linear complete term rewriting systems |
| title_auth | Termination for direct sums of left-linear complete term rewriting systems |
| title_exact_search | Termination for direct sums of left-linear complete term rewriting systems |
| title_full | Termination for direct sums of left-linear complete term rewriting systems Y. Tomaya, J. W. Klop, H. P. Barendregt |
| title_fullStr | Termination for direct sums of left-linear complete term rewriting systems Y. Tomaya, J. W. Klop, H. P. Barendregt |
| title_full_unstemmed | Termination for direct sums of left-linear complete term rewriting systems Y. Tomaya, J. W. Klop, H. P. Barendregt |
| title_short | Termination for direct sums of left-linear complete term rewriting systems |
| title_sort | termination for direct sums of left linear complete term rewriting systems |
| topic | Rewriting systems (Computer science) |
| topic_facet | Rewriting systems (Computer science) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT toyamayoshihito terminationfordirectsumsofleftlinearcompletetermrewritingsystems AT klopjanwillem terminationfordirectsumsofleftlinearcompletetermrewritingsystems AT barendregthendrikp terminationfordirectsumsofleftlinearcompletetermrewritingsystems |