Technical Reports (CIS)

Document Type

Technical Report

Subject Area


Date of this Version

July 1990


University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-90-44.


We give a proof that all terms that type-check in the theory of contructions are strongly normalizing (under ß-reduction). 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 ß-reduction), using the reducibility method.



Date Posted: 23 August 2007