Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.RTA.2012.69
URN: urn:nbn:de:0030-drops-34857
URL: https://drops.dagstuhl.de/opus/volltexte/2012/3485/
Bahr, Patrick
Infinitary Term Graph Rewriting is Simple, Sound and Complete
| pdf-format: |
|
Abstract
Based on a simple metric and a simple partial order on term graphs, we develop two infinitary calculi of term graph rewriting. We showthat, 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.
BibTeX - Entry
@InProceedings{bahr:LIPIcs:2012:3485,
author = {Patrick Bahr},
title = {{Infinitary Term Graph Rewriting is Simple, Sound and Complete}},
booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12) },
pages = {69--84},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-38-5},
ISSN = {1868-8969},
year = {2012},
volume = {15},
editor = {Ashish Tiwari},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3485},
URN = {urn:nbn:de:0030-drops-34857},
doi = {10.4230/LIPIcs.RTA.2012.69},
annote = {Keywords: term graphs, infinitary rewriting}
}
| Keywords: | term graphs, infinitary rewriting | |
| Seminar: | 23rd International Conference on Rewriting Techniques and Applications (RTA'12) | |
| Issue date: | 2012 | |
| Date of publication: | 29.05.2012 |
