Theory presentation combinators

Authors:
Jacques Carette;Russell O'Connor
Affiliations:
Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada;Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada
Venue:
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Year:
2012

Citing 11
Cited 0

Constructing specification morphisms

Journal of Symbolic Computation - Special issue on automatic programming
Detecting equivalence of modular specifications with categorical diagrams

Theoretical Computer Science
A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals

TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
The Semantics of CLEAR, A Specification Language

Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
Little Theories

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
High-Level Theories

Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Packaging Mathematical Structures

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Putting theories together to make specifications

IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
Some considerations on the usability of interactive provers

AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
On duplication in mathematical repositories

AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Multi-stage programming with functors and monads: Eliminating abstraction overhead from generic code

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We motivate and give semantics to theory presentation combinators as the foundational building blocks for a scalable library of theories. The key observation is that the category of contexts and fibered categories are the ideal theoretical tools for this purpose.