@InProceedings{graphsimple,
  Title = {Infinitary Term Graph Rewriting is Simple, Sound and Complete},
  Author = {Patrick Bahr},
  Booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12) },
  Year = {2012},
  Address = {Dagstuhl, Germany},
  Editor = {Ashish Tiwari},
  Month = may,
  Date = {2012-05-29},
  Pages = {69-84},
  Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
  Volume = {15},
  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.},
  Annote = {Keywords: term graphs, infinitary rewriting},
  Doi = {10.4230/LIPIcs.RTA.2012.69},
  ISBN = {978-3-939897-38-5},
  ISSN = {1868-8969},
  Url = {http://drops.dagstuhl.de/opus/volltexte/2012/3485},
  Urn = {urn:nbn:de:0030-drops-34857}
}