Counterexamples to termination for the direct sum of term rewriting systems
Information Processing Letters
Termination of rewriting systems by polynomial interpretations and its implementation
Science of Computer Programming
Term rewriting and all that
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Some characteristics of strong innermost normalization
Theoretical Computer Science
The size-change principle for program termination
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computing in Systems Described by Equations
Computing in Systems Described by Equations
Argument Filtering Transformation
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Termination of Context-Sensitive Rewriting by Rewriting
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
On Proving Termination by Innermost Termination
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Complete Monotonic Semantic Path Orderings
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Relaxing monotonicity for innermost termination
Information Processing Letters
Size-change termination for term rewriting
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Termination of rewriting under strategies
ACM Transactions on Computational Logic (TOCL)
Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Recursive path orderings can also be incremental
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Narrowing, abstraction and constraints for proving properties of reduction relations
Rewriting Computation and Proof
| Hi-index | 0.00 |
This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This property may lead to several innermost-specific orderings. Here, an IP-monotonic version of the Recursive Path Ordering is presented. This variant can be used (directly or as ingredient of the Dependency Pairs method) for proving innermost termination of non-terminating term rewrite systems.