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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

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

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Herchel Smith Building, Addenbrooke's Site LT17 Faculty of Law, 10 West Road, Cambridge Cavendish Quantum Colloquium

Other talks

CSAR lecture: In a post-Ozempic world, have we cured obesity? Kirk Public Lecture: Title TBC Talk TBC Packing the Border: Quail Crates and the Regulation of Animal Movement on the US-Mexico Border, 1910s-1940s Together Now: Cooperation and Collaboration in Social Art Practice Title to be confirmed
 

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