Semantic analysis of normalisation by evaluation for typed lambda calculus
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Formalising Formulas-as-Types-as-Objects
TYPES '99 Selected papers from the International Workshop on Types for Proofs and Programs
Reduction-free normalisation for a polymorphic system
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Normalization and the Yoneda embedding
Mathematical Structures in Computer Science
Intuitionistic model constructions and normalization proofs
Mathematical Structures in Computer Science
Verifying a Semantic βη-Conversion Test for Martin-Löf Type Theory
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
On constructive cut admissibility in deduction modulo
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Simple types in type theory: deep and shallow encodings
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Polarized classical non-associative Lambek calculus and formal semantics
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Extracting a normalization algorithm in Isabelle/HOL
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
| Hi-index | 0.00 |