English
Related papers

Related papers: Models of Type Theory Based on Moore Paths

200 papers

A new approach to the semantics of identity types in intensional Martin-L\"of type theory is proposed, assuming only a category with finite limits and an interval. The specification of \emph{extensional} identity types in the original…

Category Theory · Mathematics 2026-01-13 Steve Awodey , Joseph Hua

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

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

Homotopy type theory is an interpretation of Martin-L\"of's constructive type theory into abstract homotopy theory. There results a link between constructive mathematics and algebraic topology, providing topological semantics for…

Logic · Mathematics 2023-03-31 Steve Awodey , Nicola Gambino , Kristina Sojakova

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

Homotopy Type Theory is a new field of mathematics based on the surprising and elegant correspondence between Martin-Lofs constructive type theory and abstract homotopy theory. We have a powerful interplay between these disciplines - we can…

Logic in Computer Science · Computer Science 2014-02-10 Kristina Sojakova

It often happens that free algebras for a given theory satisfy useful reasoning principles that are not preserved under homomorphisms of algebras, and hence need not hold in an arbitrary algebra. For instance, if $M$ is the free monoid on a…

Logic in Computer Science · Computer Science 2023-09-28 Jonathan Sterling

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

In this paper we define intensional models for the classical theory of types, thus arriving at an intensional type logic ITL. Intensional models generalize Henkin's general models and have a natural definition. As a class they do not…

Logic · Mathematics 2007-05-23 Reinhard Muskens

We describe a non-extensional variant of Martin-L\"of type theory which we call two-dimensional type theory, and equip it with a sound and complete semantics valued in 2-categories.

Logic · Mathematics 2011-10-17 Richard Garner

Algebraic theories with dependency between sorts form the structural core of Martin-L\"of type theory and similar systems. Their denotational semantics are typically studied using categorical techniques; many different categorical…

Category Theory · Mathematics 2024-12-31 Benedikt Ahrens , Peter LeFanu Lumsdaine , Paige Randall North

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

The main objective of this work is to study mathematical properties of computational paths. Originally proposed by de Queiroz \& Gabbay (1994) as `sequences or rewrites', computational paths are taken to be terms of the identity type of…

Logic in Computer Science · Computer Science 2016-09-09 Arthur F. Ramos , Ruy J. G. B. de Queiroz , Anjolina G. de Oliveira

A new algebraic treatment of dependent type theory is proposed using ideas derived from topos theory and algebraic set theory.

Category Theory · Mathematics 2025-05-19 Steve Awodey

Martin-L\"of's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive…

Logic in Computer Science · Computer Science 2008-02-03 Lawrence C. Paulson

This is the fourth in a series of papers extending Martin-L\"of's meaning explanation of dependent type theory to higher-dimensional types. In this installment, we show how to define cubical type systems supporting a general schema of…

Logic in Computer Science · Computer Science 2018-07-20 Evan Cavallo , Robert Harper

In this paper we combine the principled approach to modalities from multimodal type theory (MTT) with the computationally well-behaved realization of identity types from cubical type theory (CTT). The result -- cubical modal type theory…

Logic in Computer Science · Computer Science 2024-12-18 Frederik Lerbjerg Aagaard , Magnus Baunsgaard Kristensen , Daniel Gratzer , Lars Birkedal

We give a model of set theory based on multisets in homotopy type theory. The equality of the model is the identity type. The underlying type of iterative sets can be formulated in Martin-L\"of type theory, without Higher Inductive Types…

Logic · Mathematics 2020-07-08 Håkon Robbestad Gylterud

Grothendieck toposes, and by extension, logical theories, can be represented by topological structures. Butz and Moerdijk showed that every topos with enough points can be represented as the topos of sheaves on an open topological groupoid.…

Category Theory · Mathematics 2024-08-28 Joshua Wrigley

As the groupoid model of Hofmann and Streicher proves, identity proofs in intensional Martin-L\"of type theory cannot generally be shown to be unique. Inspired by a theorem by Hedberg, we give some simple characterizations of types that do…

Logic in Computer Science · Computer Science 2019-03-14 Nicolai Kraus , Martín Escardó , Thierry Coquand , Thorsten Altenkirch
‹ Prev 1 2 3 10 Next ›