Intensional polymorphism in type-erasure semantics
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
DSL implementation using staging and monads
Proceedings of the 2nd conference on Domain-specific languages
A modal analysis of staged computation
Journal of the ACM (JACM)
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
An expressive, scalable type theory for certified code
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Meta-programming with names and necessity
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
A Calculus of Lambda Calculus Contexts
Journal of Automated Reasoning
Intensional analysis of quantified types
ACM Transactions on Programming Languages and Systems (TOPLAS)
A foundation for embedded languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Type-Theoretic Approach to Induction with Higher-Order Encodings
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Reasoning about Staged Computation
SAIG '00 Proceedings of the International Workshop on Semantics, Applications, and Implementation of Program Generation
Nominal Logic: A First Order Theory of Names and Binding
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Equivariant Syntax and Semantics
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Mechanized Operational Semantics via (Co)Induction
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Proving ML Type Soundness Within Coq
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Higher Order Unification 30 Years Later
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Combining Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
A Modal Lambda Calculus with Iteration and Case Constructs
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
On the Logical Content of Computational Type Theory: A Solution to Curry's Problem
TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
Rewriting Logic as a Metalogical Framework
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
General Recursion on Second Order Term Algebras
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
A Higher-Order Specification of the pi-Calculus
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Abstract Syntax for Variable Binders: An Overview
CL '00 Proceedings of the First International Conference on Computational Logic
Recursion for Higher-Order Encodings
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Categorical and Kripke Semantics for Constructive S4 Modal Logic
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Higher-Order Intensional Type Analysis
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
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
Nominal logic, a first order theory of names and binding
Information and Computation - TACS 2001
A judgmental reconstruction of modal logic
Mathematical Structures in Computer Science
Recursion over objects of functional type
Mathematical Structures in Computer Science
Reflective metalogical frameworks
ACM Transactions on Computational Logic (TOCL)
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
Staged computation with names and necessity
Journal of Functional Programming
Formalizing Type Operations Using the “Image” Type Constructor
Electronic Notes in Theoretical Computer Science (ENTCS)
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions
Electronic Notes in Theoretical Computer Science (ENTCS)
DSL implementation using staging and monads
DSL'99 Proceedings of the 2nd conference on Conference on Domain-Specific Languages - Volume 2
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Programming with proofs and explicit contexts
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Simple types in type theory: deep and shallow encodings
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
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
Cut-free Gentzen calculus for multimodal CK
Information and Computation
Names, Equations, Relations: Practical Ways to Reason about new
Fundamenta Informaticae
| Hi-index | 0.00 |