Term rewriting and all that
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Simple termination of context-sensitive rewriting
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
Modular termination proofs for rewriting using dependency pairs
Journal of Symbolic Computation
Argument Filtering Transformation
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Termination of Context-Sensitive Rewriting
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Recursive Path Orderings Can Be Context-Sensitive
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Transformation techniques for context-sensitive rewrite systems
Journal of Functional Programming
Innermost termination of context-sensitive rewriting
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Size-change termination for term rewriting
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Proving Termination by Bounded Increase
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Proving termination in the context-sensitive dependency pair framework
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Recursive path orderings can also be incremental
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Orderings for innermost termination
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Hi-index | 0.89 |