CBPV tutorial - part 1/2

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

• Paul Levy (University of Birmingham)
• Tuesday 10 January 2012, 12:00-13:00
• CS 217.

If you have a question about this talk, please contact Dan Ghica.

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.

The slides for this tutorial are available athttp://www.cs.bham.ac.uk/~pbl/papers/cbpvefftt.pdf .

This talk is part of the Lab Lunch series.

This talk is included in these lists:

• CS 217
• Lab Lunch

Note that ex-directory lists are not shown.