Polynomials 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 2987, Issue , 2004, Pages 318-332

  Lucas, Salvador ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; POLYNOMIALS; SEMANTICS;

CONTEXT SENSITIVE REWRITING; DEPENDENCY PAIRS; FUNCTION SYMBOLS; MONOTONICITY; POLYNOMIAL INTERPRETATIONS; REWRITING; TERMINATION; TERMINATION PROOF;

CONTEXT SENSITIVE LANGUAGES;

EID: 21144439397     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24727-2_23     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. F. Baader and T. Nipkow. Term Rewriting and All That. CUP, 1998.
3. A. ben Cherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9(2):137-160, 1987.
4. E. Contejean and G. Marché. CiME: Completion Modulo E. In Proc. of RTA '96, LNCS 1103:416-419, Springer-Verlag, Berlin, 1996.
5. N. Dershowitz. Orderings for term rewriting systems. Theoretical Computer Science, 17(3): 279-301, 1982.
6. J. Giesl. Generating Polynomial Orderings for Termination Proofs. In Proc. of RTA'95, LNCS 914:426-431, Springer-Verlag, Berlin, 1995.
7. J. Giesl, T. Arts, and E. Ohlebusch Modular Termination Proofs for Rewriting Using Dependency Pairs. Journal of Symbolic Computation 38:21-58, 2002.
8. B. Gramlich and S. Lucas. Simple termination of context-sensitive rewriting. In Proc. of RULE'02, pages 29-41, ACM Press, New York, 2002.
9. J. Giesl and A. Middeldorp. Transformation Techniques for Context-Sensitive Rewrite Systems. Journal of Functional Programming, to appear, 2004.
10. D. Hofbauer. Termination Proofs by Context-Dependent Interpretations. In Proc. of RTA'01, LNCS 2051:108-121. Springer-Verlag, Berlin, 2001.
11. D.S. Lankford. On proving term rewriting systems are noetherian. Technical Report, Louisiana Technological University, Ruston, LA, 1979.
12. S. Lucas. Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming, 1998(1):1-61, January 1998.
13. S. Lucas. Termination of programs with strategy annotations. Technical Report DSIC 11/20/03, Universidad Politécnica de Valencia, Sep. 2003.
14. J. Steinbach. Generating Polynomial Orderings. Information Processing Letters 49:85-93, 1994.
15. H. Zantema. Termination of Context-Sensitive Rewriting. In Proc. of RTA '97, LNCS 1232:172-186, Springer-Verlag, Berlin, 1997.
16. II. Zantema. Termination. In TeReSe, editor, Term Rewriting Systems, chapter 6. Cambridge University Press, 2003.