Termination of (Canonical) Context-Sensitive Rewriting
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. A replacement map discriminates, for each symbol of the signature, the argument positions on which replacements are allowed. If the replacement restrictions are less restrictive than those expressed by the so-called canonical replacement map, then CSR can be used for computing (infinite) normal forms of terms. Termination of such canonical CSR is desirable when using CSR for these purposes. Existing transformations for proving termination of CSR fulfill a number of new properties when used for proving termination of canonical CSR.
Keywords(infinitary) normalization term rewriting termination
Unable to display preview. Download preview PDF.
- [AG01]T. Arts and J. Giesl. A collection of examples for termination of term rewriting using dependency pairs. TR AIB-2001-09, RWTH Aachen, 2001.Google Scholar
- [BLR02]C. Borralleras, S. Lucas, and A. Rubio. Recursive Path Orderings can be Context-Sensitive. Proc. of CADE’02, Springer LNAI to appear, 2002.Google Scholar
- [Der95]N. Dershowitz. 33 Examples of Termination. LNCS 909:16–26, Springer-Verlag, Berlin, 1995.Google Scholar
- [FR99]M.C.F. Ferreira and A.L. Ribeiro. Context-Sensitive AC-Rewriting. Proc. of RTA’99, LNCS 1631:286–300, Springer-Verlag, Berlin, 1999.Google Scholar
- [GM99]J. Giesl and A. Middeldorp. Transforming Context-Sensitive Rewrite Systems. Proc. of RTA’99, LNCS 1631:271–285, Springer-Verlag, Berlin, 1999.Google Scholar
- [GM02]J. Giesl and A. Middeldorp. Transformation Techniques for Context-Sensitive Rewrite Systems. Technical Report AIB-2002-02, Aachen, 2002.Google Scholar
- [Luc96]S. Lucas. Termination of context-sensitive rewriting by rewriting. Proc. of ICALP’96, LNCS 1099:122–133, Springer-Verlag, Berlin, 1996.Google Scholar
- [Luc98]S. Lucas. Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming, 1998(1):1–61, January 1998.Google Scholar
- [Luc02]S. Lucas. Context-sensitive rewriting strategies. Information and Computation, to appear.Google Scholar
- [SX98]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.Google Scholar
- [Zan97]H. Zantema. Termination of Context-Sensitive Rewriting. Proc. of RTA’ 97, LNCS 1232:172–186, Springer-Verlag, Berlin, 1997.Google Scholar