Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Information and Computation - Semantics of Data Types
Programming in Martin-Lo¨f's type theory: an introduction
Programming in Martin-Lo¨f's type theory: an introduction
A framework for defining logics
Journal of the ACM (JACM)
Computation and reasoning: a type theory for computer science
Computation and reasoning: a type theory for computer science
The ALF proof editor and its proof engine
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
Using encryption for authentication in large networks of computers
Communications of the ACM
An Implementation of LF with Coercive Subtyping & Universes
Journal of Automated Reasoning
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Collection Principles in Dependent Type Theory
TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
Proving Security Protocols Correct
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
PAL+: a lambda-free logical framework
Journal of Functional Programming
Weyl's predicative classical mathematics as a logic-enriched type theory
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Weyl's predicative classical mathematics as a logic-enriched type theory
ACM Transactions on Computational Logic (TOCL)
Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification
In the search of a naive type theory
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
Weyl's predicative classical mathematics as a logic-enriched type theory
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
| Hi-index | 0.00 |
A type-theoretic framework for formal reasoning with different logical foundations is introduced and studied. With logic-enriched type theories formulated in a logical framework, it allows various logical systems such as classical logic as well as intuitionistic logic to be used effectively alongside inductive data types and type universes. This provides an adequate basis for wider applications of type theory based theorem proving technology. Two notions of set are introduced in the framework and used in two case studies of classical reasoning: a predicative one in the formalisation of Weyl's predicative mathematics and an impredicative one in the verification of security protocols.