Research Paper #535
|Some Normalization Properties of Martin-Loef'S Type Theory, and Applications
|For certain kinds of applications of type theories, the faithfulness for formalization in the theory depends on intentional, or structural properties of objects constructed in the theory. For type theories such as LF, such properties can be established via an analysis of normal forms and types. In type theories such as Nuprl or Martin-Loef's polymorphic type theory, which are much more expressive than LF, the underlying programming language is essentially untyped, and terms proved to be in types do not necessarily have normal forms. Nevertheless, it is possible to show that for Martin-Loef's type theory, and a large class of extensions of it, a sufficient kind of normalization property does in fact hold in certain well-behaved subtheories. Applications of our results include the use of the type theory as a logical framework in the manner of LF, and an extension of the proofs-as-programs paradigm to the synthesis of verified computer hardware. for the latter applications we point out some advantages to be gained by working in a more expressive type theory.
|NO ONLINE COPY