Constructive natural deduction and its ‘ω-set’ interpretation
- 1 July 1991
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 1 (2) , 215-254
- https://doi.org/10.1017/s0960129500001298
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).Keywords
This publication has 23 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Categorical semantics for higher order polymorphic lambda calculusThe Journal of Symbolic Logic, 1987
- Computability in higher types, Pω and the completeness of type assignmentTheoretical Computer Science, 1986
- Completeness of type assignment in continuous lambda modelsTheoretical Computer Science, 1984
- A filter lambda model and the completeness of type assignmentThe Journal of Symbolic Logic, 1983
- Intuitionist type theory and the free toposJournal of Pure and Applied Algebra, 1980
- LCF considered as a programming languageTheoretical Computer Science, 1977
- Notes on intuitionistic second order arithmeticPublished by Springer Nature ,1973
- Constructive validityPublished by Springer Nature ,1970
- The Principal Type-Scheme of an Object in Combinatory LogicTransactions of the American Mathematical Society, 1969