Modular aspects of term graph rewriting

Theoretical Computer Science

Volumn 208, Issue 1-2, 1998, Pages 59-86

  Krishna Rao, M R K ^a,b,c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^c GRIFFITH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013305398     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0304-3975(98)00079-6     Document Type: Article

References (21)

1. N. Dershowitz, J.-P. Jouannaud, Rewrite systems, in: J. van Leeuwen (Ed.), Handbook of theoretical computer science, vol. B, North-Holland Amsterdam, 1990, pp. 243-320.
2. N. Dershowitz, Hierarchical termination, draft, Hebrew University, Dec. 1992. Revised version in Proc. CTRS'94, Lecture Notes in Computer Science, vol. 968, Springer, Berlin, 1992.
3. M. Fernandez, J.P. Jouannaud, Modular termination of term rewriting systems revisited, Proc. COMPASS workshop on ADT, Lecture Notes in Computer Science, vol. 906, Springer, Berlin, 1995, pp. 255-273.
4. B. Gramlich, Generalized sufficient conditions for modular termination of rewriting, AAECC 5 (1994) 131-158.
5. J.W. Klop, Term rewriting systems, in: S. Abramsky, D. Gabbay, T. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. 2, Oxford University Press, Oxford, 1992.
6. M.R.K. Krishna Rao, Simple termination of hierarchical combinations of term rewriting systems, Proc. TACS'94, Lecture Notes in Computer Science, vol. 789, Springer, Berlin, 1994, pp. 203-223.
7. M.R.K. Krishna Rao, Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems, Proc. TAPSOFT'95, Lecture Notes in Computer Science, vol. 915, Springer, Berlin, 1995, pp. 379-393.
8. M.R.K. Krishna Rao, Graph reducibility of term rewriting systems, Proc. of MFCS'95, Lecture Notes in Computer Science, vol. 969, Springer, Berlin, 1995, pp. 371-381.
9. M.R.K. Krishna Rao, Modular proofs for completeness of hierarchical term rewriting systems, Theoret. Comput. Sci. 151, 1995 487-512.
10. M.R.K. Krishna Rao, Modularity of termination in term graph rewriting, Proc. of RTA'96, Lecture Notes in Computer Science, vol. 1103, Springer, Berlin, 1996, pp. 230-244.
11. M. Kurihara, A. Ohuchi, Modularity of simple termination of term rewriting systems with shared constructors, Theoret. Comput. Sci. 103 (1992) 273-282.
12. M. Kurihara, A. Ohuchi, Modularity in noncopying term rewriting, Theoret. Comput. Sci. 152 (1995) 139-169.
13. A. Middeldorp, Modular properties of term rewriting systems, Ph.D. Thesis, Free University, Amsterdam, 1990.
14. A. Middeldorp, Y. Toyama, Completeness of combinations of constructor systems, J. Symb. Comp. 15 (1993) 331-348.
15. E. Ohlebusch, Modular properties of composable term rewriting systems, Ph.D. Thesis, University of Bielefeld, 1994.
16. D. Plump, Graph-reducible term rewriting systems, Proc. 4th workshop on graph grammars and their applications to Computer Science, Lecture Notes in Computer Science, vol. 532, Springer, Berlin, 1990, pp. 622-636.
17. D. Plump, Collapsed tree rewriting: completeness, confluence and modularity, Proc. CTRS'92, Lecture Notes in Computer Science, vol. 656, Springer, Berlin, 1992, pp. 97-112.
18. D. Plump, Evaluation of functional expressions by hypergraph rewriting, Ph.D. Thesis, University of Bremen, 1993.
19. D. Plump, Critical pairs in term graph rewriting, Proc. MFCS'94, Lecture Notes in Computer Science, vol. 841 Springer, Berlin, 1994.
20. Y. Toyama, On the Church-Rosser property for the direct sum of term rewriting systems, JACM 34 (1987) 128-143.
21. Y. Toyama, Counterexamples to termination for the direct sum of term rewriting systems, Inform. Processing Lett. IPL 25 (1987) 141-143.