Call-by-push-value (part 1)

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

• Paul Levy, University of Birmingham (visiting Cambridge until March 15)
• Tuesday 03 February 2009, 16:15-17:00
• Room FW26, Computer Laboratory, William Gates Building.

If you have a question about this talk, please contact Sam Staton.

This is the first part of a two-part series. Part 2 is on Wed 4th Feb.

Call-by-push-value is a calculus for computational effects that provides fine-grain primitives into which both call-by-value and call-by-name calculi can be decomposed. This decomposition appears in a wide variety of semantics: operational, domains, state, continuations, games, possible worlds, etc.

We first look at semantics of call-by-value and call-by-name, using algebras for a monad, and see how that leads us to call-by-push-value.

We then look at two examples of call-by-push-value semantics that do not use algebras: state (global ground) and continuations.

This talk is part of the Mini Courses in Theoretical Computer Science series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• All transferable skills in the university: computing
• Computer Laboratory talks
• Computer Laboratory, William Gates Building, Room FW26
• Computing and Mathematics
• Logic and Semantics Seminar (Computer Laboratory)
• Mini Courses in Theoretical Computer Science
• Modelling Biology
• Room FW26, Computer Laboratory, William Gates Building
• School of Technology

Note that ex-directory lists are not shown.