English
Related papers

Related papers: Two-Level Type Theory and Applications

200 papers

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

GADTs were introduced in Haskell's eco-system more than a decade ago, but their interaction with several mainstream features such as type classes and functional dependencies has a lot of room for improvement. More specifically, for some…

Programming Languages · Computer Science 2019-07-02 Koen Pauwels , Georgios Karachalias , Michiel Derhaeg , Tom Schrijvers

This paper improves the treatment of equality in guarded dependent type theory (GDTT), by combining it with cubical type theory (CTT). GDTT is an extensional type theory with guarded recursive types, which are useful for building models of…

Logic in Computer Science · Computer Science 2017-10-09 Lars Birkedal , Aleš Bizjak , Ranald Clouston , Hans Bugge Grathwohl , Bas Spitters , Andrea Vezzosi

We observe that the notion of two sets being equal up to finitely many elements is a homotopy equivalence relation in a model category, and suggest a homotopy-invariant variant of Generalised Continuum Hypothesis about which more can be…

Category Theory · Mathematics 2010-06-25 Misha Gavrilovich

We propose a new type-theoretic approach to SLD-resolution and Horn-clause logic programming. It views Horn formulas as types, and derivations for a given query as a construction of the inhabitant (a proof-term) for the type given by the…

Logic in Computer Science · Computer Science 2015-10-16 Peng Fu , Ekaterina Komendantskaya

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

Quotient inductive-inductive types (QIITs) are generalized inductive types which allow sorts to be indexed over previously declared sorts, and allow usage of equality constructors. QIITs are especially useful for algebraic descriptions of…

Logic in Computer Science · Computer Science 2020-06-24 András Kovács , Ambrus Kaposi

Everyone knows that if you have a bivariant homology theory satisfying a base change formula, you get an representation of a category of correspondences. For theories in which the covariant and contravariant transfer maps are in mutual…

Category Theory · Mathematics 2022-12-21 Andrew W. Macpherson

Given a type A in homotopy type theory (HoTT), we can define the free infinity-group on A as the loop space of the suspension of A+1. Equivalently, this free higher group can be defined as a higher inductive type F(A) with constructors unit…

Logic in Computer Science · Computer Science 2020-05-21 Nicolai Kraus , Thorsten Altenkirch

We study 2-monads and their algebras using a Cat-enriched version of Quillen model categories, emphasizing the parallels between the homotopical and 2-categorical points of view. Every 2-category with finite limits and colimits has a…

Category Theory · Mathematics 2010-09-10 Stephen Lack

We formulate and prove a twofold generalisation of Lie's second theorem that integrates homomorphisms between formal group laws to homomorphisms between Lie groups. Firstly we generalise classical Lie theory by replacing groups with…

Category Theory · Mathematics 2016-05-25 Matthew Burke

Modalities in homotopy type theory are used to create and access subuniverses of a given type universe. These have significant applications throughout mathematics and computer science, and in particular can be used to create universes in…

Logic in Computer Science · Computer Science 2025-02-03 Mark Damuni Williams

This paper shows how internal models for polymorphic lambda calculi arise in any 2-category with a notion of discreteness. We generalise to a 2-categorical setting the famous theorem of Peter Freyd saying that there are no sufficiently…

Category Theory · Mathematics 2014-10-16 Michal R. Przybylek

We study a variation of Turaev's homotopy quantum field theories using 2-categories of surfaces. We define the homotopy surface 2-category of a space $X$ and define an $\cS_X$-structure to be a monoidal 2-functor from this to the 2-category…

Quantum Algebra · Mathematics 2007-05-23 M. Brightwell , P. Turner

Our main result states that for each finite complex L the category ${\bf TOP}$ of topological spaces possesses a model category structure (in the sense of Quillen) whose weak equivalences are precisely maps which induce isomorphisms of all…

Algebraic Topology · Mathematics 2007-05-23 A. Chigogidze , A. Karasev

For Martin-Lof type theory with a hierarchy U(0): U(1): U(2): ... of univalent universes, we show that U(n) is not an n-type. Our construction also solves the problem of finding a type that strictly has some high truncation level without…

Logic · Mathematics 2015-06-03 Nicolai Kraus , Christian Sattler

Non-wellfounded material sets have been modelled in Martin-L\"of type theory by Lindstr\"om using setoids. In this paper we construct models of non-wellfounded material sets in Homotopy Type Theory (HoTT) where equality is interpreted as…

Logic · Mathematics 2025-09-03 Håkon Robbestad Gylterud , Elisabeth Stenholm , Niccolò Veltri

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

We prove normalization for MTT, a general multimodal dependent type theory capable of expressing modal type theories for guarded recursion, internalized parametricity, and various other prototypical modal situations. We prove that deciding…

Logic in Computer Science · Computer Science 2026-03-25 Daniel Gratzer

In this paper I will develop a lambda-term calculus, lambda-2Int, for a bi-intuitionistic logic and discuss its implications for the notions of sense and denotation of derivations in a bilateralist setting. Thus, I will use the Curry-Howard…

Logic in Computer Science · Computer Science 2024-02-26 Sara Ayhan