Reasoning with higher-order abstract syntax in a logical framework
ACM Transactions on Computational Logic (TOCL)
Primitive recursion for higher-order abstract syntax
Theoretical Computer Science
A Type-Theoretic Approach to Induction with Higher-Order Encodings
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
A Modal Lambda Calculus with Iteration and Case Constructs
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Abstract Syntax for Variable Binders: An Overview
CL '00 Proceedings of the First International Conference on Computational Logic
Two-Level Meta-reasoning in Coq
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Handbook of automated reasoning
A formalised first-order confluence proof for the λ-calculus using one-sorted variable names
Information and Computation - RTA 2001
Recursion over objects of functional type
Mathematical Structures in Computer Science
A definitional approach to primitivexs recursion over higher order abstract syntax
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Verifying CPS transformations in Isabelle/HOL
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
A computational approach to reflective meta-reasoning about languages with bindings
Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Combining higher-order abstract syntax with first-order abstract syntax in ATS
Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Formalizing Type Operations Using the “Image” Type Constructor
Electronic Notes in Theoretical Computer Science (ENTCS)
Practical Reflection for Sequent Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Essential incompleteness of arithmetic verified by coq
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
PNL to HOL: From the logic of nominal sets to the logic of higher-order functions
Theoretical Computer Science
Hi-index | 0.00 |