English
Related papers

Related papers: (Co)condition hits the Path

200 papers

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

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

We develop a dependent type theory that is based purely on inductive and coinductive types, and the corresponding recursion and corecursion principles. This results in a type theory with a small set of rules, while still being fairly…

Logic in Computer Science · Computer Science 2016-05-10 Henning Basold , Herman Geuvers

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

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

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 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 present new induction principles for the syntax of dependent type theories, which we call relative induction principles. The result of the induction principle relative to a functor F into the syntax is stable over the codomain of F. We…

Logic in Computer Science · Computer Science 2021-07-20 Rafaël Bocquet , Ambrus Kaposi , Christian Sattler

The development of cubical type theory inspired the idea of "extension types" which has been found to have applications in other type theories that are unrelated to homotopy type theory or cubical type theory. This article describes these…

Programming Languages · Computer Science 2024-02-08 Tesla Zhang

This paper proposes a way of doing type theory informally, assuming a cubical style of reasoning. It can thus be viewed as a first step toward a cubical alternative to the program of informalization of type theory carried out in the…

Logic in Computer Science · Computer Science 2023-12-29 Bruno Bentzen

The homotopical approach to intensional type theory views proofs of equality as paths. We explore what is required of an object $I$ in a topos to give such a path-based model of type theory in which paths are just functions with domain $I$.…

Logic in Computer Science · Computer Science 2023-06-22 Ian Orton , Andrew M. Pitts

Suppose we are given a graph and want to show a property for all its cycles (closed chains). Induction on the length of cycles does not work since sub-chains of a cycle are not necessarily closed. This paper derives a principle reminiscent…

Logic · Mathematics 2020-07-01 Nicolai Kraus , Jakob von Raumer

Recently discovered domain-specific formal systems -- specifically homotopy type theory and simplicial type theory -- provide new perspectives on spaces and categories in a natively equivalence-invariant setting. In this note, we expose…

Category Theory · Mathematics 2025-10-20 Emily Riehl

In this short note, we construct a class of models of an extension of homotopy type theory, which we call homotopy type theory with an interval type.

Logic in Computer Science · Computer Science 2020-07-15 Valery Isaev

Most categorical models for dependent types have traditionally been heavily set based: contexts form a category, and for each we have a set of types in said context -- and for each type a set of terms of said type. This is the case for…

Logic in Computer Science · Computer Science 2023-12-25 Greta Coraglia , Jacopo Emmenegger

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

We propose a new framework for integrating quantifiers with other logical connectives in a higher-categorical setting. Our method systematically incorporates key coherence conditions-including those akin to the Beck-Chevalley property-and…

General Mathematics · Mathematics 2025-05-19 Barreto Joaquim Reizi

We introduce some classes of genuine higher categories in homotopy type theory, defined as well-behaved subcategories of the category of types. We give several examples, and some techniques for showing other things are not examples. While…

Category Theory · Mathematics 2013-11-11 James Cranch

This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…

Logic in Computer Science · Computer Science 2024-01-30 C. B. Aberlé

We introduce the notion of a logical model category which is a Quillen model category satisfying some additional conditions. Those conditions provide enough expressive power that one can soundly interpret dependent products and sums in it.…

Logic · Mathematics 2012-08-30 Peter Arndt , Chris Kapulkin
‹ Prev 1 2 3 10 Next ›