Use this URL to cite or link to this record in EThOS:
Title: An extended calculus of constructions
Author: Luo, Zhaohui
Awarding Body: University of Edinburgh
Current Institution: University of Edinburgh
Date of Award: 1990
Availability of Full Text:
Access through EThOS:
Full text unavailable from EThOS. Please try the link below.
Access through Institution:
This thesis presents and studies a unifying theory of dependent types ECC - Extended Calculus of Constructions. ECC integrates Coquand-Huet's (impredicative) calculus of constructions and Martin-Lof's (predicative) type theory with universes, and turns out to be a strong and expressive calculus for formalization of mathematics, structured proof development and program specification. The meta-theory of ECC is studied and we show that the calculus has good meta-theoretic properties. The main proof-theoretic result is the strong normalization theorem, proved by using Girard-Tait's reducibility method based on a quasi normalization theorem which makes explicit the predicativity of the predicative universes. The strong normalization results shows the proof-theoretic consistency of the calculus; in particular, it implies the consistency of the embedded intuitionistic higher-order logic and the decidability of the theory. The meta-theoretic results establish the theoretical foundations both for pragmatic applications in theorem-proving and program specification and for computer implementations of the theory. ECC has been implemented in the proof development system LEGO developed by Pollack. In ECC, dependent Σ-types are non-propositional types residing in the predicative universes and propositions are lifted as higher-level types as well. This solves the known difficulty that adding strong Σ-types to an impredicative system results in logical paradox and enables Σ-types to be used to express the intuitionistic notion of subsets. Σ-types together with type universes hence provide useful abstraction and module mechanisms for abstract description of mathematical theories and basic mechanisms for program specification and adequate formalization of abstract mathematics (e.g., abstract algebras and notions in category theory). A notion of (abstract) mathematical theory can be described and leads to a promising approach to abstract reasoning and structured reasoning. Program specifications can be expressed by Σ-types, using propositions in the embedded logic to describe program properties (for example, by an equality reflection result, computational equality can be modelled by the propositional Leibniz's equality definable in the theory). These developments allow comprehensive structuring of formal or rigorous development of proofs and programs. Also discussed is how the calculus can be understood set-theoretically. We explain an ω-Set (realizability) model of the theory. In particular, propositions can be interpreted as partial equivalence relations and the predicative type universes as corresponding to large set universes.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available