Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Binding Logic: Proofs and Models
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
The Metalanguage lambda-Prolog and Its Implementation
FLOPS '01 Proceedings of the 5th 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
From Higher-Order to First-Order Rewriting
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Tradeoffs in the Intensional Representation of Lambda Terms
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Currying Second-Order Unification Problems
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Explicit substitutions in the reduction of lambda terms
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Journal of Automated Reasoning
HOL-λσ: an intentional first-order expression of higher-order logic
Mathematical Structures in Computer Science
Choices in Representation and Reduction Strategies for Lambda Terms in Intensional Contexts
Journal of Automated Reasoning
A treatment of higher-order features in logic programming
Theory and Practice of Logic Programming
A ρ-calculus of explicit constraint application
Higher-Order and Symbolic Computation
Nominal Techniques in Isabelle/HOL
Journal of Automated Reasoning
Principal Typings for Explicit Substitutions Calculi
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Perpetuality for Full and Safe Composition (in a Constructive Setting)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
A ρ-Calculus of Explicit Constraint Application
Electronic Notes in Theoretical Computer Science (ENTCS)
A finite first-order presentation of set theory
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Intersection type systems and explicit substitutions calculi
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Practical higher-order pattern unification with on-the-fly raising
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Matching modulo superdevelopments application to second-order matching
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
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
The theory of calculi with explicit substitutions revisited
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.00 |