Repository logo
 

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

Accepted version
Peer-reviewed

Loading...
Thumbnail Image

Change log

Abstract

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.

Description

Journal Title

Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science

Conference Name

Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science

Journal ISSN

Volume Title

Publisher

Association for Computing Machinery (ACM)

Rights and licensing

Except where otherwised noted, this item's license is described as All rights reserved