Termination for direct sums of left-linear complete term rewriting systems
Journal of the ACM (JACM)
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
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
Modularity of strong normalization in the algebraic-λ-cube
Journal of Functional Programming
Definitions by rewriting in the Calculus of Constructions
Mathematical Structures in Computer Science
The conflict-free reduction geometry
Theoretical Computer Science
Inductive types in the Calculus of Algebraic Constructions
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Rewriting-Based Access Control Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
Rewriting modulo in deduction modulo
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Inductive types in the Calculus of Algebraic Constructions
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Modular access control via strategic rewriting
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Modularity in term rewriting revisited
Theoretical Computer Science
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems
Fundamenta Informaticae
| Hi-index | 0.89 |