BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Applicative functors - Dima Szamozvancev
DTSTART:20191108T110000Z
DTEND:20191108T120000Z
UID:TALK134668@talks.cam.ac.uk
CONTACT:Nathanael Arkor
DESCRIPTION:One big critique of functional programming is that the beginne
 r is quickly bombarded with scary-sounding categorical terminology like fu
 nctors and monads. Well\, in 2008\, Conor McBride and Ross Paterson decide
 d to introduce a new abstraction called strong lax monoidal functors into 
 the FP vocabulary\, just to make the situation even worse. Now commonly ca
 lled applicative functors\, they sit neatly between functors and monads in
  the effectful programming abstraction hierarchy\, providing a weaker noti
 on of computation that makes them more widespread than full-fledged monads
 . In this talk I will motivate and introduce applicative functors\, explai
 ning what we gain and lose by constructing programs in an applicative\, ra
 ther than monadic style. I will also present their categorical analogue an
 d how it relates to applicative programming.
LOCATION:Rainbow Room (FS07)\, Computer Laboratory
END:VEVENT
END:VCALENDAR