Semantics of higher inductive types

被引:24
|
作者
Lumsdaine, Peter Lefanu [1 ]
Shulman, Mike [2 ]
机构
[1] Stockholm Univ, Dept Math, SE-10691 Stockholm, Sweden
[2] Univ San Diego, Dept Math, 5998 Alcala Pk, San Diego, CA 92110 USA
关键词
18C50; 03B15; 18G55; UNIVALENCE;
D O I
10.1017/S030500411900015X
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Higher inductive typesare a class of type-forming rules, introduced to provide basic (and not-so-basic) homotopy-theoretic constructions in a type-theoretic style. They have proven very fruitful for the "synthetic" development of homotopy theory within type theory, as well as in formalising ordinary set-level mathematics in type theory. In this paper, we construct models of a wide range of higher inductive types in a fairly wide range of settings. We introduce the notion ofcell monad with parameters: a semantically-defined scheme for specifying homotopically well-behaved notions of structure. We then show that any suitable model category hasweakly stable typal initial algebrasfor any cell monad with parameters. When combined with the local universes construction to obtain strict stability, this specialises to give models of specific higher inductive types, including spheres, the torus, pushout types, truncations, the James construction and general localisations. Our results apply in any sufficiently nice Quillen model category, including any right proper, simplicially locally cartesian closed, simplicial Cisinski model category (such as simplicial sets) and any locally presentable locally cartesian closed category (such as sets) with its trivial model structure. In particular, any locally presentable locally cartesian closed (infinity, 1)-category is presented by some model category to which our results apply.
引用
收藏
页码:159 / 208
页数:50
相关论文
共 50 条
  • [21] QUOTIENTS, INDUCTIVE TYPES, & QUOTIENT INDUCTIVE TYPES
    Fiore, Marcelo P.
    Pitts, Andrew M.
    Steenkamp, S. C.
    LOGICAL METHODS IN COMPUTER SCIENCE, 2022, 18 (02)
  • [22] Semantics for First-Order Affine Inductive Data Types via Slice Categories
    Zamdzhiev, Vladimir
    COALGEBRAIC METHODS IN COMPUTER SCIENCE, CMCS 2020, 2020, 12094 : 180 - 200
  • [24] Inductive assertions and operational semantics
    Moore, JS
    CORRECT HARDWARE DESIGN AND VERIFICATION METHODS, PROCEEDINGS, 2003, 2860 : 289 - 303
  • [25] Inductive assertions and operational semantics
    J. Strother Moore
    International Journal on Software Tools for Technology Transfer, 2006, 8 (4-5) : 359 - 371
  • [26] Quotient Inductive-Inductive Types
    Altenkirch, Thorsten
    Capriotti, Paolo
    Dijkstra, Gabe
    Kraus, Nicolai
    Forsberg, Fredrik Nordvall
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2018, 2018, 10803 : 293 - 310
  • [27] Cubical Agda: A dependently typed programming language with univalence and higher inductive types
    Vezzosi, Andrea
    Mortberg, Anders
    Abel, Andreas
    JOURNAL OF FUNCTIONAL PROGRAMMING, 2021, 31
  • [28] Cubical Agda: A Dependently Typed Programming Language with Univalence and Higher Inductive Types
    Vezzosi, Andrea
    Mortberg, Anders
    Abel, Andreas
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2019, 3 (ICFP):
  • [29] Bi-inductive structural semantics
    Cousot, Patrick
    Cousot, Radhia
    INFORMATION AND COMPUTATION, 2009, 207 (02) : 258 - 283
  • [30] Constructing Quotient Inductive-Inductive Types
    Kaposi, Ambrus
    Kovacs, Andras
    Altenkirch, Thorsten
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2019, 3