TY - GEN
T1 - A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine
AU - Melliès, Paul André
AU - Zeilberger, Noam
N1 - Publisher Copyright:
© 2016 ACM.
PY - 2016/7/5
Y1 - 2016/7/5
N2 - Combining insights from the study of type refinement systems and of monoidal closed chiralities, we show how to reconstruct Lawvere's hyperdoctrine of presheaves using a full and faithful embedding into a monoidal closed bifibration living now over the compact closed category of small categories and distributors. Besides revealing dualities which are not immediately apparent in the traditional presentation of the presheaf hyperdoctrine, this reconstruction leads us to an axiomatic treatment of directed equality predicates (modelled by hom presheaves), realizing a vision initially set out by Lawvere (1970). It also leads to a simple calculus of string diagrams (representing presheaves) that is highly reminiscent of C. S. Peirce's existential graphs for predicate logic, refining an earlier interpretation of existential graphs in terms of Boolean hyperdoctrines by Brady and Trimble. Finally, we illustrate how this work extends to a bifibrational setting a number of fundamental ideas of linear logic.
AB - Combining insights from the study of type refinement systems and of monoidal closed chiralities, we show how to reconstruct Lawvere's hyperdoctrine of presheaves using a full and faithful embedding into a monoidal closed bifibration living now over the compact closed category of small categories and distributors. Besides revealing dualities which are not immediately apparent in the traditional presentation of the presheaf hyperdoctrine, this reconstruction leads us to an axiomatic treatment of directed equality predicates (modelled by hom presheaves), realizing a vision initially set out by Lawvere (1970). It also leads to a simple calculus of string diagrams (representing presheaves) that is highly reminiscent of C. S. Peirce's existential graphs for predicate logic, refining an earlier interpretation of existential graphs in terms of Boolean hyperdoctrines by Brady and Trimble. Finally, we illustrate how this work extends to a bifibrational setting a number of fundamental ideas of linear logic.
KW - Lawvere's presheaf hyperdoctrine
KW - linear logic
KW - monoidal closed bifibrations
KW - monoidal closed chiralities
KW - type refinement systems
U2 - 10.1145/2933575.2934525
DO - 10.1145/2933575.2934525
M3 - Conference contribution
AN - SCOPUS:84994633796
T3 - Proceedings - Symposium on Logic in Computer Science
SP - 555
EP - 564
BT - Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science, LICS 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2016
Y2 - 5 July 2016 through 8 July 2016
ER -