Modeling a Practical Combination of Delimited Continuations, Exceptions, Dynamic-Wind Guards, Dynamic Binding, and Stack Inspection

Add to your list(s) Download to your calendar using vCal

• Matthew Flatt, University of Utah
• Friday 23 May 2014, 16:00-17:00
• Room FW26, Computer Laboratory, William Gates Building.

If you have a question about this talk, please contact Jonathan Hayman.

Racket was one of the first production programming languages to provide delimited and composable continuations out of the box. Continuations interact with many other control constructs that were already in Racket, and those interactions had to be considered and specified precisely. In this talk, I’ll present a model of delimited continuations and other control constructs using a graphical intuition that maps directly to reduction rules. I’ll also briefly explain how we used the model to drive random testing of the implementation and uncover several bugs.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computing and Mathematics
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• Logic and Semantics Seminar (Computer Laboratory)
• Room FW26, Computer Laboratory, William Gates Building
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• tcw57’s list
• yk373's list

Note that ex-directory lists are not shown.