Elsevier

Information Processing Letters

Volume 93, Issue 3, 14 February 2005, Pages 117-123
Information Processing Letters

Relaxing monotonicity for innermost termination

https://doi.org/10.1016/j.ipl.2004.10.005Get rights and content

First page preview

First page preview
Click to open first page preview

References (18)

  • T. Arts et al.

    Termination of term rewriting using dependency pairs

    Theoret. Comput. Sci.

    (2000)
  • J. Giesl et al.

    Modular termination proofs for rewriting using dependency pairs

    J. Symbolic Comput.

    (2002)
  • F. Baader et al.

    Term Rewriting and All That

    (1998)
  • C. Borralleras, Ordering-based methods for proving termination automatically, Ph.D. thesis, Dpto. LSI, Universitat...
  • C. Borralleras et al.

    Recursive path orderings can be context-sensitive

  • J. Giesl et al.

    Innermost termination of context-sensitive rewriting

  • J. Giesl et al.

    Transformation techniques for context-sensitive rewrite systems

    J. Funct. Programm.

    (2004)
  • J. Giesl et al.

    Improving dependency pairs

  • B. Gramlich et al.

    Simple termination of context-sensitive rewriting

There are more references available in the full text version of this article.

Cited by (13)

  • Applications and extensions of context-sensitive rewriting

    2021, Journal of Logical and Algebraic Methods in Programming
  • Context-sensitive dependency pairs

    2010, Information and Computation
  • Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting

    2009, Electronic Notes in Theoretical Computer Science
  • Context-sensitive Rewriting

    2020, ACM Computing Surveys
  • Transforming Derivational Complexity of Term Rewriting to Runtime Complexity

    2019, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
View all citing articles on Scopus
1

Supported by the project CORDIAL-2, Ref. AML/B7-311-97/0666/II-0021F1A.

View full text