English
Related papers

Related papers: Inductive types in homotopy type theory

200 papers

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 investigate inductive types in type theory, using the insights provided by homotopy type theory and univalent foundations of mathematics. We do so by introducing the new notion of a homotopy-initial algebra. This notion is defined by a…

Logic · Mathematics 2015-04-22 Steve Awodey , Nicola Gambino , Kristina Sojakova

The purpose of this survey article is to introduce the reader to a connection between Logic, Geometry, and Algebra which has recently come to light in the form of an interpretation of the constructive type theory of Martin-L\"of into…

Category Theory · Mathematics 2010-10-12 Steve Awodey

We prove a conjecture about the constructibility of coinductive types - in the principled form of indexed M-types - in Homotopy Type Theory. The conjecture says that in the presence of inductive types, coinductive types are derivable.…

Logic in Computer Science · Computer Science 2019-07-16 Benedikt Ahrens , Paolo Capriotti , Régis Spadotti

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

Within dependent type theory, we provide a topological counterpart of well-founded trees (for short, W-types) by using a proof-relevant version of the notion of inductively generated suplattices introduced in the context of formal topology…

Logic in Computer Science · Computer Science 2024-02-14 Maria Emilia Maietti , Pietro Sabelli

This is an introductory textbook to univalent mathematics and homotopy type theory, a mathematical foundation that takes advantage of the structural nature of mathematical definitions and constructions. It is common in mathematical practice…

Logic · Mathematics 2022-12-22 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

Homotopy type theory is a new branch of mathematics, based on a recently discovered connection between homotopy theory and type theory, which brings new ideas into the very foundation of mathematics. On the one hand, Voevodsky's subtle and…

Logic · Mathematics 2013-08-06 The Univalent Foundations Program

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

In the context of dependent type theory, we show that coinductive predicates have an equivalent topological counterpart in terms of coinductively generated positivity relations, introduced by G. Sambin to represent closed subsets in…

Logic · Mathematics 2024-04-05 Pietro Sabelli

Recent work on homotopy type theory exploits an exciting new correspondence between Martin-Lof's dependent type theory and the mathematical disciplines of category theory and homotopy theory. The category theory and homotopy theory suggest…

Logic · Mathematics 2013-01-16 Daniel R. Licata , Michael Shulman

Brouwer's constructivist foundations of mathematics is based on an intuitively meaningful notion of computation shared by all mathematicians. Martin-L\"of's meaning explanations for constructive type theory define the concept of a type in…

Logic in Computer Science · Computer Science 2016-06-15 Carlo Angiuli , Robert Harper , Todd Wilson

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

We report on the development of the HoTT library, a formalization of homotopy type theory in the Coq proof assistant. It formalizes most of basic homotopy type theory, including univalence, higher inductive types, and significant amounts of…

Logic in Computer Science · Computer Science 2017-05-02 Andrej Bauer , Jason Gross , Peter LeFanu Lumsdaine , Mike Shulman , Matthieu Sozeau , Bas Spitters

Working in homotopy type theory, we provide a systematic study of homotopy limits of diagrams over graphs, formalized in the Coq proof assistant. We discuss some of the challenges posed by this approach to formalizing homotopy-theoretic…

Logic · Mathematics 2019-02-20 Jeremy Avigad , Chris Kapulkin , Peter LeFanu Lumsdaine

Pure type systems arise as a generalisation of simply typed lambda calculus. The contemporary development of mathematics has renewed the interest in type theories, as they are not just the object of mere historical research, but have an…

Logic · Mathematics 2014-11-07 Nino Guallart

We discuss the homotopy type theory library in the Lean proof assistant. The library is especially geared toward synthetic homotopy theory. Of particular interest is the use of just a few primitive notions of higher inductive types, namely…

Logic in Computer Science · Computer Science 2017-09-21 Floris van Doorn , Jakob von Raumer , Ulrik Buchholtz

The introduction of first-class type classes in the Coq system calls for re-examination of the basic interfaces used for mathematical formalization in type theory. We present a new set of type classes for mathematics and take full advantage…

Logic in Computer Science · Computer Science 2011-02-08 Bas Spitters , Eelis van der Weegen

We present an elaboration of inductive definitions down to a universe of datatypes. The universe of datatypes is an internal presentation of strictly positive families within type theory. By elaborating an inductive definition -- a…

Programming Languages · Computer Science 2012-11-01 Pierre-Evariste Dagand , Conor McBride
‹ Prev 1 2 3 10 Next ›