Infinitary term graph rewriting is simple, sound and complete
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Dokumenter
- Bahr_2012_Infinitary_term_graph
Forlagets udgivne version, 453 KB, PDF-dokument
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.
Originalsprog | Engelsk |
---|---|
Titel | 23rd International Conference on Rewriting Techniques and Applications (RTA'12) |
Redaktører | Ashish Tiwari |
Antal sider | 16 |
Forlag | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
Publikationsdato | 2012 |
Sider | 69-84 |
ISBN (Elektronisk) | 978-3-939897-38-5 |
DOI | |
Status | Udgivet - 2012 |
Begivenhed | 23rd International Conference on Rewriting Techniques and Applications - Nagoya, Japan Varighed: 28 maj 2012 → 2 jun. 2012 Konferencens nummer: 23 |
Konference
Konference | 23rd International Conference on Rewriting Techniques and Applications |
---|---|
Nummer | 23 |
Land | Japan |
By | Nagoya |
Periode | 28/05/2012 → 02/06/2012 |
Navn | Leibniz International Proceedings in Informatics |
---|---|
Vol/bind | 15 |
ISSN | 1868-8969 |
- Det Natur- og Biovidenskabelige Fakultet
Forskningsområder
Antal downloads er baseret på statistik fra Google Scholar og www.ku.dk
Ingen data tilgængelig
ID: 38429358