Modularity of termination in term graph rewriting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1103, Issue , 1996, Pages 230-244

  Krishna Rao, M R K ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMMON STRUCTURES; GRAPH REDUCTION; GRAPH REWRITING; NORMAL FORM; TERM GRAPH REWRITING; TERM REWRITING;

ARTIFICIAL INTELLIGENCE;

EID: 84957610436     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (17)

1. N. Dershowitz and J.-P. Jouannaud (1990), Rewrite Systems, in J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B, pp. 243-320.
2. N. Dershowitz (1992), Hierarchical termination, draft, Hebrew University, Dec., 1992. Revised version in Proc. CTRS'94, LNCS 968, Springer-Verlag.
3. M. Fernandez and J.P. Jouannaud (1995), Modular termination of term rewriting systems revisited, Proc. COMPASS workshop on ADT, LNCS 906, pp. 255-273.
4. B. Gramlich (1994), Generalized sufficient conditions for modular termination of rewriting, in AAECC 5, pp. 131-158.
5. J.W. Klop (1992), Term Rewriting Systems, in S. Abramsky, D. Gabbay and T. Maibaum (ed.), Handbook of Logic in Computer Science, Vol. 2.
6. M.R.K. Krishna Rao (1994), Simple termination of hierarchical combinations of term rewriting systems, Proc. of TACS'94, LNCS 789, pp. 203-223.
7. M.R.K. Krishna Rao (1995), Semi-completeness of hierarchical and superhierarchical combinations of term rewriting systems, Proc. of TAPSOFT'95, LNCS 915, pp. 379-393.
8. M.R.K. Krishna Rao (1995), Graph reducibility of term rewriting systems, Proc. of MFCS'95, LNCS 969, pp. 371-381.
9. M.R.K. Krishna Rao (1995), Modular proofs for completeness of hierarchical term rewriting systems, Theoretical Computer Science 151, pp. 487-512.
10. M. Kurihara and A. Ohuchi (1995), Modularity in noncopying term rewriting, Theoretical Computer Science 152, pp. 139-169.
11. A. Middeldorp and Y. Toyama (1993), Completeness of combinations of constructor systems, J. Symb. Comp. 15, pp. 331-348.
12. E. Ohlebusch (1994), Modular properties of composable term rewriting systems, Ph.D. Thesis, University of Bielefeld.
13. th workshop on graph grammars and their applications to Computer Science, LNCS 532, pp. 622-636.
14. D. Plump (1992), Collapsed tree rewriting: completeness, confluence and modularity, Proc. CTRS'92, LNCS 656, pp. 97-112.
15. D. Plump (1993), Evaluation of functional expressions by hypergraph rewriting, Ph.D. Thesis, University of Bremen.
16. Y. Toyama (1987), On the Church-Rosser property for the direct sum of term rewriting systems, JACM 34, pp. 128-143.
17. Y. Toyama (1987), Counterexamples to termination for the direct sum of term rewriting systems, Information Processing Letters, IPL 25, pp. 141-143.