Author:
Longo Giuseppe,Moggi Eugenio
Abstract
Various Theories of Types are introduced, by stressing the analogy ‘propositions-as-types’: from propositional to higher order types (and Logic). In accordance with this, proofs are described as terms of various calculi, in particular of polymorphic (second order) λ-calculus. A semantic explanation is then given by interpreting individual types and the collection of all types in two simple categories built out of the natural numbers (the modest sets and the universe of ω-sets). The first part of this paper (syntax) may be viewed as a short tutorial with a constructive understanding of the deduction theorem and some work on the expressive power of first and second order quantification. Also in the second part (semantics, §§6–7) the presentation is meant to be elementary, even though we introduce some new facts on types as quotient sets in order to interpret ‘explicit polymorphism’. (The experienced reader in Type Theory may directly go, at first reading, to §§6–8).
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference70 articles.
1. Taylor P. (1986) Recursive domains, indexed category theory and polymorphism. PhD Thesis, Imperial College, London.
2. Categorical semantics for higher order polymorphic lambda calculus;Seely;JSL,1986
3. Data Types as Lattices
4. Rosolini G. (1986) About modest sets. Notes for a talk delivered in Pisa.
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A survey of constructive presheaf models of univalence;ACM SIGLOG News;2018-07-26
2. A General Framework for Relational Parametricity;Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science;2018-07-09
3. Bifibrational Functorial Semantics of Parametric Polymorphism;Electronic Notes in Theoretical Computer Science;2015-12
4. Computability structures, simulations and realizability;Mathematical Structures in Computer Science;2013-06-05
5. Internal models of system F for decompilation;Theoretical Computer Science;2012-06