Equational term graph rewriting:
Abstract: "We present an equational framework for term graph rewriting with cycles. The usual notion of homomorphism is phrased in terms of the notion of bisimulation, which is well-known in process algebra and concurrency theory. Specifically, a homomorphism is a functional bisimulation. We pr...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1995
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
95,52 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We present an equational framework for term graph rewriting with cycles. The usual notion of homomorphism is phrased in terms of the notion of bisimulation, which is well-known in process algebra and concurrency theory. Specifically, a homomorphism is a functional bisimulation. We prove that the bisimilarity class of a term graph, partially ordered by functional bisimulation, is a complete lattice. It is shown how Equational Logic induces a notion of copying and substitution on term graphs, or systems of recursion equations, and also suggests the introduction of hidden or nameless nodes in a term graph. Hidden nodes can be used only once. The general framework of term graphs with copying is compared with the more restricted copying facilities embodied in the [mu]- rule, and translations are given between term graphs and [mu]-expressions. Using these, a proof system is given for [mu]-expressions that is complete for the semantics given by infinite tree unwinding. Next, orthogonal term graph rewrite systems, also in the presence of copying and hidden nodes, are shown to be confluent." |
| Beschreibung: | 55 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011064182 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961118s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)34780454 | ||
| 035 | |a (DE-599)BVBBV011064182 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Ariola, Zena M. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Equational term graph rewriting |c Z. M. Ariola : J. W. Klop |
| 264 | 1 | |a Amsterdam |c 1995 | |
| 300 | |a 55 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 95,52 | |
| 520 | 3 | |a Abstract: "We present an equational framework for term graph rewriting with cycles. The usual notion of homomorphism is phrased in terms of the notion of bisimulation, which is well-known in process algebra and concurrency theory. Specifically, a homomorphism is a functional bisimulation. We prove that the bisimilarity class of a term graph, partially ordered by functional bisimulation, is a complete lattice. It is shown how Equational Logic induces a notion of copying and substitution on term graphs, or systems of recursion equations, and also suggests the introduction of hidden or nameless nodes in a term graph. Hidden nodes can be used only once. The general framework of term graphs with copying is compared with the more restricted copying facilities embodied in the [mu]- rule, and translations are given between term graphs and [mu]-expressions. Using these, a proof system is given for [mu]-expressions that is complete for the semantics given by infinite tree unwinding. Next, orthogonal term graph rewrite systems, also in the presence of copying and hidden nodes, are shown to be confluent." | |
| 650 | 4 | |a Graph theory | |
| 650 | 4 | |a Homomorphisms (Mathematics) | |
| 650 | 4 | |a Logic, Symbolic and mathematical | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 700 | 1 | |a Klop, Jan Willem |d 1945- |e Verfasser |0 (DE-588)130644498 |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 95,52 |w (DE-604)BV008928356 |9 95,52 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007410164 | ||
Datensatz im Suchindex
| _version_ | 1804125553080401920 |
|---|---|
| any_adam_object | |
| author | Ariola, Zena M. Klop, Jan Willem 1945- |
| author_GND | (DE-588)130644498 |
| author_facet | Ariola, Zena M. Klop, Jan Willem 1945- |
| author_role | aut aut |
| author_sort | Ariola, Zena M. |
| author_variant | z m a zm zma j w k jw jwk |
| building | Verbundindex |
| bvnumber | BV011064182 |
| ctrlnum | (OCoLC)34780454 (DE-599)BVBBV011064182 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02249nam a2200325 cb4500</leader><controlfield tag="001">BV011064182</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961118s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)34780454</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011064182</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="100" ind1="1" ind2=" "><subfield code="a">Ariola, Zena M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Equational term graph rewriting</subfield><subfield code="c">Z. M. Ariola : J. W. Klop</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">55 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">95,52</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We present an equational framework for term graph rewriting with cycles. The usual notion of homomorphism is phrased in terms of the notion of bisimulation, which is well-known in process algebra and concurrency theory. Specifically, a homomorphism is a functional bisimulation. We prove that the bisimilarity class of a term graph, partially ordered by functional bisimulation, is a complete lattice. It is shown how Equational Logic induces a notion of copying and substitution on term graphs, or systems of recursion equations, and also suggests the introduction of hidden or nameless nodes in a term graph. Hidden nodes can be used only once. The general framework of term graphs with copying is compared with the more restricted copying facilities embodied in the [mu]- rule, and translations are given between term graphs and [mu]-expressions. Using these, a proof system is given for [mu]-expressions that is complete for the semantics given by infinite tree unwinding. Next, orthogonal term graph rewrite systems, also in the presence of copying and hidden nodes, are shown to be confluent."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Homomorphisms (Mathematics)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical</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="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">95,52</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">95,52</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007410164</subfield></datafield></record></collection> |
| id | DE-604.BV011064182 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:23Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007410164 |
| oclc_num | 34780454 |
| open_access_boolean | |
| physical | 55 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Ariola, Zena M. Verfasser aut Equational term graph rewriting Z. M. Ariola : J. W. Klop Amsterdam 1995 55 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 95,52 Abstract: "We present an equational framework for term graph rewriting with cycles. The usual notion of homomorphism is phrased in terms of the notion of bisimulation, which is well-known in process algebra and concurrency theory. Specifically, a homomorphism is a functional bisimulation. We prove that the bisimilarity class of a term graph, partially ordered by functional bisimulation, is a complete lattice. It is shown how Equational Logic induces a notion of copying and substitution on term graphs, or systems of recursion equations, and also suggests the introduction of hidden or nameless nodes in a term graph. Hidden nodes can be used only once. The general framework of term graphs with copying is compared with the more restricted copying facilities embodied in the [mu]- rule, and translations are given between term graphs and [mu]-expressions. Using these, a proof system is given for [mu]-expressions that is complete for the semantics given by infinite tree unwinding. Next, orthogonal term graph rewrite systems, also in the presence of copying and hidden nodes, are shown to be confluent." Graph theory Homomorphisms (Mathematics) Logic, Symbolic and mathematical Rewriting systems (Computer science) Klop, Jan Willem 1945- Verfasser (DE-588)130644498 aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 95,52 (DE-604)BV008928356 95,52 |
| spellingShingle | Ariola, Zena M. Klop, Jan Willem 1945- Equational term graph rewriting Graph theory Homomorphisms (Mathematics) Logic, Symbolic and mathematical Rewriting systems (Computer science) |
| title | Equational term graph rewriting |
| title_auth | Equational term graph rewriting |
| title_exact_search | Equational term graph rewriting |
| title_full | Equational term graph rewriting Z. M. Ariola : J. W. Klop |
| title_fullStr | Equational term graph rewriting Z. M. Ariola : J. W. Klop |
| title_full_unstemmed | Equational term graph rewriting Z. M. Ariola : J. W. Klop |
| title_short | Equational term graph rewriting |
| title_sort | equational term graph rewriting |
| topic | Graph theory Homomorphisms (Mathematics) Logic, Symbolic and mathematical Rewriting systems (Computer science) |
| topic_facet | Graph theory Homomorphisms (Mathematics) Logic, Symbolic and mathematical Rewriting systems (Computer science) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT ariolazenam equationaltermgraphrewriting AT klopjanwillem equationaltermgraphrewriting |