Infinitary term graph rewriting is simple, sound and complete
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Documents
- Bahr_2012_Infinitary_term_graph
Final published version, 453 KB, PDF document
Based on a simple metric and a simple partial order on term graphs, we develop two infinitary calculi of term graph rewriting. We show that, similarly to infinitary term rewriting, the partial order formalisation yields a conservative extension of the metric formalisation of the calculus. By showing that the resulting calculi simulate the corresponding well-established infinitary calculi of term rewriting in a sound and complete manner, we argue for the appropriateness of our approach to capture the notion of infinitary term graph rewriting.
Original language | English |
---|---|
Title of host publication | 23rd International Conference on Rewriting Techniques and Applications (RTA'12) |
Editors | Ashish Tiwari |
Number of pages | 16 |
Publisher | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
Publication date | 2012 |
Pages | 69-84 |
ISBN (Electronic) | 978-3-939897-38-5 |
DOIs | |
Publication status | Published - 2012 |
Event | 23rd International Conference on Rewriting Techniques and Applications - Nagoya, Japan Duration: 28 May 2012 → 2 Jun 2012 Conference number: 23 |
Conference
Conference | 23rd International Conference on Rewriting Techniques and Applications |
---|---|
Nummer | 23 |
Land | Japan |
By | Nagoya |
Periode | 28/05/2012 → 02/06/2012 |
Series | Leibniz International Proceedings in Informatics |
---|---|
Volume | 15 |
ISSN | 1868-8969 |
- Faculty of Science - term graphs, infinitary rewriting, simulation, normalising, strong convergence
Research areas
Number of downloads are based on statistics from Google Scholar and www.ku.dk
No data available
ID: 38429358