A Proof of Strong Normalization for the Theor y of Constructions Using a Kripke-like Interpretation

We give a proof that all terms that type-check in the theory of contructions are strongly normalizing (under sreduction). The main novelty of this proof is that it uses a "Kripke-like" interpretation of the types and kinds, and that it does not use infinite contexts. We explore some consequences of strong normalization, consistency and decidability of typechecking. We also show that our proof yields another proof of strong normalization for LF (under s-reduction), using the reducibility method. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-90-44. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/568 A Proof Of Strong Normalization For The Theory Of Constructions Using A Kripe-Like Interpretation MS-CIS-90-44 LOGIC & COMPUTATION 21 Thierry Coquand Jean Gallier Department of Computer and Information Science School of Engineering and Applied Science University of Pennsylvania Philadelphia, PA 19104