Some Lambda Calculus and Type Theory Formalized
Journal of Automated Reasoning
Mechanized Operational Semantics via (Co)Induction
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Monadic Presentations of Lambda Terms Using Generalized Inductive Types
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Normalization for the Simply-Typed Lambda-Calculus in Twelf
Electronic Notes in Theoretical Computer Science (ENTCS)
Parametric higher-order abstract syntax for mechanized semantics
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Implementing a normalizer using sized heterogeneous types
Journal of Functional Programming
Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
A PVS Theory for Term Rewriting Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A Formalization of the Knuth---Bendix(---Huet) Critical Pair Theorem
Journal of Automated Reasoning
Programming inductive proofs: a new approach based on contextual types
Verification, induction termination analysis
Programming inductive proofs: a new approach based on contextual types
Verification, induction termination analysis
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Extracting a normalization algorithm in Isabelle/HOL
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
Nominal techniques in Isabelle/HOL
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Names for free: polymorphic views of names and binders
Proceedings of the 2013 ACM SIGPLAN symposium on Haskell
Hi-index | 0.00 |