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.
@InProceedings{bahr:LIPIcs.RTA.2012.69, author = {Bahr, Patrick}, 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 = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.69}, URN = {urn:nbn:de:0030-drops-34857}, doi = {10.4230/LIPIcs.RTA.2012.69}, annote = {Keywords: term graphs, infinitary rewriting} }
Feedback for Dagstuhl Publishing