On the syntax of Martin-Löf's type theories
- 1 January 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 51 (1-2) , 1-26
- https://doi.org/10.1016/0304-3975(87)90047-8
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Strong normalization for typed terms with surjective pairing.Notre Dame Journal of Formal Logic, 1986
- Semantics for classical AUTOMATH and related systemsInformation and Control, 1983
- Definability of finite sum types in Martin-Löf's type theoriesIndagationes Mathematicae, 1983