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

Research output: Conference Article in Proceeding or Book/Report chapterBook chapterResearchpeer-review

Abstract

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.
Original languageUndefined/Unknown
Title of host publicationProceedings 7th International Workshop on Computing with Terms and Graphs
EditorsRachid Echahed, Detlef Plump
Number of pages12
Volume110
Publication date1 Mar 2013
Pages17-28
DOIs
Publication statusPublished - 1 Mar 2013

Cite this