Typechecking dependent types and subtypes
Lecture notes in computer science on Foundations of logic and functional programming
Programming in Martin-Lo¨f's type theory: an introduction
Programming in Martin-Lo¨f's type theory: an introduction
An algorithm for testing conversion in type theory
Logical frameworks
The essence of functional programming
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of logic in computer science (vol. 2)
Closure under alpha-conversion
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
An algorithm for type-checking dependent types
Science of Computer Programming - Special issue on mathematics of program construction
Cayenne—a language with dependent types
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
The Undecidability of Typability in the Lambda-Pi-Calculus
TLCA '93 Proceedings of the 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
Coercive Subtyping in Type Theory
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Towards a Context Theory for Context-aware systems
Proceedings of the 2007 conference on Advances in Ambient Intelligence
A Theorem Prover with Dependent Types for Reasoning about Actions
Proceedings of the 2008 conference on STAIRS 2008: Proceedings of the Fourth Starting AI Researchers' Symposium
Goal reasoning with context record types
CONTEXT'07 Proceedings of the 6th international and interdisciplinary conference on Modeling and using context
| Hi-index | 0.00 |
In this work we put forward an algorithm for the mechanical verification of an extension of Martin-Löf's theory of types with dependent record types and subtyping. We first give a concise description of that theory and motivate its use for the formalization of algebraic constructions. Then we concentrate on the informal explanation and specification of a proof checker that we have implemented. The logical heart of this proof checker is a type checking algorithm for the forms of judgement of a particular formulation of the extended theory which incorporates a notion of parameter. The algorithm has been proven sound with respect to the latter calculus. We include a discussion on that proof in the present work.