BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:A computational method for left adjointness - Simon Forest\, Unive
 rsity of Aix-Marseille
DTSTART:20211126T140000Z
DTEND:20211126T150000Z
UID:TALK163930@talks.cam.ac.uk
CONTACT:Jamie Vicary
DESCRIPTION:Recently\, several computational tools have been proposed for 
 higher categories\, like CaTT\, Globular\, cateq\, etc. Paradoxically\, fe
 wer tools exist for more common 1-categories. A reason for this might be t
 hat the computational problems on 1-categories\, expressed using generator
 s and relations\, do not appear as interesting as the ones on higher dimen
 sional categories. In this talk\, an alternative computational framework f
 or 1-categories is proposed\, which enables working with large categories 
 like the categories of sets\, groups\, etc. As an application\, a computat
 ional 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.
LOCATION:FW26
END:VEVENT
END:VCALENDAR