Infinitary term graph rewriting is simple, sound and complete

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

Dokumenter

  • Patrick Bahr
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.
OriginalsprogEngelsk
Titel23rd International Conference on Rewriting Techniques and Applications (RTA'12)
RedaktørerAshish Tiwari
Antal sider16
ForlagSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Publikationsdato2012
Sider69-84
ISBN (Elektronisk)978-3-939897-38-5
DOI
StatusUdgivet - 2012
Begivenhed23rd International Conference on Rewriting Techniques and Applications - Nagoya, Japan
Varighed: 28 maj 20122 jun. 2012
Konferencens nummer: 23

Konference

Konference23rd International Conference on Rewriting Techniques and Applications
Nummer23
LandJapan
ByNagoya
Periode28/05/201202/06/2012
NavnLeibniz International Proceedings in Informatics
Vol/bind15
ISSN1868-8969

Antal downloads er baseret på statistik fra Google Scholar og www.ku.dk


Ingen data tilgængelig

ID: 38429358