BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Profunctors and coends - Philip Saville (University of Cambridge)
DTSTART:20160408T100000Z
DTEND:20160408T110000Z
UID:TALK65943@talks.cam.ac.uk
CONTACT:Ian Orton
DESCRIPTION:A profunctor (also called a distributor or a correspondence) i
 s a functor of two variables F : C x C' --> Set\, contravariant in one arg
 ument and covariant in the other. I will introduce the (bi)category Prof o
 f profunctors\, and work through their composition and unit structure in s
 ome detail: although the notation looks somewhat formidable\, I hope to sh
 ow that they are actually quite easy to reason with.\n\nTopics covered:\n-
  definition of profunctors\, the bicategory Prof\n- Yoneda reduction for c
 omputing coends\n- profunctor composition and identities\n\nPrerequisites:
 \n- a vague memory of coends and Kan extensions will be useful\, but not n
 ecessary\n- familiarity with functors and other standard categorical defin
 itions 
LOCATION:Rainbow Room (FS07)\, Computer Laboratory
END:VEVENT
END:VCALENDAR