English
Related papers

Related papers: Displayed Type Theory and Semi-Simplicial Types

200 papers

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 propose a new bi-intuitionistic type theory called Dualized Type Theory (DTT). It is a simple type theory with perfect intuitionistic duality, and corresponds to a single-sided polarized sequent calculus. We prove DTT strongly…

Logic in Computer Science · Computer Science 2019-03-14 Harley Eades , Aaron Stump , Ryan McCleeary

Simplicial type theory extends homotopy type theory with a directed path type which internalizes the notion of a homomorphism within a type. This concept has significant applications both within mathematics -- where it allows for synthetic…

Logic in Computer Science · Computer Science 2026-01-16 Daniel Gratzer , Jonathan Weinberger , Ulrik Buchholtz

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

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

We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…

Logic in Computer Science · Computer Science 2023-06-22 Daniel Gratzer , G. A. Kavvos , Andreas Nuyts , Lars Birkedal

In this article we consider the homotopy theory of stratified spaces through a simplicial point of view. We first consider a model category of filtered simplicial sets over some fixed poset $P$, and show that it is a simplicial…

Algebraic Topology · Mathematics 2020-03-24 Sylvain Douteau

Simplicial type theory (STT) was introduced by Riehl and Shulman to leverage homotopy type theory to prove results about $(\infty,1)$-categories. Initial work on simplicial type theory focused on "formal" arguments in higher category theory…

Logic in Computer Science · Computer Science 2026-02-03 Daniel Gratzer , Jonathan Weinberger , Ulrik Buchholtz

Topologists are sometimes interested in space-valued diagrams over a given index category, but it is tricky to say what such a diagram even is if we look for a notion that is stable under equivalence. The same happens in (homotopy) type…

Logic · Mathematics 2017-04-18 Nicolai Kraus , Christian Sattler

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Logic in Computer Science · Computer Science 2026-05-07 Matthijs Vákár

The study of homotopy theoretic phenomena in the language of type theory is sometimes loosely called `synthetic homotopy theory'. Homotopy theory in type theory is only one of the many aspects of homotopy type theory, which also includes…

Logic · Mathematics 2019-06-25 Egbert Rijke

In recent years, Homotopy Type Theory (HoTT) has had great success both as a foundation of mathematics and as internal language to reason about $\infty$-groupoids (a.k.a. spaces). However, in many areas of mathematics and computer science,…

Logic in Computer Science · Computer Science 2026-02-20 Fernando Rafael Chu Rivera , Paige Randall North

Using dependent type theory to formalise the syntax of dependent type theory is a very active topic of study and goes under the name of "type theory eating itself" or "type theory in type theory." Most approaches are at least loosely based…

Logic in Computer Science · Computer Science 2021-02-02 Nicolai Kraus

$\infty$-category theory was originally developed in the context of classical homotopy theory using standard set theoretical assumptions, but has since been extended to a variety of mathematical foundations. One such successful effort,…

Category Theory · Mathematics 2025-08-13 Nima Rasekh

We consider the conversion problem for multimodal type theory (MTT) by characterizing the normal forms of the type theory and proving normalization. Normalization follows from a novel adaptation of Sterling's Synthetic Tait Computability…

Logic in Computer Science · Computer Science 2021-06-04 Daniel Gratzer

Riehl and Shulman introduced simplicial type theory (STT), a variant of homotopy type theory which aimed to study not just homotopy theory, but its fusion with category theory: $(\infty,1)$-category theory. While notoriously technical,…

Logic in Computer Science · Computer Science 2025-12-12 Daniel Gratzer , Jonathan Weinberger , Ulrik Buchholtz

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 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

We present guarded dependent type theory, gDTT, an extensional dependent type theory with a `later' modality and clock quantifiers for programming and proving with guarded recursive and coinductive types. The later modality is used to…

Logic in Computer Science · Computer Science 2016-01-08 Aleš Bizjak , Hans Bugge Grathwohl , Ranald Clouston , Rasmus E. Møgelberg , Lars Birkedal

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
‹ Prev 1 2 3 10 Next ›