In the paper there are introduced and discussed the concepts of an indexed category with quantifications and a higher level indexed category to present ~tn algebraic characterization of some version of Martin-L6f Type Theory. This characterization.is given by specifying an additional equational stru
Propositions and specifications of programs in Martin-Löf's type theory
✍ Scribed by Bengt Nordström; Jan Smith
- Publisher
- Springer Netherlands
- Year
- 1984
- Tongue
- English
- Weight
- 802 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0006-3835
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We prove that every strictly positive endofimctor on the category of sets generated by Martin-Liif's extensional type theory has an initial algebra. This representation of inductively defined sets uses essentially the wellorderings introduced by Martin-Liif in "Constructive Mathematics and Computer
## Abstract In this note we show that Friedman's syntactic translation for intuitionistic logical systems can be carried over to Martin‐Löf's type theory, inlcuding universes provided some restrictions are made. Using this translation we show that the theory is closed under a higher type version of