@misc { , title = {Quotient inductive-inductive types}, abstract = {Higher inductive types (HITs) in Homotopy Type Theory (HoTT) allow the definition of datatypes which have constructors for equalities over the defined type. HITs generalise quotient types and allow to define types which are not sets in the sense of HoTT (i.e. do not satisfy uniqueness of equality proofs) such as spheres, suspensions and the torus. However, there are also interesting uses of HITs to define sets, such as the Cauchy reals, the partiality monad, and the internal, total syntax of type theory. In each of these examples we define several types that depend on each other mutually, i.e. they are inductive-inductive definitions. We call those HITs quotient inductive-inductive types (QIITs). Although there has been recent progress on the general theory of HITs, there isn't yet a theoretical foundation of the combination of equality constructors and induction-induction, despite having many interesting applications. In the present paper we present a first step towards a semantic definition of QIITs. In particular, we give an initial-algebra semantics and show that this is equivalent to the section induction principle, which justifies the intuitively expected elimination rules.}, conference = {FoSSaCS 2018: 21st International Conference on Foundations of Software Science and Computation Structures}, doi = {10.1007/978-3-319-89366-2\_16}, isbn = {9783319893655}, note = {Open Access article. TJJ 18/04/2018. Updated OL 29.05.2018}, organization = {Thessaloniki, Greece}, pages = {293-310}, publicationstatus = {Published}, publisher = {Springer Publishing Company}, url = {https://nottingham-repository.worktribe.com/output/855899}, keyword = {Logic in Computer Science;}, year = {2024}, author = {Altenkirch, Thorsten and Capriotti, Paolo and Dijkstra, Gabe and Kraus, Nicolai and Nordvall Forsberg, Fredrik} editor = {Baier, Christel and Dal Lago, Ugo} }