Programming in Martin-Lo¨f's type theory: an introduction
Programming in Martin-Lo¨f's type theory: an introduction
Semantics of type theory: correctness, completeness, and independence results
Semantics of type theory: correctness, completeness, and independence results
A framework for defining logics
Journal of the ACM (JACM)
Higher-Order Abstract Syntax in Coq
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Some Algorithmic and Proof-Theoretical Aspects of Coercive Subtyping
TYPES '96 Selected papers from the International Workshop on Types for Proofs and Programs
On the Interpretation of Type Theory in Locally Cartesian Closed Categories
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A New Approach to Abstract Syntax Involving Binders
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Semantical Analysis of Higher-Order Abstract Syntax
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Typed operational semantics for higher-order subtyping
Information and Computation
A syntactic approach to eta equality in type theory
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
This paper demonstrates the admissibility of the basic structural rules of dependent type theory, such as weakening, substitution and splitting lemmas, through a Kripke-style term model.