Repository logo
 

A type theory for cartesian closed bicategories

Accepted version
Peer-reviewed

Type

Conference Object

Change log

Authors

Fiore, Marcelo 

Abstract

We construct an internal language for cartesian closed bicategories. Precisely, we introduce a type theory modelling the structure of a cartesian closed bicategory and show that its syntactic model satisfies an appropriate universal property, thereby lifting the Curry-Howard-Lambek correspondence to the bicategorical setting. Our approach is principled and practical. Weak substitution structure is constructed using a bicategorification of the notion of abstract clone from universal algebra, and the rules for products and exponentials are synthesised from semantic considerations. The result is a type theory that employs a novel combination of 2-dimensional type theory and explicit substitution, and directly generalises the Simply-Typed Lambda Calculus. This work is the first step in a programme aimed at proving coherence for cartesian closed bicategories.

Description

Keywords

typed lambda calculus, higher category theory, Curry-Howard-Lambek correspondence, cartesian closed bicategories

Journal Title

2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

Conference Name

Logic in Computer Science (LiCS)

Journal ISSN

1043-6871

Volume Title

Publisher

IEEE

Rights

All rights reserved
Sponsorship
EPSRC (1649725)