Programming in Martin-Lo¨f's type theory: an introduction
Programming in Martin-Lo¨f's type theory: an introduction
Telescopic mappings in typed lambda calculus
Information and Computation
Extensional Constructs in Intensional Type Theory
Extensional Constructs in Intensional Type Theory
About Effective Quotients in Constructive Type Theory
TYPES '98 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
Some points in formal topology
Theoretical Computer Science - Topology in computer science
Journal of Functional Programming
Modular correspondence between dependent type theories and categories including pretopoi and topoi
Mathematical Structures in Computer Science
100 years of Zermelo's axiom of choice: what was the problem with it?
The Computer Journal
Subsets, quotients and partial functions in martin-löf's type theory
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Mathematical Structures in Computer Science
| Hi-index | 0.00 |
We consider an extensionalversion, called qmTT, of the intensionalMinimal Type Theory mTT, introduced in a previous paper with G. Sambin, enriched with proof-irrelevance of propositions and effective quotient sets. Then, by using the construction of total setoid à la Bishop we build a model of qmTT over mTT.The design of an extensional type theory with quotients and its interpretation in mTT is a key technical step in order to build a two level system to serve as a minimal foundation for constructive mathematics as advocated in the mentioned paper about mTT.