Two-level type theory and applications - ERRATUM

IF 0.4 4区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS Mathematical Structures in Computer Science Pub Date : 2023-07-10 DOI:10.1017/s096012952300021x
D. Annenkov, Paolo Capriotti, Nicolai Kraus, Christian Sattler
{"title":"Two-level type theory and applications - ERRATUM","authors":"D. Annenkov, Paolo Capriotti, Nicolai Kraus, Christian Sattler","doi":"10.1017/s096012952300021x","DOIUrl":null,"url":null,"abstract":"\n We define and develop two-level type theory (2LTT), a version of Martin-Löf type theory which combines two different type theories. We refer to them as the ‘inner’ and the ‘outer’ type theory. In our case of interest, the inner theory is homotopy type theory (HoTT) which may include univalent universes and higher inductive types. The outer theory is a traditional form of type theory validating uniqueness of identity proofs (UIP). One point of view on it is as internalised meta-theory of the inner type theory. There are two motivations for 2LTT. Firstly, there are certain results about HoTT which are of meta-theoretic nature, such as the statement that semisimplicial types up to level n can be constructed in HoTT for any externally fixed natural number n. Such results cannot be expressed in HoTT itself, but they can be formalised and proved in 2LTT, where n will be a variable in the outer theory. This point of view is inspired by observations about conservativity of presheaf models. Secondly, 2LTT is a framework which is suitable for formulating additional axioms that one might want to add to HoTT. This idea is heavily inspired by Voevodsky’s Homotopy Type System (HTS), which constitutes one specific instance of a 2LTT. HTS has an axiom ensuring that the type of natural numbers behaves like the external natural numbers, which allows the construction of a universe of semisimplicial types. In 2LTT, this axiom can be assumed by postulating that the inner and outer natural numbers types are isomorphic. After defining 2LTT, we set up a collection of tools with the goal of making 2LTT a convenient language for future developments. As a first such application, we develop the theory of Reedy fibrant diagrams in the style of Shulman. Continuing this line of thought, we suggest a definition of \n \n \n \n$(\\infty,1)$\n\n \n -category and give some examples.","PeriodicalId":49855,"journal":{"name":"Mathematical Structures in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2023-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Structures in Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1017/s096012952300021x","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

We define and develop two-level type theory (2LTT), a version of Martin-Löf type theory which combines two different type theories. We refer to them as the ‘inner’ and the ‘outer’ type theory. In our case of interest, the inner theory is homotopy type theory (HoTT) which may include univalent universes and higher inductive types. The outer theory is a traditional form of type theory validating uniqueness of identity proofs (UIP). One point of view on it is as internalised meta-theory of the inner type theory. There are two motivations for 2LTT. Firstly, there are certain results about HoTT which are of meta-theoretic nature, such as the statement that semisimplicial types up to level n can be constructed in HoTT for any externally fixed natural number n. Such results cannot be expressed in HoTT itself, but they can be formalised and proved in 2LTT, where n will be a variable in the outer theory. This point of view is inspired by observations about conservativity of presheaf models. Secondly, 2LTT is a framework which is suitable for formulating additional axioms that one might want to add to HoTT. This idea is heavily inspired by Voevodsky’s Homotopy Type System (HTS), which constitutes one specific instance of a 2LTT. HTS has an axiom ensuring that the type of natural numbers behaves like the external natural numbers, which allows the construction of a universe of semisimplicial types. In 2LTT, this axiom can be assumed by postulating that the inner and outer natural numbers types are isomorphic. After defining 2LTT, we set up a collection of tools with the goal of making 2LTT a convenient language for future developments. As a first such application, we develop the theory of Reedy fibrant diagrams in the style of Shulman. Continuing this line of thought, we suggest a definition of $(\infty,1)$ -category and give some examples.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
两级类型理论及其应用。勘误
我们定义并发展了两级类型理论(2LTT),这是Martin-Löf类型理论的一个版本,它结合了两种不同的类型理论。我们把它们称为“内”型理论和“外”型理论。在我们感兴趣的情况下,内部理论是同伦类型理论(HoTT),它可以包括一元宇宙和更高的归纳类型。外部理论是验证身份证明唯一性的类型论的传统形式。一种观点认为它是内在类型理论的内化元理论。2LTT有两个动机。首先,关于HoTT有一些元理论性质的结果,例如对于任何外部固定的自然数n,可以在HoTT中构造到n级的半简单类型。这些结果不能在HoTT本身中表示,但它们可以在2LTT中形式化并证明,其中n将是外部理论中的一个变量。这种观点的灵感来自于对预层模型保守性的观察。其次,2LTT是一个框架,它适合于表述人们可能想要添加到HoTT的附加公理。这个想法很大程度上受到了Voevodsky的同伦类型系统(HTS)的启发,它构成了2LTT的一个特定实例。HTS有一个公理,确保自然数的类型表现得像外部自然数,这允许构造一个半简单类型的宇宙。在2LTT中,这个公理可以通过假设内外自然数类型同构来实现。在定义了2LTT之后,我们设置了一组工具,目标是使2LTT成为未来开发的方便语言。作为第一个这样的应用,我们发展了舒尔曼风格的芦苇图理论。继续这条思路,我们提出$(\infty,1)$ -类别的定义,并给出一些例子。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science 工程技术-计算机:理论方法
CiteScore
1.50
自引率
0.00%
发文量
30
审稿时长
12 months
期刊介绍: Mathematical Structures in Computer Science is a journal of theoretical computer science which focuses on the application of ideas from the structural side of mathematics and mathematical logic to computer science. The journal aims to bridge the gap between theoretical contributions and software design, publishing original papers of a high standard and broad surveys with original perspectives in all areas of computing, provided that ideas or results from logic, algebra, geometry, category theory or other areas of logic and mathematics form a basis for the work. The journal welcomes applications to computing based on the use of specific mathematical structures (e.g. topological and order-theoretic structures) as well as on proof-theoretic notions or results.
期刊最新文献
On Hofmann–Streicher universes T0-spaces and the lower topology GADTs are not (Even partial) functors A linear linear lambda-calculus Countability constraints in order-theoretic approaches to computability
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1