Modularity of simple termination of term rewriting systems with shared constructors
Theoretical Computer Science
On the modularity of termination of term rewriting systems
Theoretical Computer Science
Modular proofs for completeness of hierarchical term rewriting systems
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Term rewriting and all that
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
The size-change principle for program termination
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Hierarchical termination revisited
Information Processing Letters
Argument Filtering Transformation
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Size-change termination for term rewriting
RTA'03 Proceedings of the 14th international conference on Rewriting techniques 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
Hi-index | 0.89 |