Automating Proofs in Category Theory [chapter]

Dexter Kozen, Christoph Kreitz, Eva Richter
2006 Lecture Notes in Computer Science  
We introduce a semi-automated proof system for basic category-theoretic reasoning. It is based on a first-order sequent calculus that captures the basic properties of categories, functors and natural transformations as well as a small set of proof tactics that automate proof search in this calculus. We demonstrate our approach by automating the proof that the functor categories Fun[C × D, E] and Fun [C, Fun[D, E]] are naturally isomorphic.
doi:10.1007/11814771_34 fatcat:uqvwhp6e4jfalayvsdphusfqoy