Constructive natural deduction and its ‘ω-set’ interpretation

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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3