Some characteristics of strong innermost normalization

Theoretical Computer Science

Volumn 239, Issue 1, 2000, Pages 141-164

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

^a TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013233381     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00215-7     Document Type: Article

References (19)

1. T. Arts, J. Giesl, New criteria for strong and innermost normalisation, Tech. Rep. IBN 96/38, Technische Hochschule Darmstadt, 1996.
2. T. Arts, H. Zantema, Termination of logic programs via labelled term rewrite systems, Tech. Rep. RUU-CS-95-32, Utrecht University, 1995.
3. N. Dershowitz, Hierarchical termination, Proceedings of CTRS'94, Lecture Notes in Computer Science, vol. 968, Springer, Berlin, 1992, pp. 89-105.
4. 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.
5. B. Gramlich, Abstract relations between restricted termination and confluence properties of rewrite systems, Fund. Inform. 24 (1995) 3-23.
6. B. Gramlich, On proving termination by innermost termination, Proc. RTA'96, Lecture Notes in Computer Science, vol. 1103, Springer, Berlin, 1996, pp. 93-107.
7. M. Hanus, The integration of functions into logic programming: a survey, J. Logic Prog. 19/20 (1994) 583-628.
8. J.W. Klop, Term Rewriting Systems, in: S. Abramsky, D. Gabbay, T. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. 2, Oxford Press, Oxford, 1992, pp. 1-116.
9. M.R.K. Krishna Rao, Completeness of hierarchical combinations of term rewriting systems, Proc. FST&TCS'93, Lecture Notes in Computer Science, vol. 761, Springer, Berlin, 1993, pp. 125-138. Revised version appears as Modular proofs for completeness of hierarchical term rewriting systems, Theoret. Comput. Sci. 151 (1995) 487-512.
10. M.R.K. Krishna Rao, Completeness of hierarchical combinations of term rewriting systems, Proc. FST&TCS'93, Lecture Notes in Computer Science, vol. 761, Springer, Berlin, 1993, pp. 125-138. Revised version appears as Modular proofs for completeness of hierarchical term rewriting systems, Theoret. Comput. Sci. 151 (1995) 487-512.
11. M.R.K. Krishna Rao, Simple termination of hierarchical combinations of term rewriting systems, Proceedings of TACS'94, Lecture Notes in Computer Science, vol. 789, Springer, Berlin, 1994, pp. 203-223.
12. 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.
13. M.R.K. Krishna Rao, Some characteristics of strong innermost normalization, Proc. AMAST'96, Lecture Notes in Computer Science, vol. 1101, Springer, Berlin, 1996, pp. 406-420.
14. M.R.K. Krishna Rao, Modular aspects of term graph rewriting, Theoret. Comput. Sci. 208 (1998) 59-86. Special issue on Rewriting Techniques and Applications Conf. RTA'96.
15. M.R.K. Krishna Rao, Modular aspects of term graph rewriting, Theoret. Comput. Sci. 208 (1998) 59-86. Special issue on Rewriting Techniques and Applications Conf. RTA'96.
16. M.R.K. Krishna Rao, D. Kapur, R.K. Shyamasundar, A Transformational methodology for proving termination of logic programs, Proc. Computer Science Logic, CSL'91, Lecture Notes in Computer Science, vol. 626, Springer, Berlin, 1991, pp. 213-226.
17. A. Middeldorp, Y. Toyama, Completeness of combinations of constructor systems, J. Symbolic Comput. 15 (1993) 331-348.
18. E. Ohlebusch, On the modularity of termination of term rewriting systems, Theoret. Comput. Sci. 136 (1994) 333-360.
19. Y. Toyama, Counterexamples to termination for the direct sum of term rewriting systems, Inform. Process. Lett. IPL 25 (1987) 141-143.