On the adequacy of graph rewriting for simulating term rewriting:
Abstract: "Several authors have investigated the correspondence between graph rewriting and term rewriting. Almost invariably they have considered only acyclic graphs. Yet cyclic graphs naturally arise from certain optimisations in implementing functional languages. They correspond to infinite...
Saved in:
| Format: | Book |
|---|---|
| Language: | English |
| Published: |
Amsterdam
1992
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
92,4 |
| Subjects: | |
| Summary: | Abstract: "Several authors have investigated the correspondence between graph rewriting and term rewriting. Almost invariably they have considered only acyclic graphs. Yet cyclic graphs naturally arise from certain optimisations in implementing functional languages. They correspond to infinite terms, and their reductions correspond to transfinite term reduction sequences, which have recently received detailed attention. We first establish a close correspondence between finitary acyclic graph rewriting and finitary term rewriting, and between finitary cyclic graph rewriting and transfinite rational term rewriting. Surprisingly, the correspondence breaks down for general transfinite rewriting We present an example showing that transfinite term rewriting is strictly more powerful than transfinite graph rewriting. |
| Physical Description: | 18 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008993652 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27638385 | ||
| 035 | |a (DE-599)BVBBV008993652 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 245 | 1 | 0 | |a On the adequacy of graph rewriting for simulating term rewriting |c J. R. Kennaway ... |
| 264 | 1 | |a Amsterdam |c 1992 | |
| 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 92,4 | |
| 520 | 3 | |a Abstract: "Several authors have investigated the correspondence between graph rewriting and term rewriting. Almost invariably they have considered only acyclic graphs. Yet cyclic graphs naturally arise from certain optimisations in implementing functional languages. They correspond to infinite terms, and their reductions correspond to transfinite term reduction sequences, which have recently received detailed attention. We first establish a close correspondence between finitary acyclic graph rewriting and finitary term rewriting, and between finitary cyclic graph rewriting and transfinite rational term rewriting. Surprisingly, the correspondence breaks down for general transfinite rewriting | |
| 520 | 3 | |a We present an example showing that transfinite term rewriting is strictly more powerful than transfinite graph rewriting. | |
| 650 | 4 | |a Functional programming (Computer science) | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 700 | 1 | |a Kennaway, J. R. |e Sonstige |4 oth | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 92,4 |w (DE-604)BV008928356 |9 92,4 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005942386 | ||
Record in the Search Index
| _version_ | 1804123336215625728 |
|---|---|
| any_adam_object | |
| building | Verbundindex |
| bvnumber | BV008993652 |
| ctrlnum | (OCoLC)27638385 (DE-599)BVBBV008993652 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01882nam a2200313 cb4500</leader><controlfield tag="001">BV008993652</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27638385</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008993652</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="245" ind1="1" ind2="0"><subfield code="a">On the adequacy of graph rewriting for simulating term rewriting</subfield><subfield code="c">J. R. Kennaway ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1992</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">92,4</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Several authors have investigated the correspondence between graph rewriting and term rewriting. Almost invariably they have considered only acyclic graphs. Yet cyclic graphs naturally arise from certain optimisations in implementing functional languages. They correspond to infinite terms, and their reductions correspond to transfinite term reduction sequences, which have recently received detailed attention. We first establish a close correspondence between finitary acyclic graph rewriting and finitary term rewriting, and between finitary cyclic graph rewriting and transfinite rational term rewriting. Surprisingly, the correspondence breaks down for general transfinite rewriting</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We present an example showing that transfinite term rewriting is strictly more powerful than transfinite graph rewriting.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Functional programming (Computer science)</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">Kennaway, J. R.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</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">92,4</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">92,4</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005942386</subfield></datafield></record></collection> |
| id | DE-604.BV008993652 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:09Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005942386 |
| oclc_num | 27638385 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 18 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | On the adequacy of graph rewriting for simulating term rewriting J. R. Kennaway ... Amsterdam 1992 18 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 92,4 Abstract: "Several authors have investigated the correspondence between graph rewriting and term rewriting. Almost invariably they have considered only acyclic graphs. Yet cyclic graphs naturally arise from certain optimisations in implementing functional languages. They correspond to infinite terms, and their reductions correspond to transfinite term reduction sequences, which have recently received detailed attention. We first establish a close correspondence between finitary acyclic graph rewriting and finitary term rewriting, and between finitary cyclic graph rewriting and transfinite rational term rewriting. Surprisingly, the correspondence breaks down for general transfinite rewriting We present an example showing that transfinite term rewriting is strictly more powerful than transfinite graph rewriting. Functional programming (Computer science) Rewriting systems (Computer science) Kennaway, J. R. Sonstige oth Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 92,4 (DE-604)BV008928356 92,4 |
| spellingShingle | On the adequacy of graph rewriting for simulating term rewriting Functional programming (Computer science) Rewriting systems (Computer science) |
| title | On the adequacy of graph rewriting for simulating term rewriting |
| title_auth | On the adequacy of graph rewriting for simulating term rewriting |
| title_exact_search | On the adequacy of graph rewriting for simulating term rewriting |
| title_full | On the adequacy of graph rewriting for simulating term rewriting J. R. Kennaway ... |
| title_fullStr | On the adequacy of graph rewriting for simulating term rewriting J. R. Kennaway ... |
| title_full_unstemmed | On the adequacy of graph rewriting for simulating term rewriting J. R. Kennaway ... |
| title_short | On the adequacy of graph rewriting for simulating term rewriting |
| title_sort | on the adequacy of graph rewriting for simulating term rewriting |
| topic | Functional programming (Computer science) Rewriting systems (Computer science) |
| topic_facet | Functional programming (Computer science) Rewriting systems (Computer science) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT kennawayjr ontheadequacyofgraphrewritingforsimulatingtermrewriting |