Proving Strong Normalization of CC by Modifying Realizability Semantics
نویسنده
چکیده
منابع مشابه
Proving Properties of Typed Lambda-Terms Using Realizability, Covers, and Sheaves (Preliminary Version)
We present a general method for proving properties of typed λ-terms. This method is obtained by introducing a semantic notion of realizability which uses the notion of a cover algebra (as in abstract sheaf theory). For this, we introduce a new class of semantic structures equipped with preorders, called pre-applicative structures. These structures need not be extensional. In this framework, a g...
متن کاملRealizability, Covers, and Sheaves II. Applications to the Second-Order Lambda-Calculus
We present a general method for proving properties of typed λ-terms. This method is obtained by introducing a semantic notion of realizability which uses the notion of a cover algebra (as in abstract sheaf theory, a cover algebra being a Grothendieck topology in the case of a preorder). For this, we introduce a new class of semantic structures equipped with preorders, called pre-applicative str...
متن کاملProving Properties of Typed λ-Terms Using Realizability, Covers, and Sheaves
The main purpose of this paper is to take apart the reducibility method in order to understand how its pieces fit together, and in particular, to recast the conditions on candidates of reducibility as sheaf conditions. There has been a feeling among experts on this subject that it should be possible to present the reducibility method using more semantic means, and that a deeper understanding wo...
متن کاملSemantics of Intensional Type Theory extended with Decidable Equational Theories
Incorporating extensional equality into a dependent intensional type system such as the Calculus of Constructions (CC) provides with stronger type-checking capabilities and makes the proof development closer to intuition. Since strong forms of extensionality generally leads to undecidable type-checking, it seems a reasonable trade-off to extend intensional equality with a decidable first-order ...
متن کاملModified Realizability Toposes and Strong Normalization Proofs
This paper is motivated by the discovery that an appropriate quotient SN 3 of the strongly normalising untyped 3-terms (where 3 is just a formal constant) forms a partial applicative structure with the inherent application operation. The quotient structure satises all but one of the axioms of a partial combinatory algebra (pca). We call such partial applicative structures conditionally partial ...
متن کامل