Standard
Infinitary term graph rewriting is simple, sound and complete. / Bahr, Patrick.
23rd International Conference on Rewriting Techniques and Applications (RTA'12). ed. / Ashish Tiwari. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. p. 69-84 (Leibniz International Proceedings in Informatics, Vol. 15).
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Bahr, P 2012,
Infinitary term graph rewriting is simple, sound and complete. in A Tiwari (ed.),
23rd International Conference on Rewriting Techniques and Applications (RTA'12). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics, vol. 15, pp. 69-84, 23rd International Conference on Rewriting Techniques and Applications, Nagoya, Japan,
28/05/2012.
https://doi.org/10.4230/LIPIcs.RTA.2012.69APA
Bahr, P. (2012).
Infinitary term graph rewriting is simple, sound and complete. In A. Tiwari (Ed.),
23rd International Conference on Rewriting Techniques and Applications (RTA'12) (pp. 69-84). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Leibniz International Proceedings in Informatics Vol. 15
https://doi.org/10.4230/LIPIcs.RTA.2012.69Vancouver
Bahr P.
Infinitary term graph rewriting is simple, sound and complete. In Tiwari A, editor, 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 2012. p. 69-84. (Leibniz International Proceedings in Informatics, Vol. 15).
https://doi.org/10.4230/LIPIcs.RTA.2012.69Author
Bahr, Patrick. / Infinitary term graph rewriting is simple, sound and complete. 23rd International Conference on Rewriting Techniques and Applications (RTA'12). editor / Ashish Tiwari. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. pp. 69-84 (Leibniz International Proceedings in Informatics, Vol. 15).
Bibtex
@inproceedings{b1da3943daf8438b87bb5e1e4071eb4e,
title = "Infinitary term graph rewriting is simple, sound and complete",
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.",
keywords = "Faculty of Science, term graphs, infinitary rewriting, simulation, normalising, strong convergence",
author = "Patrick Bahr",
year = "2012",
doi = "10.4230/LIPIcs.RTA.2012.69",
language = "English",
series = "Leibniz International Proceedings in Informatics",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",
pages = "69--84",
editor = "Ashish Tiwari",
booktitle = "23rd International Conference on Rewriting Techniques and Applications (RTA'12)",
note = "23rd International Conference on Rewriting Techniques and Applications, RTA'12 ; Conference date: 28-05-2012 Through 02-06-2012",
}
RIS
TY - GEN
T1 - Infinitary term graph rewriting is simple, sound and complete
AU - Bahr, Patrick
N1 - Conference code: 23
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
KW - Faculty of Science
KW - term graphs
KW - infinitary rewriting
KW - simulation
KW - normalising
KW - strong convergence
U2 - 10.4230/LIPIcs.RTA.2012.69
DO - 10.4230/LIPIcs.RTA.2012.69
M3 - Article in proceedings
T3 - Leibniz International Proceedings in Informatics
SP - 69
EP - 84
BT - 23rd International Conference on Rewriting Techniques and Applications (RTA'12)
A2 - Tiwari, Ashish
PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik
T2 - 23rd International Conference on Rewriting Techniques and Applications
Y2 - 28 May 2012 through 2 June 2012
ER -
