Proof-relevant Category Theory in Agda

05/14/2020
by   Jason Z. S. Hu, et al.
0

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, in particular so that the library integrates well with Agda's own standard library, as well as supporting as many of the modes of Agda as possible.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/15/2018

Formalizing Category Theory and Presheaf Models of Type Theory in Nuprl

This article is the first in a series of articles that explain the forma...
research
02/17/2021

Formalizing relations in type theory

Type theory plays an important role in foundations of mathematics as a f...
research
06/15/2023

Category Theory in Isabelle/HOL as a Basis for Meta-logical Investigation

This paper presents meta-logical investigations based on category theory...
research
01/31/2018

Call-by-name Gradual Type Theory

We present gradual type theory, a logic and type theory for call-by-name...
research
12/14/2018

Theory Presentation Combinators

To build a scalable library of mathematics, we need a method which takes...
research
11/25/2019

idris-ct: A Library to do Category Theory in Idris

We introduce idris-ct, a Idris library providing verified type definitio...
research
01/10/2019

Mechanization of Separation in Generic Extensions

We mechanize, in the proof assistant Isabelle, a proof of the axiom-sche...

Please sign up or login with your details

Forgot password? Click here to reset