Modular properties of conditional terms rewriting systems:
Abstract: "A property of term rewriting systems is called modular if it is preserved under disjoint union. For unconditional term rewriting systems several modularity results are known. The aim of this paper is to analyze and extend these results to conditional term rewriting systems. It turns...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1991
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
91,5 |
| Subjects: | |
| Summary: | Abstract: "A property of term rewriting systems is called modular if it is preserved under disjoint union. For unconditional term rewriting systems several modularity results are known. The aim of this paper is to analyze and extend these results to conditional term rewriting systems. It turns out that conditional term rewriting is much more complicated than unconditional rewriting from a modularity point of view. For instance, we will show that the modularity of weak normalization for unconditional term rewriting systems does not extend to conditional term rewriting systems. On the positive side, we mention the extension of Toyama's confluence result for disjoint unions of term rewriting systems to conditional term rewriting systems." |
| Physical Description: | 42 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009224563 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)24806991 | ||
| 035 | |a (DE-599)BVBBV009224563 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Middeldorp, Aart |d 1963- |e Verfasser |0 (DE-588)121450279 |4 aut | |
| 245 | 1 | 0 | |a Modular properties of conditional terms rewriting systems |c A. Middeldorp |
| 264 | 1 | |a Amsterdam |c 1991 | |
| 300 | |a 42 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 91,5 | |
| 520 | 3 | |a Abstract: "A property of term rewriting systems is called modular if it is preserved under disjoint union. For unconditional term rewriting systems several modularity results are known. The aim of this paper is to analyze and extend these results to conditional term rewriting systems. It turns out that conditional term rewriting is much more complicated than unconditional rewriting from a modularity point of view. For instance, we will show that the modularity of weak normalization for unconditional term rewriting systems does not extend to conditional term rewriting systems. On the positive side, we mention the extension of Toyama's confluence result for disjoint unions of term rewriting systems to conditional term rewriting systems." | |
| 650 | 4 | |a Abstract data types (Computer science) | |
| 650 | 4 | |a Modular programming | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 91,5 |w (DE-604)BV008928356 |9 91,5 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006133799 | ||
Record in the Search Index
| _version_ | 1804123667643236352 |
|---|---|
| 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 | BV009224563 |
| ctrlnum | (OCoLC)24806991 (DE-599)BVBBV009224563 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01786nam a2200301 cb4500</leader><controlfield tag="001">BV009224563</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24806991</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009224563</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">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">Modular properties of conditional terms rewriting systems</subfield><subfield code="c">A. Middeldorp</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">42 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">91,5</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A property of term rewriting systems is called modular if it is preserved under disjoint union. For unconditional term rewriting systems several modularity results are known. The aim of this paper is to analyze and extend these results to conditional term rewriting systems. It turns out that conditional term rewriting is much more complicated than unconditional rewriting from a modularity point of view. For instance, we will show that the modularity of weak normalization for unconditional term rewriting systems does not extend to conditional term rewriting systems. On the positive side, we mention the extension of Toyama's confluence result for disjoint unions of term rewriting systems to conditional term rewriting systems."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Abstract data types (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Modular programming</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">91,5</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">91,5</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006133799</subfield></datafield></record></collection> |
| id | DE-604.BV009224563 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:25Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006133799 |
| oclc_num | 24806991 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 42 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| 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 Modular properties of conditional terms rewriting systems A. Middeldorp Amsterdam 1991 42 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 91,5 Abstract: "A property of term rewriting systems is called modular if it is preserved under disjoint union. For unconditional term rewriting systems several modularity results are known. The aim of this paper is to analyze and extend these results to conditional term rewriting systems. It turns out that conditional term rewriting is much more complicated than unconditional rewriting from a modularity point of view. For instance, we will show that the modularity of weak normalization for unconditional term rewriting systems does not extend to conditional term rewriting systems. On the positive side, we mention the extension of Toyama's confluence result for disjoint unions of term rewriting systems to conditional term rewriting systems." Abstract data types (Computer science) Modular programming Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 91,5 (DE-604)BV008928356 91,5 |
| spellingShingle | Middeldorp, Aart 1963- Modular properties of conditional terms rewriting systems Abstract data types (Computer science) Modular programming |
| title | Modular properties of conditional terms rewriting systems |
| title_auth | Modular properties of conditional terms rewriting systems |
| title_exact_search | Modular properties of conditional terms rewriting systems |
| title_full | Modular properties of conditional terms rewriting systems A. Middeldorp |
| title_fullStr | Modular properties of conditional terms rewriting systems A. Middeldorp |
| title_full_unstemmed | Modular properties of conditional terms rewriting systems A. Middeldorp |
| title_short | Modular properties of conditional terms rewriting systems |
| title_sort | modular properties of conditional terms rewriting systems |
| topic | Abstract data types (Computer science) Modular programming |
| topic_facet | Abstract data types (Computer science) Modular programming |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT middeldorpaart modularpropertiesofconditionaltermsrewritingsystems |