Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Peter LeFanu Lumsdaine is active.

Publication


Featured researches published by Peter LeFanu Lumsdaine.


international conference on typed lambda calculi and applications | 2009

Weak ω-Categories from Intensional Type Theory

Peter LeFanu Lumsdaine

Higher-dimensional categories have recently emerged as a natural context for modelling intensional type theories; this raises the question of what higher-categorical structures the syntax of type theory naturally forms. We show that for any type in Martin-Lof Intensional Type Theory, the system of terms of that type and its higher identity types forms a weak *** -category in the sense of Leinster. Precisely, we construct a contractible globular operad


ACM Transactions on Computational Logic | 2015

The Local Universes Model: An Overlooked Coherence Construction for Dependent Type Theories

Peter LeFanu Lumsdaine; Michael A. Warren

{P_{\mathit{ML}^{\mathrm{Id}}}}


certified programs and proofs | 2017

The HoTT library: a formalization of homotopy type theory in Coq

Andrej Bauer; Jason Gross; Peter LeFanu Lumsdaine; Michael Shulman; Matthieu Sozeau; Bas Spitters

of type-theoretically definable composition laws, and give an action of this operad on any type and its identity types.


Mathematical Structures in Computer Science | 2015

Homotopy limits in type theory

Jeremy Avigad; Krzysztof Kapulkin; Peter LeFanu Lumsdaine

We present a new coherence theorem for comprehension categories, providing strict models of dependent type theory with all standard constructors, including dependent products, dependent sums, identity types, and other inductive types. Precisely, we take as input a “weak model”: a comprehension category, equipped with structure corresponding to the desired logical constructions. We assume throughout that the base category is close to locally Cartesian closed: specifically, that products and certain exponentials exist. Beyond this, we require only that the logical structure should be weakly stable—a pure existence statement, not involving any specific choice of structure, weaker than standard categorical Beck--Chevalley conditions, and holding in the now standard homotopy-theoretic models of type theory. Given such a comprehension category, we construct an equivalent split one whose logical structure is strictly stable under reindexing. This yields an interpretation of type theory with the chosen constructors. The model is adapted from Voevodskys use of universes for coherence, and at the level of fibrations is a classical construction of Giraud. It may be viewed in terms of local universes or delayed substitutions.


logic in computer science | 2016

A Mechanization of the Blakers-Massey Connectivity Theorem in Homotopy Type Theory

Kuen-Bang Hou; Eric Finster; Daniel R. Licata; Peter LeFanu Lumsdaine

We report on the development of the HoTT library, a formalization of homotopy type theory in the Coq proof assistant. It formalizes most of basic homotopy type theory, including univalence, higher inductive types, and significant amounts of synthetic homotopy theory, as well as category theory and modalities. The library has been used as a basis for several independent developments. We discuss the decisions that led to the design of the library, and we comment on the interaction of homotopy type theory with recently introduced features of Coq, such as universe polymorphism and private inductive types.


Journal of Symbolic Logic | 2009

Lawvere-Tierney sheaves in Algebraic Set Theory

Steven Awodey; Nicola Gambino; Peter LeFanu Lumsdaine; Michael A. Warren

Working in homotopy type theory, we provide a systematic study of homotopy limits of diagrams over graphs, formalized in the Coq proof assistant. We discuss some of the challenges posed by this approach to formalizing homotopy-theoretic material. We also compare our constructions with the more classical approach to homotopy limits via fibration categories.


computer science logic | 2017

Categorical Structures for Type Theory in Univalent Foundations.

Benedikt Ahrens; Peter LeFanu Lumsdaine; Vladimir Voevodsky

This paper contributes to recent investigations of the use of homotopy type theory to give machine-checked proofs of constructions from homotopy theory. We present a mechanized proof of a result called the Blakers–Massey connectivity theorem, which relates the higher-dimensional loop structures of two spaces sharing a common part (represented by a pushout type, which is a generalization of a disjoint sum type) to those of the common part itself. This theorem gives important information about the pushout type, and has a number of useful corollaries, including the Freudenthal suspension theorem, which was used in previous formalizations. The proof is more direct than existing ones that apply in general category-theoretic settings for homotopy theory, and its mechanization is concise and high-level, due to novel combinations of ideas from homotopy theory and from type theory.


arXiv: Logic | 2012

The Simplicial Model of Univalent Foundations (after Voevodsky)

Chris Kapulkin; Peter LeFanu Lumsdaine

We present a solution to the problem of defining a counter- part in Algebraic Set Theory of the construction of internal sheaves in Topos Theory. Our approach is general in that we consider sheaves as determined by Lawvere-Tierney coverages, rather than by Grothendieck coverages, and assume only a weakening of the axioms for small maps originally introduced by Joyal and Moerdijk, thus subsuming the exist- ing topos-theoretic results.


arXiv: Logic | 2014

THE SIMPLICIAL MODEL OF UNIVALENT FOUNDATIONS

Krzysztof Kapulkin; Peter LeFanu Lumsdaine; Vladimir Voevodsky

In this paper, we analyze and compare three of the many algebraic structures that have been used for modeling dependent type theories: categories with families, split type-categories, and representable maps of presheaves. We study these in the setting of univalent foundations, where the relationships between them can be stated more transparently. Specifically, we construct maps between the different structures and show that these maps are equivalences under suitable assumptions. We then analyze how these structures transfer along (weak and strong) equivalences of categories, and, in particular, show how they descend from a category (not assumed univalent/saturated) to its Rezk completion. To this end, we introduce relative universes, generalizing the preceding notions, and study the transfer of such relative universes along suitable structure. We work throughout in (intensional) dependent type theory; some results, but not all, assume the univalence axiom. All the material of this paper has been formalized in Coq, over the UniMath library.


arXiv: Algebraic Topology | 2012

Univalence in Simplicial Sets

Chris Kapulkin; Peter LeFanu Lumsdaine; Vladimir Voevodsky

Collaboration


Dive into the Peter LeFanu Lumsdaine's collaboration.

Top Co-Authors

Avatar

Chris Kapulkin

University of Western Ontario

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Michael A. Warren

Carnegie Mellon University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Vladimir Voevodsky

Institute for Advanced Study

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Jeremy Avigad

Carnegie Mellon University

View shared research outputs
Top Co-Authors

Avatar

Steven Awodey

Carnegie Mellon University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Daniel R. Licata

Carnegie Mellon University

View shared research outputs
Researchain Logo
Decentralizing Knowledge