MU-TERM: A tool for proving termination of context-sensitive rewriting

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

Volumn 3091, Issue , 2004, Pages 200-209

  Lucas, Salvador ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

CONTEXT SENSITIVE REWRITING; FUNCTION SYMBOLS; POLYNOMIAL INTERPRETATIONS; RATIONAL NUMBERS;

ARTIFICIAL INTELLIGENCE;

EID: 35048832942     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25979-4_14     Document Type: Article

References (16)

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. Technical report, AIB-2001-09, RWTH Aachen, Germany, 2001.
3. C. Borralleras, S. Lucas, and A. Rubio. Recursive Path Orderings can be Context-Sensitive. In Proc. of CADE'02, LNAI 2392:314-331, Springer-Verlag, Berlin, 2002.
4. C. Borralleras. Ordering-based methods for proving termination automatically. PhD Thesis, Departament de Llenguatges i Sistemes Informatics, Universitat Politècnica de Catalunya, May 2003.
5. M.C.F. Ferreira and A.L. Ribeiro. Context-Sensitive AC-Rewriting. In Proc. of RTA'99, LNCS 1631:286-300, Springer-Verlag, Berlin, 1999.
6. B. Gramlich and S. Lucas. Modular termination of context-sensitive rewriting. In Proc. of PPDP'02, pages 50-61, ACM Press, New York, 2002.
7. B. Gramlich and S. Lucas. Simple termination of context-sensitive rewriting. In Proc. of RULE'02, pages 29-41, ACM Press, New York, 2002.
8. J. Giesl and A. Middeldorp. Termination of Innermost Context-Sensitive Rewriting. In Proc. DLT'02, LNCS 2450:231-244, Springer-Verlag, Berlin, 2003.
9. J. Giesl and A. Middeldorp. Transformation Techniques for Context-Sensitive Rewrite Systems. Journal of Functional Programming, to appear, 2004.
10. S. Lucas. Termination of context-sensitive rewriting by rewriting. In Proc. of ICALP'96, LNCS 1099:122-133, Springer-Verlag, Berlin, 1996.
11. S. Lucas. Termination of Rewriting With Strategy Annotations. In Proc. of LPAR'01, LNAI 2250:669-684, Springer-Verlag, Berlin, 2001.
12. S. Lucas. Context-sensitive rewriting strategies. Information and Computation, 178(1):293-343, 2002.
13. S. Lucas. Lazy Rewriting and Context-Sensitive Rewriting. Electronic Notes in Theoretical Computer Science, volume 64. Elsevier Sciences, 2002.
14. S. Lucas. Polynomials for proving termination of context-sensitive rewriting. In Proc. of FOSSACS'04, LNCS 2987:318-332, Springer-Verlag, Berlin 2004.
15. J. Steinbach. Generating Polynomial Orderings. Information Processing Letters 49:85-93, 1994.
16. H. Zantema. Termination of Context-Sensitive Rewriting. In Proc. of RTA'97, LNCS 1232:172-186, Springer-Verlag, Berlin, 1997.