University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Modeling a Practical Combination of Delimited Continuations, Exceptions, Dynamic-Wind Guards, Dynamic Binding, and Stack Inspection

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

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity