On the Church-Rosser property for the direct sum of term rewriting systems
Journal of the ACM (JACM)
Commutation, transformation, and termination
Proc. of the 8th international conference on Automated deduction
Counterexamples to termination for the direct sum of term rewriting systems
Information Processing Letters
On termination of the direct sum of term-rewriting systems
Information Processing Letters
Modular aspects of properties of term rewriting systems related to normal forms
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
Termination for the direct sum of left-linear term rewriting systems
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
A sufficient condition for the termination of the direct sum of term rewriting systems
Proceedings of the Fourth Annual Symposium on Logic in computer science
Modular term rewriting systems and the termination
Information Processing Letters
Completeness of combinations of constructor systems
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Handbook of theoretical computer science (vol. B)
Handbook of logic in computer science (vol. 2)
Modularity of confluence: a simplified proof
Information Processing Letters
Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Termination of Linear Rewriting Systems (Preliminary Version)
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Modular termination of context-sensitive rewriting
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Modular termination proofs for rewriting using dependency pairs
Journal of Symbolic Computation
Processes, Terms and Cycles
Modularity in term rewriting revisited
Theoretical Computer Science
Jumping and escaping: Modular termination and the abstract path ordering
Theoretical Computer Science
| Hi-index | 0.01 |