Event structures and orthogonal term graph rewriting:
Abstract: "For every normalisable term in an orthogonal term graph rewrite system, we construct an elementary event structure. Its events are the essentially different redexes which must be reduced to reach the normal form of the term. The associated state domain is the set of Lévy equivalence...
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1993
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
93,47 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "For every normalisable term in an orthogonal term graph rewrite system, we construct an elementary event structure. Its events are the essentially different redexes which must be reduced to reach the normal form of the term. The associated state domain is the set of Lévy equivalence classes of needed reduction sequences starting from the term. Various properties of the event structure and state domain are related to properties of the term. The problems arising in extending this work to term rewrite systems and non-orthogonal rewrite systems are also discussed." |
| Beschreibung: | 19 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009034679 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940227s1993 |||| 00||| eng d | ||
| 035 | |a (OCoLC)31184820 | ||
| 035 | |a (DE-599)BVBBV009034679 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 245 | 1 | 0 | |a Event structures and orthogonal term graph rewriting |c J. R. Kennaway ... |
| 264 | 1 | |a Amsterdam |c 1993 | |
| 300 | |a 19 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 93,47 | |
| 520 | 3 | |a Abstract: "For every normalisable term in an orthogonal term graph rewrite system, we construct an elementary event structure. Its events are the essentially different redexes which must be reduced to reach the normal form of the term. The associated state domain is the set of Lévy equivalence classes of needed reduction sequences starting from the term. Various properties of the event structure and state domain are related to properties of the term. The problems arising in extending this work to term rewrite systems and non-orthogonal rewrite systems are also discussed." | |
| 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 93,47 |w (DE-604)BV008928356 |9 93,47 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005977217 | ||
Datensatz im Suchindex
| _version_ | 1804123388133769217 |
|---|---|
| any_adam_object | |
| building | Verbundindex |
| bvnumber | BV009034679 |
| ctrlnum | (OCoLC)31184820 (DE-599)BVBBV009034679 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01615nam a2200301 cb4500</leader><controlfield tag="001">BV009034679</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1993 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31184820</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009034679</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">Event structures and orthogonal term graph rewriting</subfield><subfield code="c">J. R. Kennaway ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 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">93,47</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "For every normalisable term in an orthogonal term graph rewrite system, we construct an elementary event structure. Its events are the essentially different redexes which must be reduced to reach the normal form of the term. The associated state domain is the set of Lévy equivalence classes of needed reduction sequences starting from the term. Various properties of the event structure and state domain are related to properties of the term. The problems arising in extending this work to term rewrite systems and non-orthogonal rewrite systems are also discussed."</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">93,47</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">93,47</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005977217</subfield></datafield></record></collection> |
| id | DE-604.BV009034679 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:58Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005977217 |
| oclc_num | 31184820 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 19 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Event structures and orthogonal term graph rewriting J. R. Kennaway ... Amsterdam 1993 19 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 93,47 Abstract: "For every normalisable term in an orthogonal term graph rewrite system, we construct an elementary event structure. Its events are the essentially different redexes which must be reduced to reach the normal form of the term. The associated state domain is the set of Lévy equivalence classes of needed reduction sequences starting from the term. Various properties of the event structure and state domain are related to properties of the term. The problems arising in extending this work to term rewrite systems and non-orthogonal rewrite systems are also discussed." 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> 93,47 (DE-604)BV008928356 93,47 |
| spellingShingle | Event structures and orthogonal term graph rewriting Functional programming (Computer science) Rewriting systems (Computer science) |
| title | Event structures and orthogonal term graph rewriting |
| title_auth | Event structures and orthogonal term graph rewriting |
| title_exact_search | Event structures and orthogonal term graph rewriting |
| title_full | Event structures and orthogonal term graph rewriting J. R. Kennaway ... |
| title_fullStr | Event structures and orthogonal term graph rewriting J. R. Kennaway ... |
| title_full_unstemmed | Event structures and orthogonal term graph rewriting J. R. Kennaway ... |
| title_short | Event structures and orthogonal term graph rewriting |
| title_sort | event structures and orthogonal term graph 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 eventstructuresandorthogonaltermgraphrewriting |