Categories with Families: Unityped, Simply Typed, and Dependently Typed
Preprint, 2019

We show how the categorical logic of untyped, simply typed and dependently typed lambda calculus can be structured around the notion of category with family (cwf). To this end we introduce subcategories of simply typed cwfs (scwfs), where types do not depend on variables, and unityped cwfs (ucwfs), where there is only one type. We prove several equivalence and biequivalence theorems between cwf-based notions and basic notions of categorical logic, such as cartesian operads, Lawvere theories, categories with finite products and limits, cartesian closed categories, and locally cartesian closed categories. Some of these theorems depend on the restrictions of contextuality (in the sense of Cartmell) or democracy (used by Clairambault and Dybjer for their biequivalence theorems). Some theorems are equivalences between notions with strict preservation of chosen structure. Others are biequivalences between notions where properties are only preserved up to isomorphism. In addition to this we discuss various constructions of initial ucwfs, scwfs, and cwfs with extra structure.


Simon Castellan

Ecole Normale Superieure de Lyon

Pierre Clairambault

Ecole Normale Superieure de Lyon

Peter Dybjer

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

Proof theory and higher categorical semantics of homotopy type theory

Swedish Research Council (VR), 2020-01-01 -- 2023-12-31.

Subject Categories

Algebra and Logic

Computer and Information Science

Areas of Advance

Information and Communication Technology


Basic sciences

More information

Latest update