English
Related papers

Related papers: Open Horn Type Theory

200 papers

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

The notion of a natural model of type theory is defined in terms of that of a representable natural transfomation of presheaves. It is shown that such models agree exactly with the concept of a category with families in the sense of Dybjer,…

Category Theory · Mathematics 2017-01-10 Steve Awodey

Dependent type theory gives an expressive type system facilitating succinct formalizations of mathematical concepts. In practice, it is mainly used for interactive theorem proving with intensional type theories, with PVS being a notable…

Logic in Computer Science · Computer Science 2024-10-21 Johannes Niederhauser , Chad E. Brown , Cezary Kaliszyk

We present a new model of Guarded Dependent Type Theory (GDTT), a type theory with guarded recursion and multiple clocks in which one can program with, and reason about coinductive types. Productivity of recursively defined coinductive…

Logic in Computer Science · Computer Science 2020-04-14 Aleš Bizjak , Rasmus Ejlers Møgelberg

In the context of categories equipped with a structure of nullhomotopies, we introduce the notion of homotopy torsion theory. As special cases, we recover pretorsion theories as well as torsion theories in multi-pointed categories and in…

Category Theory · Mathematics 2023-09-01 Sandra Mantovani , Mariano Messora , Enrico M. Vitale

We develop a homotopy theory for additive categories endowed with endofunctors, analogous to the concept of a model structure. We use it to construct the homotopy theory of a Hovey triple (which consists of two compatible complete cotorsion…

Representation Theory · Mathematics 2017-03-09 Zhi-Wei Li

We show that in a weak globular $\omega$-category, all composition operations are equivalent and commutative for cells with sufficiently degenerate boundary, which can be considered a higher-dimensional generalisation of the Eckmann-Hilton…

Category Theory · Mathematics 2025-12-22 Thibaut Benjamin , Ioannis Markakis , Wilfred Offord , Chiara Sarti , Jamie Vicary

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

We introduce a novel, logic-independent framework for the study of sequent-style proof systems, which covers a number of proof-theoretic formalisms and concrete proof systems that appear in the literature. In particular, we introduce a…

Logic in Computer Science · Computer Science 2025-12-22 Tim S. Lyon , Piotr Ostropolski-Nalewaja

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

Higher homotopies are nowadays playing a prominent role in mathematics as well as in certain branches of theoretical physics. We recall some of the connections between the past and the present developments. Higher homotopies were isolated…

Algebraic Topology · Mathematics 2013-03-12 Johannes Huebschmann

Simplicial type theory extends homotopy type theory and equips types with a notion of directed morphisms. A Segal type is defined to be a type in which these directed morphisms can be composed. We show that all higher coherences can be…

Category Theory · Mathematics 2026-01-30 Tom de Jong , Nicolai Kraus , Axel Ljungström

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

One takes advantage of some basic properties of every homotopic $\lambda$-model (e.g.\ extensional Kan complex) to explore the higher $\beta\eta$-conversions, which would correspond to proofs of equality between terms of a theory of…

Logic in Computer Science · Computer Science 2023-04-27 Daniel O. Martínez-Rivillas , Ruy J. G. B. de Queiroz

In view of the Segal construction each category with a coherent operation gives rise to a cohomology theory. Similarly each open stable differential relation $R$ imposed on smooth maps of manifolds determines cohomology theories $k^*$ and…

Geometric Topology · Mathematics 2018-01-18 Rustam Sadykov

We establish proof-theoretic, constructive and coalgebraic foundations for proof search in coinductive Horn clause theories. Operational semantics of coinductive Horn clause resolution is cast in terms of coinductive uniform proofs; its…

Logic in Computer Science · Computer Science 2022-03-16 Henning Basold , Ekaterina Komendantskaya , Yue Li

We describe a Martin-L\"of-style dependent type theory, called Cocon, that allows us to mix the intensional function space that is used to represent higher-order abstract syntax (HOAS) trees with the extensional function space that…

Logic in Computer Science · Computer Science 2019-05-13 Brigitte Pientka , David Thibodeau , Andreas Abel , Francisco Ferreira , Rebecca Zucchini

We develop square zero obstruction theory for modules over $\mathbb{E}_1$-algebras in an arbitrary stable (presentably) monoidal $\infty$-category. We explicitly describe the obstruction element as the homotopy class of a canonically…

Algebraic Topology · Mathematics 2023-04-26 Shaul Barkan

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

In a constructive setting, no concrete formulation of ordinal numbers can simultaneously have all the properties one might be interested in; for example, being able to calculate limits of sequences is constructively incompatible with…

Logic in Computer Science · Computer Science 2023-05-18 Nicolai Kraus , Fredrik Nordvall Forsberg , Chuangjie Xu