Theory Presentation Combinators

by   Jacques Carette, et al.
McMaster University

To build a scalable library of mathematics, we need a method which takes advantage of the inherent structure of mathematical theories. Here we argue that theory presentation combinators are a helpful tool towards that quest. We motivate our choice of combinators, and give them precise semantics. We observe that the category of contexts plays a fundamental rôle (explicitly or otherwise) in all such developments, so we will examine its structure carefully. In particular, as it is a fibered category, cartesian liftings are pervasive. While our original work was based on experience and intuition, this work is firmly grounded in categorical semantics, and has resulted in a much cleaner and more powerful set of theory presentation combinators.


page 1

page 2

page 3

page 4


Functorial Semantics for Relational Theories

We introduce the concept of Frobenius theory as a generalisation of Lawv...

Equivariant ZFA and the foundations of nominal techniques

We give an accessible presentation to the foundations of nominal techniq...

The Theory of Call-by-Value Solvability (long version)

The denotational semantics of the untyped lambda-calculus is a well deve...

Automated Reasoning and Presentation Support for Formalizing Mathematics in Mizar

This paper presents a combination of several automated reasoning and pro...

Proceedings Applied Category Theory 2019

Applied Category Theory is a new conference series. All papers are caref...

Proof-relevant Category Theory in Agda

The generality and pervasiness of category theory in modern mathematics ...

idris-ct: A Library to do Category Theory in Idris

We introduce idris-ct, a Idris library providing verified type definitio...

Please sign up or login with your details

Forgot password? Click here to reset