Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

CADE
2006
Springer

favoriteEmaildiscussreport

112views Logical Reasoning» more CADE 2006»

Automating Proofs in Category Theory

14 years 4 months ago

Automating Proofs in Category Theory

Download www.nuprl.org

Abstract. 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.

Dexter Kozen, Christoph Kreitz, Eva Richter

Real-time Traffic

Automated Reasoning | Basic Category-theoretic Reasoning | CADE 2006 | First-order Sequent Calculus | Functor Categories Fun[c |

claim paper

Related Content

» Anaphora and Quantification in Categorial Grammar

» A3PAT an approach for certified automated termination proofs

» From Proof Nets to the Free Autonomous Category

» A Computational Approach to Pocklington Certificates in Type Theory

» Normal Form Results for Default Logic

» A Proof Theory for Generic Judgments An extended abstract

» Clickn Prove Interactive Proofs within Set Theory

» Automated Proof Construction in Type Theory Using Resolution

» Synthetic Domain Theory in Type Theory Another Logic of Computable Functions

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2006
Where	CADE
Authors	Dexter Kozen, Christoph Kreitz, Eva Richter

Comments (0)