English

Building on the Diamonds between Theories: Theory Presentation Combinators

Logic in Computer Science 2019-12-02 v2 Category Theory

Abstract

To build a large library of mathematics, it seems more efficient to take advantage of the inherent structure of mathematical theories. Various theory presentation combinators have been proposed, and some have been implemented, in both legacy and current systems. Surprisingly, the ``standard library'' of most systems do not make pervasive use of these combinators. We present a set of combinators optimized for reuse, via the tiny theories approach. Our combinators draw their power from the inherent structure already present in the \emph{category of contexts} associated to a dependently typed language. The current work builds on ideas originating in CLEAR and Specware and their descendents (both direct and intellectual). Driven by some design criteria for user-centric library design, our library-building experience via the systematic use of combinators has fed back into the semantics of these combinators, and later into an updated syntax for them.

Keywords

Cite

@article{arxiv.1812.08079,
  title  = {Building on the Diamonds between Theories: Theory Presentation Combinators},
  author = {Jacques Carette and Russell O'Connor and Yasmine Sharoda},
  journal= {arXiv preprint arXiv:1812.08079},
  year   = {2019}
}

Comments

Extended version of paper with a similar title at CICM 2012, also listed as arXiv:1204.0053. Submitted to a journal. Almost the entire article has been rewritten

R2 v1 2026-06-23T06:48:07.459Z