This paper outlines the development of the metatheory for Luo's type theory UTT, the type theory implemented in the proof assistant LEao and containing as subsystems Martin-LSf's type theory and the Calculus of Constructions. The approach used is to define a typed operational semantics for the system and to establish the important metatheoretic properties, such as Church-Rosser, strong normalization and subject reduction, for this operational presentation of the theory. These properties are then transferred to the usual presentation by soundness and completeness results. This technique gives a new and simpler development of the metatheory for systems with dependent types and n-equality.
CITATION STYLE
Goguen, H. (1995). The metatheory of UTT. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 996, pp. 61–82). Springer Verlag. https://doi.org/10.1007/3-540-60579-7_4
Mendeley helps you to discover research relevant for your work.