Termination of (Canonical) context-sensitive rewriting

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

Volumn 2378, Issue , 2002, Pages 296-310

  Lucas, Salvador ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

(infinitary) normalization; Term rewriting; Termination

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CONTEXT SENSITIVE REWRITING; INFINITARY; NORMAL FORM; TERM REWRITING; TERMINATION;

ARTIFICIAL INTELLIGENCE;

EID: 35248819048     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45610-4_21     Document Type: Conference Paper

References (14)

1. T. Arts and J. Giesl. Termination of Term Rewriting Using Dependency Pairs Theoretical Computer Science, 236:133-178, 2000.
2. T. Arts and J. Giesl. A collection of examples for termination of term rewriting using dependency pairs. TR AIB-2001-09, RWTH Aachen, 2001.
3. C. Borralleras, S. Lucas, and A. Rubio. Recursive Path Orderings can be Context-Sensitive. Proc. of CADE’02, Springer LNAI to appear, 2002.
4. N. Dershowitz. Termination of rewriting. JSC, 3:69-115, 1987.
5. N. Dershowitz. 33 Examples of Termination. LNCS 909:16-26, Springer- Verlag, Berlin, 1995.
6. N. Dershowitz, S. Kaplan, and D. Plaisted. Rewrite, rewrite, rewrite, rewrite, rewrite. Theoretical Computer Science 83:71-96, 1991.
7. M.C.F. Ferreira and A.L. Ribeiro. Context-Sensitive AC-Rewriting. Proc. of RTA’99, LNCS 1631:286-300, Springer-Verlag, Berlin, 1999.
8. J. Giesl and A. Middeldorp. Transforming Context-Sensitive Rewrite Systems. Proc. of RTA’99, LNCS 1631:271-285, Springer-Verlag, Berlin, 1999.
9. J. Giesl and A. Middeldorp. Transformation Techniques for Context- Sensitive Rewrite Systems. Technical Report AIB-2002-02, Aachen, 2002.
10. S. Lucas. Termination of context-sensitive rewriting by rewriting. Proc. of ICALP’96, LNCS 1099:122-133, Springer-Verlag, Berlin, 1996.
11. S. Lucas. Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming, 1998(1):1-61, January 1998.
12. S. Lucas. Context-sensitive rewriting strategies. Information and Computation, to appear.
13. J. Steinbach and H. Xi. Freezing – Termination Proofs for Classical, Context- Sensitive and Innermost Rewriting. Institut für Informatik, T.U. München, January 1998.
14. H. Zantema. Termination of Context-Sensitive Rewriting. Proc. of RTA’97, LNCS 1232:172-186, Springer-Verlag, Berlin, 1997.