Modes of Convergence for Term Graph Rewriting

Publikation: Konference artikel i Proceeding eller bog/rapport kapitelBidrag til bog/antologiForskningpeer review

Abstrakt

Term graph rewriting provides a simple mechanism to finitely represent restricted forms of infinitary term rewriting. The correspondence between infinitary term rewriting and term graph rewriting has been studied to some extent. However, this endeavour is impaired by the lack of an appropriate counterpart of infinitary rewriting on the side of term graphs. We aim to fill this gap by devising two modes of convergence based on a partial order resp. a metric on term graphs. The thus obtained structures generalise corresponding modes of convergence that are usually studied in infinitary term rewriting. We argue that this yields a common framework in which both term rewriting and term graph rewriting can be studied. In order to substantiate our claim, we compare convergence on term graphs and on terms. In particular, we show that the resulting infinitary calculi of term graph rewriting exhibit the same correspondence as we know it from term rewriting: Convergence via the partial order is a conservative extension of the metric convergence.
OriginalsprogUdefineret/Ukendt
Titel22nd International Conference on Rewriting Techniques and Applications (RTA'11)
RedaktørerManfred Schmidt-Schau
Antal sider16
Vol/bind10
UdgivelsesstedDagstuhl, Germany
ForlagSchloss Dagstuhl--Leibniz-Zentrum für Informatik
Publikationsdato1 maj 2011
Sider139-154
ISBN (Trykt)978-3-939897-30-9
DOI
StatusUdgivet - 1 maj 2011

Emneord

  • term graphs, partial order, metric, infinitary rewriting, graph rewriting

Citationsformater