Data structures for quasistrict higher categories
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Authors
Colleges, School and Institutes
External organisations
- University of Oxford
Abstract
We present new data structures for quasistrict higher categories, in which associativity and unit laws hold strictly. Our approach has low axiomatic complexity compared to traditional algebraic approaches, and gives a practical method for performing calculations in quasistrict 4-categories. It is amenable to computer implementation, and we exploit this to give a machine-verified algebraic proof that every adjunction of 1-cells in a quasistrict 4-category can be promoted to a coherent adjunction satisfying the butterfly equations.
Details
| Original language | English |
|---|---|
| Title of host publication | Proceedings of 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017) |
| Publication status | Published - 18 Aug 2017 |
| Event | 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017) - Reykjavik, Iceland Duration: 20 Jun 2017 → 23 Jun 2017 |
Conference
| Conference | 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017) |
|---|---|
| Country | Iceland |
| City | Reykjavik |
| Period | 20/06/17 → 23/06/17 |