Infinitary Term Graph Rewriting is Simple, Sound and Complete
- University of Copenhagen
Research Output:
Conference Article in Proceeding or Book/Report chapter
Book chapter
Peer-reviewOpen access
Publication Information
Output type
Research Output:
Conference Article in Proceeding or Book/Report chapter
Book chapter
Peer-reviewOriginal language
Undefined/UnknownPages from-to (Number of pages)
Pages 69-84 (16 pages)Publication milestones
- Published - 01/05/2012
Publication status
Published - 01/05/2012
Place of publication
Dagstuhl, GermanyVolume
15Publisher
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbHISBN (Print)
978-3-939897-38-5Publication IDs
- Scopus: 84880248195
Host publication title
23rd International Conference on Rewriting Techniques and Applications (RTA'12)Host publication editors
- Ashish Tiwari
Abstract
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.
Publication metrics
PlumX, opens in new tab
Captures
3
Citations
6
