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 条
  • [1] Higher Inductive Types in Programming
    Basold, Henning
    Geuvers, Herman
    van der Weide, Niels
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2017, 23 (01) : 63 - 88
  • [2] Denotational Cost Semantics for Functional Languages with Inductive Types
    Danner, Norman
    Licata, Daniel R.
    Ramyaa, Ramyaa
    PROCEEDINGS OF THE 20TH ACM SIGPLAN INTERNATIONAL CONFERENCE ON FUNCTIONAL PROGRAMMING (ICFP'15), 2015, : 140 - 151
  • [3] Impredicative Encodings of (Higher) Inductive Types
    Awodey, Steve
    Frey, Jonas
    Speight, Sam
    LICS'18: PROCEEDINGS OF THE 33RD ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, 2018, : 76 - 85
  • [4] Denotational Cost Semantics for Functional Languages with Inductive Types
    Danner, Norman
    Licata, Daniel R.
    Ramyaa, Ramyaa
    ACM SIGPLAN NOTICES, 2015, 50 (09) : 140 - 151
  • [5] SIGNATURES AND INDUCTION PRINCIPLES FOR HIGHER INDUCTIVE-INDUCTIVE TYPES
    Kaposi, Ambrus
    Kovacs, Andras
    LOGICAL METHODS IN COMPUTER SCIENCE, 2020, 16 (01)
  • [6] On Higher Inductive Types in Cubical Type Theory
    Coquand, Thierry
    Huber, Simon
    Mortberg, Anders
    LICS'18: PROCEEDINGS OF THE 33RD ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, 2018, : 255 - 264
  • [7] Constructing Higher Inductive Types as Groupoid Quotients
    van der Weide, Niels
    PROCEEDINGS OF THE 35TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2020), 2020, : 915 - 929
  • [8] Finitary Higher Inductive Types in the Groupoid Model
    Dybjer, Peter
    Moeneclaey, Hugo
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2018, 336 (336) : 119 - 134
  • [9] CONSTRUCTING HIGHER INDUCTIVE TYPES AS GROUPOID QUOTIENTS
    Veltri, Niccolo
    Van Der Weide, Niels
    LOGICAL METHODS IN COMPUTER SCIENCE, 2021, 17 (02) : 8:1 - 8:42
  • [10] Higher-order unification algorithm for inductive types and dependent types
    Qingping, T.
    Journal of Computer Science and Technology, 1997, 12 (03): : 231 - 243