Reference. Coherence for bicategorical cartesian closed structure

We prove a strictification theorem for cartesian closed bicategories. First, we adapt Power’s proof of coherence for bicategories with finite bilimits to show that every bicategory with bicategorical cartesian closed structure is biequivalent to a 2-category with 2-categorical cartesian closed structure. Then we show how to extend this result to a Mac Lane-style “all pasting diagrams commute” coherence theorem: precisely, we show that in the free cartesian closed bicategory on a graph, there is at most one 2-cell between any parallel pair of 1-cells. The argument we employ is reminiscent of that used by Čubrić, Dybjer, and Scott to show normalisation for the simply-typed lambda calculus (Čubrić et al., 1998). The main results first appeared in a conference paper (Fiore and Saville, 2020) but for reasons of space many details are omitted there; here we provide the full development.

Cite

Cite as @fiore-2021-coherence (helia, typst) · \cite{fiore-2021-coherence} (LaTeX)
BibTeX
bibtex · 1 line
@article{fiore-2021-coherence, title={Coherence for bicategorical cartesian closed structure}, volume={31}, ISSN={1469-8072}, url={http://dx.doi.org/10.1017/s0960129521000281}, DOI={10.1017/s0960129521000281}, number={7}, journal={Mathematical Structures in Computer Science}, publisher={Cambridge University Press (CUP)}, author={Fiore, Marcelo and Saville, Philip}, year={2021}, month=Aug, pages={822–849} }
hayagriva YAML (typst)
yaml · 18 lines
fiore-2021-coherence:
  type: article
  title: Coherence for bicategorical cartesian closed structure
  author:
  - Fiore, Marcelo
  - Saville, Philip
  date: 2021-08
  page-range: 822-849
  url: http://dx.doi.org/10.1017/s0960129521000281
  serial-number:
    doi: 10.1017/s0960129521000281
    issn: 1469-8072
  parent:
    type: periodical
    title: Mathematical Structures in Computer Science
    publisher: Cambridge University Press (CUP)
    issue: 7
    volume: 31
Cites 46 works (5 here)
With notes (5)

Coherence and normalisation-by-evaluation for bicategorical cartesian closed structure fiore_saville_2020

We present two proofs of coherence for cartesian closed bicategories. Precisely, we show that in the free cartesian closed bicategory on a set of objects there is at most one structural 2-cell between any parallel pair of 1-cells. We thereby reduce the difficulty of constructing structure in arbitrary cartesian closed bicategories to the level of 1-dimensional category theory. Our first proof follows a traditional approach using the Yoneda lemma. For the second proof, we adapt Fiore’s categorical analysis of normalisation-by-evaluation for the simply-typed lambda calculus. Modulo the construction of suitable bicategorical structures, the argument is not significantly more complex than its 1-categorical counterpart. It also opens the way for further proofs of coherence using (adaptations of) tools from categorical semantics.
DOI

Normalization and the Yoneda embedding NormalizationAndTheYonedaEmbedding

We show how to solve the word problem for simply typed λβη-calculus by using a few well-known facts about categories of presheaves and the Yoneda embedding. The formal setting for these results is 𝒫-category theory, a version of ordinary category theory where each hom-set is equipped with a partial equivalence relation. The part of 𝒫-category theory we develop here is constructive and thus permits extraction of programs from proofs. It is important to stress that in our method we make no use of traditional proof-theoretic or rewriting techniques. To show the robustness of our method, we give an extended treatment for more general λ-theories in the Appendix.
DOI

Two-dimensional monad theory blackwell_kelly_power_1989

Web

A general coherence result power_1989

Introduction to Higher-Order Categorical Logic lambek_scott_1986

Web
External (41)
fiore-2021-coherence reference entries/refs/fiore-2021-coherence/fiore-2021-coherence.hel