1 Department of Computer Science, Faculty of Science, Københavns Universitet2 Department of Computer Science, Faculty of Science, Københavns Universitet
Cyclic term graph rewriting has been shown to be adequate for simulating certain forms of infinitary term rewriting. These forms are, however, quite restrictive and it would be beneficial to lift these restriction at least for a limited class of rewriting systems. In order to better understand the correspondences between infinite reduction sequences over terms and finite reductions over cyclic term graphs, we explore different variants of infinitary term graph rewriting calculi. To this end, we study different modes of convergence for term graph rewriting that generalise the modes of convergence usually considered in infinitary term rewriting. After discussing several different alternatives, we identify a complete semilattice on term graphs and derive from it a complete metric space on term graphs. Equipped with these structures, we can -- analogously to the term rewriting case -- define both a metric and a partial order model of infinitary term graph rewriting. The resulting calculi of infinitary term graph rewriting reveal properties similar to the corresponding infinitary term rewriting calculi.
Electronic Proceedings in Theoretical Computer Science, 2011
The Faculty of Science; term rewriting; term graph rewriting; infinitary rewriting
Main Research Area:
Electronic Proceedings in Theoretical Computer Science
6th International Workshop on Computing with Terms and Graphs, 2011