English
Related papers

Related papers: Quotient inductive-inductive types

200 papers

Quotient inductive-inductive types (QIITs) are generalized inductive types which allow sorts to be indexed over previously declared sorts, and allow usage of equality constructors. QIITs are especially useful for algebraic descriptions of…

Logic in Computer Science · Computer Science 2020-06-24 András Kovács , Ambrus Kaposi

In this paper, we study finitary 1-truncated higher inductive types (HITs) in homotopy type theory. We start by showing that all these types can be constructed from the groupoid quotient. We define an internal notion of signatures for HITs,…

Logic in Computer Science · Computer Science 2023-06-22 Niccolò Veltri , Niels van der Weide

Higher inductive-inductive types (HIITs) generalize inductive types of dependent type theories in two ways. On the one hand they allow the simultaneous definition of multiple sorts that can be indexed over each other. On the other hand they…

Logic in Computer Science · Computer Science 2023-06-22 Ambrus Kaposi , András Kovács

We consider the problem of defining the integers in Homotopy Type Theory (HoTT). We can define the type of integers as signed natural numbers (i.e., using a coproduct), but its induction principle is very inconvenient to work with, since it…

Logic in Computer Science · Computer Science 2020-07-02 Thorsten Altenkirch , Luis Scoccola

This is the fourth in a series of papers extending Martin-L\"of's meaning explanation of dependent type theory to higher-dimensional types. In this installment, we show how to define cubical type systems supporting a general schema of…

Logic in Computer Science · Computer Science 2018-07-20 Evan Cavallo , Robert Harper

Homotopy type theory (HoTT) can be seen as a generalisation of structural set theory, in the sense that 0-types represent structural sets within the more general notion of types. For material set theory, we also have concrete models as…

Logic · Mathematics 2025-10-31 Håkon Robbestad Gylterud , Elisabeth Stenholm

Homotopy Type Theory is a new field of mathematics based on the surprising and elegant correspondence between Martin-Lofs constructive type theory and abstract homotopy theory. We have a powerful interplay between these disciplines - we can…

Logic in Computer Science · Computer Science 2014-02-10 Kristina Sojakova

In homotopy type theory (HoTT), all constructions are necessarily stable under homotopy equivalence. This has shortcomings: for example, it is believed that it is impossible to define a type of semi-simplicial types. More generally, it is…

Logic in Computer Science · Computer Science 2016-11-01 Thorsten Altenkirch , Paolo Capriotti , Nicolai Kraus

Escard\'o and Simpson defined a notion of interval object by a universal property in any category with binary products. The Homotopy Type Theory book defines a higher-inductive notion of reals, and suggests that the interval may satisfy…

Logic in Computer Science · Computer Science 2017-06-20 Auke Bart Booij

Higher inductive types are 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…

Logic · Mathematics 2020-07-08 Peter LeFanu Lumsdaine , Mike Shulman

Homotopy type theory is an interpretation of Martin-L\"of's constructive type theory into abstract homotopy theory. There results a link between constructive mathematics and algebraic topology, providing topological semantics for…

Logic · Mathematics 2023-03-31 Steve Awodey , Nicola Gambino , Kristina Sojakova

Guarded recursion is a powerful modal approach to recursion that can be seen as an abstract form of step-indexing. It is currently used extensively in separation logic to model programming languages with advanced features by solving domain…

Logic in Computer Science · Computer Science 2022-06-06 Magnus Baunsgaard Kristensen , Rasmus Ejlers Møgelberg , Andrea Vezzosi

We found in Homotopy Type Theory (HoTT), a way of representing a first order version of intuitionistic logic (ICL), for intuitionistic calculational logic) where, instead of deduction trees, corresponding linear calculational formats are…

Logic · Mathematics 2019-08-01 Ernesto Acosta , Bernarda Aldana , Jaime Bohorquez

This paper introduces an expressive class of indexed quotient-inductive types, called QWI types, within the framework of constructive type theory. They are initial algebras for indexed families of equational theories with possibly…

Logic in Computer Science · Computer Science 2023-06-22 Marcelo P. Fiore , Andrew M. Pitts , S. C. Steenkamp

We define and develop two-level type theory (2LTT), a version of Martin-L\"of 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…

Logic in Computer Science · Computer Science 2026-05-27 Danil Annenkov , Paolo Capriotti , Nicolai Kraus , Christian Sattler

This thesis introduces the idea of two-level type theory, an extension of Martin-L\"of type theory that adds a notion of strict equality as an internal primitive. A type theory with a strict equality alongside the more conventional form of…

Logic in Computer Science · Computer Science 2017-02-17 Paolo Capriotti

We give a model of set theory based on multisets in homotopy type theory. The equality of the model is the identity type. The underlying type of iterative sets can be formulated in Martin-L\"of type theory, without Higher Inductive Types…

Logic · Mathematics 2020-07-08 Håkon Robbestad Gylterud

The problem of defining Semi-Simplicial Types (SSTs) in Homotopy Type Theory (HoTT) has been recognized as important during the Year of Univalent Foundations at the Institute of Advanced Study. According to the interpretation of HoTT in…

Logic in Computer Science · Computer Science 2015-06-17 Fedor Part , Zhaohui Luo

Some advantages of Cubical Type Theory, as implemented by Cubical Agda, over intensional Martin-L\"of Type Theory include Quotient Inductive Types (QITs), which exist as instances of Higher Inductive Types, and functional extensionality,…

Programming Languages · Computer Science 2025-11-27 Yee-Jian Tan , Andreas Nuyts , Dominique Devriese

Univalent homotopy type theory (HoTT) may be seen as a language for the category of $\infty$-groupoids. It is being developed as a new foundation for mathematics and as an internal language for (elementary) higher toposes. We develop the…

Category Theory · Mathematics 2023-06-22 Egbert Rijke , Michael Shulman , Bas Spitters
‹ Prev 1 2 3 10 Next ›