BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:A Collapsible Approach to Higher Order Verification - Matthew Hagu
 e\, Royal Holloway University of London
DTSTART:20140522T140000Z
DTEND:20140522T150000Z
UID:TALK52572@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:Higher-order features are becoming increasingly commonplace in
  industrial programming languages\, e.g. the introduction of lambda expres
 sions to C++\, the\npopularity of Scala\, or the understated appearance of
  functions as data in scripting languages such as Python.  My research has
  focussed on extending\nautomata-based verification techniques to be able 
 to reason about higher-order function calls.\n\nI will give an overview of
  the kinds of automata we use\, and how they relate to higher-order progra
 ms\, and give an overview of the current state of the art in\nverification
  tools for higher-order programs.  I will then consider the introduction o
 f concurrent features to higher-order programs\, and describe the\nkinds o
 f approaches taken so far.\n
LOCATION:Auditorium\, Microsoft Research Ltd\, 21 Station Road\, Cambridge
 \, CB1 2FB
END:VEVENT
END:VCALENDAR