English
Related papers

Related papers: The Code of Mathematics

200 papers

This is an introductory textbook to univalent mathematics and homotopy type theory, a mathematical foundation that takes advantage of the structural nature of mathematical definitions and constructions. It is common in mathematical practice…

Logic · Mathematics 2022-12-22 Egbert Rijke

Homotopy type theory is a new branch of mathematics, based on a recently discovered connection between homotopy theory and type theory, which brings new ideas into the very foundation of mathematics. On the one hand, Voevodsky's subtle and…

Logic · Mathematics 2013-08-06 The Univalent Foundations Program

Beginning in the 1970s, statistician-cum-logician Per Martin-L\"of wrote a series of papers developing what became Martin-L\"of type theory, realizing a system where the distinction between mathematics and programming disappears. Inspired…

Computation · Statistics 2025-10-14 Bradley Saul

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

Recent discoveries have been made connecting abstract homotopy theory and the field of type theory from logic and theoretical computer science. This has given rise to a new field, which has been christened "homotopy type theory". In this…

Logic · Mathematics 2012-10-23 Álvaro Pelayo , Michael A. Warren

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

In proof theory the notion of canonical proof is rather basic, and it is usually taken for granted that a canonical proof of a sentence must be unique up to certain minor syntactical details (such as, e.g., change of bound variables). When…

Logic in Computer Science · Computer Science 2013-08-07 Ruy J. G. B. de Queiroz , Anjolina G. de Oliveira

We show that a version of Martin-L\"of type theory with an extensional identity type former I, a unit type N1 , Sigma-types, Pi-types, and a base type is a free category with families (supporting these type formers) both in a 1- and a…

Logic in Computer Science · Computer Science 2019-03-14 Simon Castellan , Pierre Clairambault , Peter Dybjer

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

This is the third in a series of papers extending Martin-L\"of's meaning explanations of dependent type theory to a Cartesian cubical realizability framework that accounts for higher-dimensional types. We extend this framework to include a…

Logic in Computer Science · Computer Science 2017-12-06 Carlo Angiuli , Kuen-Bang Hou , Robert Harper

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

A wide range of intuitionistic type theories may be presented as equational theories within a logical framework. This method was formulated by Per Martin-L\"{o}f in the mid-1980's and further developed by Uemura, who used it to prove an…

Logic · Mathematics 2021-06-04 Robert Harper

This dissertation gives an overview of Martin Lof's dependant type theory, focusing on its computational content and addressing a question of possibility of fully canonical and computable semantic presentation.

Logic in Computer Science · Computer Science 2023-08-21 Dmitry Filippov

Pure type systems arise as a generalisation of simply typed lambda calculus. The contemporary development of mathematics has renewed the interest in type theories, as they are not just the object of mere historical research, but have an…

Logic · Mathematics 2014-11-07 Nino Guallart

The usual homogeneous form of equality type in Martin-L\"of Type Theory contains identifications between elements of the same type. By contrast, the heterogeneous form of equality contains identifications between elements of possibly…

Logic in Computer Science · Computer Science 2022-03-15 Andrew M. Pitts

Cubical type theory is an extension of Martin-L\"of type theory recently proposed by Cohen, Coquand, M\"ortberg and the author which allows for direct manipulation of $n$-dimensional cubes and where Voevodsky's Univalence Axiom is provable.…

Logic in Computer Science · Computer Science 2017-10-31 Simon Huber

In this short note we give a glimpse of homotopy type theory, a new field of mathematics at the intersection of algebraic topology and mathematical logic, and we explain Vladimir Voevodsky's univalent interpretation of it. This…

History and Overview · Mathematics 2013-02-20 Steve Awodey , Álvaro Pelayo , Michael A. Warren

The treatment of equality as a type in type theory gives rise to an interesting type-theoretic structure known as `identity type'. The idea is that, given terms $a,b$ of a type $A$, one may form the type $Id_{A}(a,b)$, whose elements are…

Logic in Computer Science · Computer Science 2018-04-27 Arthur Freitas Ramos , Ruy J. G. B. de Queiroz , Anjolina G. de Oliveira

We define a general class of dependent type theories, encompassing Martin-L\"of's intuitionistic type theories and variants and extensions. The primary aim is pragmatic: to unify and organise their study, allowing results and constructions…

Logic · Mathematics 2020-09-14 Andrej Bauer , Philipp G. Haselwarter , Peter LeFanu Lumsdaine

The treatment of equality as a type in type theory gives rise to an interesting type-theoretic structure known as `identity type'. The idea is that, given terms $a,b$ of a type $A$, one may form the type $Id_{A}(a,b)$, whose elements are…

Logic in Computer Science · Computer Science 2018-03-06 Arthur F. Ramos , Ruy J. G. B. de Queiroz , Anjolina G. de Oliveira , Tiago Mendonça Lucena de Veras
‹ Prev 1 2 3 10 Next ›