Automating Proofs In Category Theory - International Conference IJCAR-2006

unofficial copies [PDF], [PS]

by Christoph Kreitz, Dexter Kozen and Eva Richter

Lecture notes in Artificial Intelligence 4130, Springer, 2006


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[CxD,E] and Fun[C,Fun[D,E]] are naturally isomorphic.