Formalizing Category Theory in Agda
The generality and pervasiness of category theory in modern mathematics makes it a frequent and useful target of formalization. It is however quite challenging to formalize, for a variety of reasons. Agda currently (i.e. in 2020) does not have a standard, working formalization of category theory. We document our work on solving this dilemma. The formalization revealed a number of potential design choices, and we present, motivate and explain the ones we picked. In particular, we find that alternative definitions or alternative proofs from those found in standard textbooks can be advantageous, as well as “fit” Agda’s type theory more smoothly. Some definitions regarded as equivalent in standard textbooks turn out to make different “universe level” assumptions, with some being more polymorphic than others. We also pay close attention to engineering issues so that the library integrates well with Agda’s own standard library, as well as being compatible with as many of supported type theories in Agda as possible.
Sun 17 JanDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
18:00 - 18:45 | Logic, Set Theory, and Category TheoryCPP at CPP Chair(s): Yannick Forster Saarland University Streamed session: https://youtu.be/U_ZT9hfDAUQ | ||
18:00 15mTalk | An Anti-Locally-Nameless Approach to Formalizing Quantifiers CPP Olivier Laurent CNRS & ENS Lyon Pre-print Media Attached | ||
18:15 15mTalk | The Generalised Continuum Hypothesis Implies the Axiom of Choice in Coq CPP Pre-print Media Attached | ||
18:30 15mTalk | Formalizing Category Theory in Agda CPP Pre-print Media Attached |