1 Computer Science, IT University of Copenhagen2 Programming Logic and Semantics, Theoretical Computer Science, The Department
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.
Proceedings 7th International Workshop on Computing With Terms and Graphs: Rome, 23th March 2013, 2013, p. 17-28
Main Research Area:
Electronic Proceedings in Theoretical Computer Science
International Workshop on Computing with Terms and Graphs 2013