BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Learning regular languages over infinite alphabets - Alexandra Sil
 va\, University College London
DTSTART:20160715T130000Z
DTEND:20160715T140000Z
UID:TALK66273@talks.cam.ac.uk
CONTACT:Dominic Mulligan
DESCRIPTION:We present an Angluin-style algorithm to learn nominal automat
 a\, which are acceptors of languages over infinite (structured) alphabets.
  We discuss several optimizations to the naive algorithm and provide an im
 plementation using a recently developed Haskell library for nominal comput
 ation.
LOCATION:FW26
END:VEVENT
END:VCALENDAR