BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Datatypes as algebras - Philip Saville (University of Cambridge)
DTSTART:20161125T104500Z
DTEND:20161125T114500Z
UID:TALK69380@talks.cam.ac.uk
CONTACT:Ian Orton
DESCRIPTION:Datatypes like Nat\, List\, Tree\,... are constructed in a sim
 ilar way: inductively according to some constructors. How can we understan
 d these constructions in a uniform way? One solution is the simple categor
 y-theoretic idea of an algebra. This idea can be used to capture not just 
 lists and trees\, but also much more general notions like the abstract syn
 tax of a type system. I will introduce algebras and show why they are good
  models of structure\, and show how properties like induction principles a
 rise naturally out of this perspective. (The only category theory assumed 
 will be the idea of a category and a functor). 
LOCATION:Rainbow Room (FS07)\, Computer Laboratory
END:VEVENT
END:VCALENDAR