In this paper, we present a category theory library developed in the proof assistant Coq. We discuss the design principles of the library in comparison with those existing out there. To explicitly demonstrate the utility of the library, we conclude with a case study in which a Coq formalized soundness proof of the intuitionistic propositional logic within a category theoretical settings is examined.
Categorical logic, denotational semantics of programming constructs, formal proofs, the Coq proof assistant
"Formal categorical reasoning,"
Turkish Journal of Mathematics: Vol. 46:
4, Article 31.
Available at: https://journals.tubitak.gov.tr/math/vol46/iss4/31