BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Modeling a Practical Combination of Delimited Continuations\,  Exc
 eptions\, Dynamic-Wind Guards\, Dynamic Binding\, and Stack Inspection - M
 atthew Flatt\, University of Utah
DTSTART:20140523T150000Z
DTEND:20140523T160000Z
UID:TALK52407@talks.cam.ac.uk
CONTACT:Jonathan Hayman
DESCRIPTION:Racket was one of the first production programming languages t
 o provide\ndelimited and composable continuations out of the box. Continua
 tions\ninteract with many other control constructs that were already in\nR
 acket\, and those interactions had to be considered and specified\nprecise
 ly. In this talk\, I'll present a model of delimited\ncontinuations and ot
 her control constructs using a graphical intuition\nthat maps directly to 
 reduction rules. I'll also briefly explain how we\nused the model to drive
  random testing of the implementation and\nuncover several bugs.\n
LOCATION:Room FW26\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR