Term graph rewriting and parallel term rewriting
2011 (English)In: Proceedings of the 6th International Workshop on Computing with Terms and Graphs: Saarbrücken, Germany, 2nd April / [ed] Rachid Echahed, Open Publishing Association , 2011, 3-18 p.Conference paper (Refereed)
The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing. It is also known that if term graphs are allowed to contain cycles, then one term graph reduction may correspond to infinitely many term reductions. We stress that this fact can be interpreted in two ways. According to the "sequential interpretation", a term graph reduction corresponds to an infinite sequence of term reductions, as formalized by Kennaway et.al. using strongly converging derivations over the complete metric space of infinite terms. Instead according to the "parallel interpretation" a term graph reduction corresponds to the parallel reduction of an infinite set of redexes in a rational term. We formalize the latter notion by exploiting the complete partial order of infinite and possibly partial terms, and we stress that this interpretation allows to explain the result of reducing circular redexes in several approaches to term graph rewriting.
Place, publisher, year, edition, pages
Open Publishing Association , 2011. 3-18 p.
, Electronic Proceedings in Theoretical Computer Science, ISSN 2075-2180 ; 48
Research subject Computer Science
IdentifiersURN: urn:nbn:se:umu:diva-39797DOI: 10.4204/EPTCS.48.3OAI: oai:DiVA.org:umu-39797DiVA: diva2:396254
TERMGRAPH 2011, 6th International Workshop on Computing with Terms and Graphs, Saarbrücken, Germany, 2nd April 2011