English
Related papers

Related papers: Directed type theory, with a twist

200 papers

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

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

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

Univalent homotopy type theory (HoTT) may be seen as a language for the category of $\infty$-groupoids. It is being developed as a new foundation for mathematics and as an internal language for (elementary) higher toposes. We develop the…

Category Theory · Mathematics 2023-06-22 Egbert Rijke , Michael Shulman , Bas Spitters

Categories with families (CwFs) have been used to define the semantics of type theory in type theory. In the setting of Homotopy Type Theory (HoTT), one of the limitations of the traditional notion of CwFs is the requirement to set-truncate…

Logic in Computer Science · Computer Science 2025-12-10 Thorsten Altenkirch , Ambrus Kaposi , Szumi Xie

Higher inductive types (HITs) in Homotopy Type Theory (HoTT) allow the definition of datatypes which have constructors for equalities over the defined type. HITs generalise quotient types and allow to define types which are not sets in the…

Logic in Computer Science · Computer Science 2018-05-09 Thorsten Altenkirch , Paolo Capriotti , Gabe Dijkstra , Nicolai Kraus , Fredrik Nordvall Forsberg

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 reformulate recent advances in directed type theory--a type theory where the types have the structure of synthetic (higher) categories--as a logical calculus with multiple context 'zones', following the example of Pfenning and Davies.…

Logic in Computer Science · Computer Science 2025-10-21 Jacob Neumann

Dynamic HoTT (DHoTT) is a conservative extension of Homotopy Type Theory designed for evolving texts in conversational AI. In a chat system, a large language model (LLM) is queried with a growing prefix: at turn tau the input is C(tau), the…

Logic in Computer Science · Computer Science 2025-11-18 Iman Poernomo

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

The field of directed type theory seeks to design type theories capable of reasoning synthetically about (higher) categories, by generalizing the symmetric identity types of Martin-L\"of Type Theory to asymmetric hom-types. We articulate…

Category Theory · Mathematics 2025-10-21 Thorsten Altenkirch , Jacob Neumann

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

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

Awodey, later with Newstead, showed how polynomial functors with extra structure (termed ``natural models'') hold within them the categorical semantics for dependent type theory. Their work presented these ideas clearly but ultimately led…

Logic in Computer Science · Computer Science 2026-03-03 C. B. Aberlé , David I. Spivak

A hierarchy of type universes is a rudimentary ingredient in the type theories of many proof assistants to prevent the logical inconsistency resulting from combining dependent functions and the type-in-type rule. In this work, we argue that…

Programming Languages · Computer Science 2024-04-09 Jonathan Chan , Stephanie Weirich

We propose foundations for a synthetic theory of $(\infty,1)$-categories within homotopy type theory. We axiomatize a directed interval type, then define higher simplices from it and use them to probe the internal categorical structures of…

Category Theory · Mathematics 2023-06-09 Emily Riehl , Michael Shulman

Graded type theories are an emerging paradigm for augmenting the reasoning power of types with parameterizable, fine-grained analyses of program properties. There have been many such theories in recent years which equip a type theory with…

Logic in Computer Science · Computer Science 2021-02-23 Benjamin Moon , Harley Eades , Dominic Orchard

We introduce Open Horn Type Theory (OHTT), an extension of dependent type theory with two primitive judgment forms: coherence and gap, subject to a mutual exclusion law. Unlike classical or intuitionistic negation, gap is not defined via…

Logic in Computer Science · Computer Science 2026-01-01 Iman Poernomo

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

Given a finite $\mathbb{Z}_2$-graded group $\hat{\mathsf{G}}$ with ungraded subgroup $\mathsf{G}$ and a twisted cocycle $\hat{\lambda} \in Z^n(B \hat{\mathsf{G}}; \mathsf{U}(1)_{\pi})$ which restricts to $\lambda \in Z^n(B \mathsf{G};…

Quantum Algebra · Mathematics 2020-04-22 Matthew B. Young
‹ Prev 1 2 3 10 Next ›