University of Cambridge > Talks.cam > SANDWICH Seminar (Computer Laboratory) > On the Operational Theory of the CPS-Calculus

  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

On the Operational Theory of the CPS-Calculus

Download to your calendar using vCal

If you have a question about this talk, please contact Ariadne Si Suo .

The continuation-passing style translation often employed by compilers gives rise to a class of intermediate representation languages where functions are not allowed to return anymore. Though their primary use is to expose details about a program’s control flow, they may be equipped with an equational theory in order to be seen as specialized calculi. In this talk, we explore Thielecke’s CPS -calculus, a small theory of continuations inspired by compiler implementations, and present ongoing work on its metatheory, aiming to improve the development of formally checked compilers and type-directed optimization.

This talk is part of the SANDWICH Seminar (Computer Laboratory) series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Average on weekdays: 8972.01485149 kWh Cambridge University Geographical Society (CUGS) talks Computer Lab, TBD

Other talks

Cooperation as a Laboratory of Being Optimal metric and approximation of free boundary minimal surfaces Group Presentation 1 Afternoon Break Emergency Medicine and Metabolic Medicine Talk title TBC
 

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