English
Related papers

Related papers: Models of Type Theory with Strict Equality

200 papers

The aim of staged compilation is to enable metaprogramming in a way such that we have guarantees about the well-formedness of code output, and we can also mix together object-level and meta-level code in a concise and convenient manner. In…

Programming Languages · Computer Science 2022-09-21 András Kovács

This is an introduction to Homotopy Type Theory and Univalent Foundations for philosophers, written as a chapter for the book "Categories for the Working Philosopher" (ed. Elaine Landry)

Logic · Mathematics 2016-01-28 Michael Shulman

Homotopy Type Theory may be seen as an internal language for the $\infty$-category of weak $\infty$-groupoids which in particular models the univalence axiom. Voevodsky proposes this language for weak $\infty$-groupoids as a new foundation…

Category Theory · Mathematics 2019-02-20 Egbert Rijke , Bas Spitters

Real numbers in constructive mathematics have always seemed to require compromises of one form or another. Classical proofs of Cauchy completeness require countable choice, Bishop's setoid construction introduces persistent bookkeeping…

Logic in Computer Science · Computer Science 2026-04-29 Jackson Brough

In this paper, we study some qualitative properties of Hardy-Littlewood-Sobolev type systems. The HLS type systems are categorized into three cases: critical, supercritical and subcritical. The critical case, the well known original HLS…

Analysis of PDEs · Mathematics 2015-10-13 Ze Cheng , Genggeng Huang , Congming Li

The aim of this paper is to refine and extend proposals by Sozeau and Tabareau and by Voevodsky for universe polymorphism in type theory. In those systems judgments can depend on explicit constraints between universe levels. We here present…

Logic in Computer Science · Computer Science 2024-10-29 Marc Bezem , Thierry Coquand , Peter Dybjer , Martín Escardó

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

In this paper we construct new categorical models for the identity types of Martin-L\"of type theory, in the categories Top of topological spaces and SSet of simplicial sets. We do so building on earlier work of Awodey and Warren, which has…

Logic · Mathematics 2011-10-17 Benno van den Berg , Richard Garner

We present the type theory CaTT, originally introduced by Finster and Mimram to describe globular weak $\omega$-categories, and we formalise this theory in the language of homotopy type theory. Most of the studies about this type theory…

Logic in Computer Science · Computer Science 2024-11-14 Thibaut Benjamin

Connections between homotopy theory and type theory have recently attracted a lot of attention, with Voevodsky's univalent foundations and the interpretation of Martin-Lof's identity types in Quillen model categories as some of the…

Category Theory · Mathematics 2016-09-21 Benno van den Berg

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

2-Theories are a canonical way of describing categories with extra structure. 2-theory-morphisms are used when discussing how one structure can be replaced with another structure. This is central to categorical coherence theory. We place a…

Category Theory · Mathematics 2007-05-23 Noson S. Yanofsky

Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show that two constants (falsity and implication) suffice for…

Logic in Computer Science · Computer Science 2010-01-25 Mark Kaminski , Gert Smolka

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

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

An appropriate framework is put forward for the construction of $\lambda$-models with $\infty$-groupoid structure, which we call \textit{homotopic $\lambda$-models}, through the use of an $\infty$-category with cartesian closure and enough…

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

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

In this paper we establish the reversed sharp Hardy-Littlewood-Sobolev (HLS for short) inequality on the upper half space and obtain a new HLS type integral inequality on the upper half space (extending an inequality found by Hang, Wang and…

Analysis of PDEs · Mathematics 2017-03-09 Jingbo Dou , Qianqiao Guo , Meijun Zhu

Many definitions of weak and strict $\infty$-categories have been proposed. In this paper we present a definition for $\infty$-categories with strict associators, but which is otherwise fully weak. Our approach is based on the existing type…

Category Theory · Mathematics 2021-09-06 Eric Finster , Alex Rice , Jamie Vicary

We present generalized algebraic theories corresponding to slightly modified versions of two of the type theories in our paper Type Theory with Explicit Universe Polymorphism. We first present a generalized algebraic theory for categories…

Logic in Computer Science · Computer Science 2026-03-05 Marc Bezem , Thierry Coquand , Peter Dybjer , Martín Escardó