Confluence of the disjoint union of conditional term rewriting systems:
Abstract: "Toyama proved that confluence is a modular property of term rewriting systems. This means that the disjoint union of two confluent term rewriting systems is again confluent. In this paper we extend his result to the class of conditional term rewriting systems. In view of the importan...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1989
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
89,44 |
| Subjects: | |
| Summary: | Abstract: "Toyama proved that confluence is a modular property of term rewriting systems. This means that the disjoint union of two confluent term rewriting systems is again confluent. In this paper we extend his result to the class of conditional term rewriting systems. In view of the important role of conditional rewriting in equational logic programming, this result may be of relevance in integrating functional programming and logic programming." |
| Physical Description: | 18 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008949504 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1989 |||| 00||| eng d | ||
| 035 | |a (OCoLC)22516833 | ||
| 035 | |a (DE-599)BVBBV008949504 | ||
| 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 Confluence of the disjoint union of conditional term rewriting systems |
| 264 | 1 | |a Amsterdam |c 1989 | |
| 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 89,44 | |
| 520 | 3 | |a Abstract: "Toyama proved that confluence is a modular property of term rewriting systems. This means that the disjoint union of two confluent term rewriting systems is again confluent. In this paper we extend his result to the class of conditional term rewriting systems. In view of the important role of conditional rewriting in equational logic programming, this result may be of relevance in integrating functional programming and logic programming." | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 89,44 |w (DE-604)BV008928356 |9 89,44 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005905161 | ||
Record in the Search Index
| _version_ | 1804123282629197824 |
|---|---|
| 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 | BV008949504 |
| ctrlnum | (OCoLC)22516833 (DE-599)BVBBV008949504 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01457nam a2200289 cb4500</leader><controlfield tag="001">BV008949504</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1989 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22516833</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008949504</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">Confluence of the disjoint union of conditional term rewriting systems</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">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">89,44</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Toyama proved that confluence is a modular property of term rewriting systems. This means that the disjoint union of two confluent term rewriting systems is again confluent. In this paper we extend his result to the class of conditional term rewriting systems. In view of the important role of conditional rewriting in equational logic programming, this result may be of relevance in integrating functional programming and logic programming."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rewriting systems (Computer science)</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,44</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">89,44</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005905161</subfield></datafield></record></collection> |
| id | DE-604.BV008949504 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:18Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005905161 |
| oclc_num | 22516833 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 18 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| 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 Confluence of the disjoint union of conditional term rewriting systems Amsterdam 1989 18 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 89,44 Abstract: "Toyama proved that confluence is a modular property of term rewriting systems. This means that the disjoint union of two confluent term rewriting systems is again confluent. In this paper we extend his result to the class of conditional term rewriting systems. In view of the important role of conditional rewriting in equational logic programming, this result may be of relevance in integrating functional programming and logic programming." Rewriting systems (Computer science) Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 89,44 (DE-604)BV008928356 89,44 |
| spellingShingle | Middeldorp, Aart 1963- Confluence of the disjoint union of conditional term rewriting systems Rewriting systems (Computer science) |
| title | Confluence of the disjoint union of conditional term rewriting systems |
| title_auth | Confluence of the disjoint union of conditional term rewriting systems |
| title_exact_search | Confluence of the disjoint union of conditional term rewriting systems |
| title_full | Confluence of the disjoint union of conditional term rewriting systems |
| title_fullStr | Confluence of the disjoint union of conditional term rewriting systems |
| title_full_unstemmed | Confluence of the disjoint union of conditional term rewriting systems |
| title_short | Confluence of the disjoint union of conditional term rewriting systems |
| title_sort | confluence of the disjoint union of conditional term rewriting systems |
| topic | Rewriting systems (Computer science) |
| topic_facet | Rewriting systems (Computer science) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT middeldorpaart confluenceofthedisjointunionofconditionaltermrewritingsystems |