Author:
Geuvers Herman,Nederhof Mark-Jan
Abstract
AbstractWe present a modular proof of strong normalization for the Calculus of Constructions of Coquand and Huet (1985, 1988). This result was first proved by Coquand (1986), but our proof is more perspicious. The method consists of a little juggling with some systems in the cube of Barendregt (1989), which provides a fine structure of the calculus of constructions. It is proved that the strong normalization of the calculus of constructions is equivalent with the strong normalization of Fω.In order to give the proof, we first establish some properties of various type systems. Therefore, we present a general framework of typed lambda calculi, including many well-known ones.
Publisher
Cambridge University Press (CUP)
Cited by
62 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Interacting Safely with an Unsafe Environment;Electronic Proceedings in Theoretical Computer Science;2021-07-16
2. Verifiable Certificates for Predicate Subtyping;Programming Languages and Systems;2019
3. Self-Representation in Girard's System U;ACM SIGPLAN Notices;2015-05-11
4. Self-Representation in Girard's System U;Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages;2015-01-14
5. A partial translation from λU to λ2;Journal of Logic and Computation;2014-05-28