Theoretical Computer Science - Special issue on theories of types and proofs
A Monotonic Higher-Order Semantic Path Ordering
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Descendants and Head Normalization of Higher-Order Rewrite Systems
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Higher Order Unification 30 Years Later
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
On Termination of Higher-Order Rewriting
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Combining Pattern E-Unification Algorithms
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Confluence and Termination of Simply Typed Term Rewriting Systems
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Axiomatic Rewriting Theory VI Residual Theory Revisited
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Uniform Normalisation beyond Orthogonality
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Higher-order unification and matching
Handbook of automated reasoning
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Nominal rewriting with name generation: abstraction vs. locality
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Polymorphic higher-order recursive path orderings
Journal of the ACM (JACM)
Information and Computation
Hierarchical Nominal Terms and Their Theory of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Shallow confluence of conditional term rewriting systems
Journal of Symbolic Computation
Residuals in higher-order rewriting
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Termination of simply typed term rewriting by translation and labelling
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Continuation-passing style and strong normalisation for intuitionistic sequent calculi
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Confluence of pattern-based calculi
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Curry-style types for nominal terms
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Decreasing Diagrams and Relative Termination
Journal of Automated Reasoning
Term rewriting for access control
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
Matching modulo superdevelopments application to second-order matching
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Dependency pairs for simply typed term rewriting
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
A proof of finite family developments for higher-order rewriting using a prefix property
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Higher-order orderings for normal rewriting
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Higher-Order rewriting: framework, confluence and termination
Processes, Terms and Cycles
Code generation via higher-order rewrite systems
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
PNL to HOL: From the logic of nominal sets to the logic of higher-order functions
Theoretical Computer Science
Nominal completion for rewrite systems with binders
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Computability closure: ten years later
Rewriting Computation and Proof
| Hi-index | 0.00 |