Experience Implementing a Performant Category-Theory Library in Coq

  • Jason Gross
  • Adam Chlipala
  • David I. Spivak
Conference paper

DOI: 10.1007/978-3-319-08970-6_18

Volume 8558 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Gross J., Chlipala A., Spivak D.I. (2014) Experience Implementing a Performant Category-Theory Library in Coq. In: Klein G., Gamboa R. (eds) Interactive Theorem Proving. ITP 2014. Lecture Notes in Computer Science, vol 8558. Springer, Cham

Abstract

We describe our experience implementing a broad category-theory library in Coq. Category theory and computational performance are not usually mentioned in the same breath, but we have needed substantial engineering effort to teach Coq to cope with large categorical constructions without slowing proof script processing unacceptably. In this paper, we share the lessons we have learned about how to represent very abstract mathematical objects and arguments in Coq and how future proof assistants might be designed to better support such reasoning. One particular encoding trick to which we draw attention allows category-theoretic arguments involving duality to be internalized in Coq’s logic with definitional equality. Ours may be the largest Coq development to date that uses the relatively new Coq version developed by homotopy type theorists, and we reflect on which new features were especially helpful.

Keywords

Coq category theory homotopy type theory duality performance 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Jason Gross
    • 1
  • Adam Chlipala
    • 1
  • David I. Spivak
    • 1
  1. 1.Massachusetts Institute of TechnologyCambridgeUSA