Relaxing monotonicity for innermost termination

Information Processing Letters

Volumn 93, Issue 3, 2005, Pages 117-123

  Fernández, Mirtha Lina ^a  

^a UNIVERSIDAD DE ORIENTE   (Cuba)

Author keywords

Innermost termination; Program correctness; Term rewriting

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; DATA PROCESSING; MATHEMATICAL TRANSFORMATIONS; SEMANTICS; SET THEORY; THEOREM PROVING;

INNERMOST TERMINATION; PROGRAM CORRECTNESS; TEAM REWRITE SYSTEM (TRS); TEAM REWRITING;

CONTEXT SENSITIVE LANGUAGES;

EID: 10444249658     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.10.005     Document Type: Article

References (18)

1. T. Arts, J. Giesl, Termination of term rewriting using dependency pairs, Theoret. Comput. Sci. 236 (1-2) (2000) 133-178.
2. F. Baader, T. Nipkow, Term Rewriting and All That, Cambridge University Press, 1998.
3. C. Borralleras, Ordering-based methods for proving termination automatically, Ph.D. thesis, Dpto. LSI, Universitat Politècnica de Catalunya, España, 2003.
4. C. Borralleras, S. Lucas, A. Rubio, Recursive path orderings can be context-sensitive, in: Proc. 18th Internat. Conf. on Automated Deduction, in: Lecture Notes in Artificial Intelligence, vol. 2392, 2002, pp. 314-331.
5. J. Giesl, T. Arts, E. Ohlebusch, Modular termination proofs for rewriting using dependency pairs, J. Symbolic Comput. 34 (2002) 21-58.
6. J. Giesl, A. Middeldorp, Innermost termination of context-sensitive rewriting, in: Proc. 6th Internat. Conf. on Developments in Language Theory, in: Lecture Notes in Comput. Sci., vol. 2450, 2003, pp. 231-244.
7. J. Giesl, A. Middeldorp, Transformation techniques for context-sensitive rewrite systems, J. Funct. Programm. 14 (4) (2004) 379-427.
8. J. Giesl, R. Thiemann, P. Schneider-Kamp, S. Falke, Improving dependency pairs, in: Proc. 10th Internat. Conf. on Logic for Programming, Artificial Intelligence and Reasoning, in: Lecture Notes in Artificial Intelligence, vol. 2850, Springer, Berlin, 2003, pp. 165-179.
9. B. Gramlich, S. Lucas, Simple termination of context-sensitive rewriting, in: Proc. 3rd ACM Sigplan Workshop on Rule-based Programming, 2002, pp. 29-41.
10. T. Kolbe, Challenge problems for automated termination proofs of term rewriting systems, Technical Report IBN 96/42, TU Darmstadt, Germany, 1996.
11. K. Kusakari, M. Nakamura, Y. Toyama, Argument filtering transformation, in: Proc. Internat. Conf. on Principles and Practice of Declarative Programming, in: Lecture Notes in Comput. Sci., vol. 1702, Springer, Berlin, 1999, pp. 47-61.
12. S. Lucas, Context-sensitive computations in functional and functional logic programs, J. Funct. Logic Programm, 1 (1998) 1-61.
13. S. Lucas, Termination of rewriting with strategy annotations, in: Proc. 8th Internat. Conf. on Logic for Programming, Artificial Intelligence and Reasoning, in: Lecture Notes in Artificial Intelligence, vol. 2250, Springer, Berlin, 2001, pp. 669-684.
14. S. Lucas, Polynomials for proving termination of context-sensitive rewriting, in: Proc. 7th Internat. Conf. on Foundations of Software Science and Computation Structures, in: Lecture Notes in Comput. Sci., vol. 2987, Springer, Berlin, 2004, pp. 318-332.
15. S. Lucas, Polynomials over the reals in proofs of termination, in: Proc. 7th Internat. Workshop on Termination, Technical Report AIB-2004-07, RWTH Aachen, 2004, pp. 39-42.
16. J. Steinbach, H. Xi, Freezing - termination proofs for classical, context-sensitive and innermost rewriting, Technical report, Institut für Informatik, TU. München, Germany, 1998.
17. R. Thiemann, J. Giesl, Size-change termination for term rewriting, in: Proc. 14th Internat. Conf. on Rewriting Techniques and Applications, in: Lecture Notes in Comput. Sci., vol. 2706, Springer, Berlin, 2003, pp. 264-278.
18. H. Zantema, Termination of context-sensitive rewriting, in: Proc. 8th Internat. Conf. on Rewriting Techniques and Applications, in: Lecture Notes in Comput. Sci., vol. 1232, Springer, Berlin, 1997, pp. 172-186.