Modularity of Termination in Term Graph Rewriting

Term rewriting is generally implemented using graph rewriting for efficiency reasons. Graph rewriting allows sharing of common structures thereby saving both time and space. This implementation is sound in the sense that computation of a normal form of a graph yields a normal form of the corresponding term. In this paper, we study modularity of termination of the graph reduction. Unlike in the case of term rewriting, termination is modular in graph rewriting for a large class of systems. Our results generalize the results of Plump [14] and Kurihara and Ohuchi [10].

[1]  M. R. K. Krishna Rao.  Graph Reducibility of Term Rewriting Systems , 1995, MFCS.

[2]  Yoshihito Toyama,et al.  Completeness of Combinations of Constructor Systems , 1991, RTA.

[3]  Azuma Ohuchi,et al.  Modularity in Noncopying Term Rewriting , 1995, Theor. Comput. Sci..

[4]  Enno Ohlebusch,et al.  Modular Properties of Composable Term Rewriting Systems , 1995, J. Symb. Comput..

[5]  Yoshihito Toyama,et al.  On the Church-Rosser property for the direct sum of term rewriting systems , 1984, JACM.

[6]  Yoshihito Toyama,et al.  Counterexamples to Termination for the Direct Sum of Term Rewriting Systems , 1987, Inf. Process. Lett..

[7]  Detlef Plump.  Graph-Reducible Term Rewriting Systems , 1990, Graph-Grammars and Their Application to Computer Science.

[8]  M. R. K. Krishna Rao.  Simple Termination of Hierarchical Combinations of Term Rewriting Systems , 1994, TACS.

[9]  M.R.K. Kr ishna Rao,et al.  Modular Proofs for Completeness of Hierarchical Term Rewriting Systems , 1995, Theor. Comput. Sci..

[10]  Detlef Plump,et al.  Collapsed Tree Rewriting: Completeness, Confluence, and Modularity , 1992, CTRS.

[11]  M. R. K. Krishna Rao.  Semi-Completeness of Hierarchical and Super-Hierarchical Combinations of Term Rewriting Systems , 1995, TAPSOFT.

[12]  Jan Willem Klop,et al.  Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.

[13]  Jean-Pierre Jouannaud,et al.  Modular Termination of Term Rewriting Systems Revisited , 1994, COMPASS/ADT.

[14]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.