English
Related papers

Related papers: From Multisets to Sets in Hotmotopy Type Theory

200 papers

Voevodsky's univalence axiom is often motivated as a realization of the equivalence principle; the idea that equivalent mathematical structures satisfy the same properties. Indeed, in Homotopy Type Theory, properties and structures can be…

Logic in Computer Science · Computer Science 2022-11-15 Rafaël Bocquet

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

We propose an extension of Aczel's constructive set theory CZF by an axiom for inductive types and a choice principle, and show that this extension has the following properties: it is interpretable in Martin-Lof's type theory (hence…

Logic · Mathematics 2013-09-27 Benno van den Berg , Ieke Moerdijk

The usual homogeneous form of equality type in Martin-L\"of Type Theory contains identifications between elements of the same type. By contrast, the heterogeneous form of equality contains identifications between elements of possibly…

Logic in Computer Science · Computer Science 2022-03-15 Andrew M. Pitts

We characterize the epimorphisms in homotopy type theory (HoTT) as the fiberwise acyclic maps and develop a type-theoretic treatment of acyclic maps and types in the context of synthetic homotopy theory as developed in univalent…

Logic in Computer Science · Computer Science 2025-02-12 Ulrik Buchholtz , Tom de Jong , Egbert Rijke

Cubical type theory provides a constructive justification to certain aspects of homotopy type theory such as Voevodsky's univalence axiom. This makes many extensionality principles, like function and propositional extensionality, directly…

Logic in Computer Science · Computer Science 2018-05-02 Thierry Coquand , Simon Huber , Anders Mörtberg

The intended model of the homotopy type theories used in Univalent Foundations is the infinity-category of homotopy types, also known as infinity-groupoids. The problem of higher structures is that of constructing the homotopy types needed…

Logic · Mathematics 2018-07-09 Ulrik Buchholtz

This paper presents a novel connection between homotopical algebra and mathematical logic. It is shown that a form of intensional type theory is valid in any Quillen model category, generalizing the Hofmann-Streicher groupoid model of…

Logic · Mathematics 2009-11-13 Steve Awodey , Michael A. Warren

We construct a new model category presenting the homotopy theory of presheaves on "inverse EI $(\infty,1)$-categories", which contains universe objects that satisfy Voevodsky's univalence axiom. In addition to diagrams on ordinary inverse…

Algebraic Topology · Mathematics 2017-03-30 Michael Shulman

This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…

Logic in Computer Science · Computer Science 2016-11-14 Cyril Cohen , Thierry Coquand , Simon Huber , Anders Mörtberg

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

In this paper we study a model structure on a category of schemes with a group action and the resulting unstable and stable equivariant motivic homotopy theories. The new model structure introduced here samples a comparison to the one by…

Algebraic Topology · Mathematics 2013-12-03 Philip Herrmann

It is a well-known theorem of homotopy type theory, originally due to Voevodsky, that function extensionality holds inside any univalent universe. We consider a weaker variant of the univalence axiom, asserting that the wild category formed…

Logic in Computer Science · Computer Science 2026-05-04 Evan Cavallo , Jonas Höfer

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

In this paper, we analyze and compare three of the many algebraic structures that have been used for modeling dependent type theories: categories with families, split type-categories, and representable maps of presheaves. We study these in…

Logic · Mathematics 2023-06-22 Benedikt Ahrens , Peter LeFanu Lumsdaine , Vladimir Voevodsky

Coquand's cubical set model for homotopy type theory provides the basis for a computational interpretation of the univalence axiom and some higher inductive types, as implemented in the cubical proof assistant. This paper contributes to the…

Logic in Computer Science · Computer Science 2016-10-19 Bas Spitters

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

This paper introduces Isabelle/HoTT, the first development of homotopy type theory in the Isabelle proof assistant. Building on earlier work by Paulson, I use Isabelle's existing logical framework infrastructure to implement essential…

Logic in Computer Science · Computer Science 2021-04-20 Joshua Chen

This paper continues the series of papers that develop a new approach to syntax and semantics of dependent type theories. Here we study the interpretation of the rules of the identity types in the intensional Martin-Lof type theories on the…

Category Theory · Mathematics 2015-05-26 Vladimir Voevodsky

In this paper we combine the principled approach to modalities from multimodal type theory (MTT) with the computationally well-behaved realization of identity types from cubical type theory (CTT). The result -- cubical modal type theory…

Logic in Computer Science · Computer Science 2024-12-18 Frederik Lerbjerg Aagaard , Magnus Baunsgaard Kristensen , Daniel Gratzer , Lars Birkedal