Relaxing monotonicity for innermost termination
References (18)
- et al.
Termination of term rewriting using dependency pairs
Theoret. Comput. Sci.
(2000) - et al.
Modular termination proofs for rewriting using dependency pairs
J. Symbolic Comput.
(2002) - et al.
Term Rewriting and All That
(1998) - C. Borralleras, Ordering-based methods for proving termination automatically, Ph.D. thesis, Dpto. LSI, Universitat...
- et al.
Recursive path orderings can be context-sensitive
- et al.
Innermost termination of context-sensitive rewriting
- et al.
Transformation techniques for context-sensitive rewrite systems
J. Funct. Programm.
(2004) - et al.
Improving dependency pairs
- 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 ProgrammingContext-sensitive dependency pairs
2010, Information and ComputationUsing Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting
2009, Electronic Notes in Theoretical Computer ScienceProving termination of context-sensitive rewriting by transformation
2006, Information and ComputationContext-sensitive Rewriting
2020, ACM Computing SurveysTransforming 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)
- 1
Supported by the project CORDIAL-2, Ref. AML/B7-311-97/0666/II-0021F1A.
Copyright © 2004 Elsevier B.V. All rights reserved.