On the ubiquity of certain total type structures

Author:

LONGLEY JOHN

Abstract

It is an empirical observation arising from the study of higher type computability that a wide range of approaches to defining a class of (hereditarily) total functionals over$\nat$leads in practice to a relatively small handful of distinct type structures. Among these are the type structure C of Kleene–Kreiselcontinuous functionals, its effective substructure Ceffand the type structure HEO of thehereditarily effective operations. However, the proofs of the relevant equivalences are often non-trivial, and it is not immediately clear why these particular type structures should arise so ubiquitously.In this paper we present some new results that go some way towards explaining this phenomenon. Our results show that a large class ofextensional collapseconstructions always give rise to C, Ceffor HEO (as appropriate). We obtain versions of our results for both the ‘standard’ and ‘modified’ extensional collapse constructions. The proofs make essential use of a technique due to Normann.Many new results, as well as some previously known ones, can be obtained as instances of our theorems, but more importantly, the proofs apply uniformly to a whole family of constructions, and provide strong evidence that the three type structures under consideration are highly canonical mathematical objects.

Publisher

Cambridge University Press (CUP)

Subject

Computer Science Applications,Mathematics (miscellaneous)

Reference68 articles.

1. The Definition of Standard ML

2. Game Semantics

3. Longley J. R. (2007) Notions of computability at higher types II. (In preparation.)

4. Universal Types and What They are Good For

Cited by 9 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Strict computability models over categories and presheaves;Journal of Logic and Computation;2022-11-09

2. THE RECURSION HIERARCHY FOR PCF IS STRICT;LOG METH COMPUT SCI;2018

3. A constructive manifestation of the Kleene–Kreisel continuous functionals;Annals of Pure and Applied Logic;2016-09

4. Computability structures, simulations and realizability;Mathematical Structures in Computer Science;2013-06-05

5. Algorithmic solution of higher type equations;Journal of Logic and Computation;2011-12-19

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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