-
Notifications
You must be signed in to change notification settings - Fork 6
Abstracts.2019.CwFs
Fabian edited this page Jan 23, 2020
·
6 revisions
by Peter Dybjer
We show how the categorical logic of untyped, simply typed and dependently typed lambda calculus can be structured around the notion of category with families (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.
This is joint work with Simon Castellan, IRISA Rennes and Pierre Clairambault, ENS Lyon.