Convergence in Infinitary Term Graph Rewriting Systems is Simple (Extended Abstract)

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

Abstrakt

In this extended abstract, we present a simple approach to convergence on term graphs that allows us to unify term graph rewriting and infinitary term rewriting. This approach is based on a partial order and a metric on term graphs. These structures arise as straightforward generalisations of the corresponding structures used in infinitary term rewriting. We compare our simple approach to a more complicated approach that we developed earlier and show that this new approach is superior in many ways. The only unfavourable property that we were able to identify, viz. failure of full correspondence between weak metric and partial order convergence, is rectified by adopting a strong convergence discipline.
OriginalsprogUdefineret/Ukendt
TitelProceedings 7th International Workshop on Computing with Terms and Graphs
RedaktørerRachid Echahed, Detlef Plump
Antal sider12
Vol/bind110
Publikationsdato1 mar. 2013
Sider17-28
DOI
StatusUdgivet - 1 mar. 2013

Citationsformater