![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Simon Forest, University of Aix-Marseille
Friday 26 November 2021, 14:00-15:00
A computational method for left adjointness
- đ¤ Speaker: Simon Forest, University of Aix-Marseille
- đ Date & Time: Friday 26 November 2021, 14:00 - 15:00
- đ Venue: FW26
Abstract
Recently, several computational tools have been proposed for higher categories, like CaTT, Globular, cateq, etc. Paradoxically, fewer tools exist for more common 1-categories. A reason for this might be that the computational problems on 1-categories, expressed using generators and relations, do not appear as interesting as the ones on higher dimensional categories. In this talk, an alternative computational framework for 1-categories is proposed, which enables working with large categories like the categories of sets, groups, etc. As an application, a computational method for proving that (some) functors between such categories are left adjoint is introduced. In good cases, this method is fully automated as will be shown on several examples.
Series This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computing and Mathematics
- Department of Computer Science and Technology talks and seminars
- FW26
- Interested Talks
- Logic and Semantics Seminar (Computer Laboratory)
- Martin's interesting talks
- School of Technology
- tcw57âs list
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.