University of Cambridge > Talks.cam > Mini Courses in Theoretical Computer Science > Call-by-push-value (part 2)

Call-by-push-value (part 2)

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

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

This is the second part of a two-part series

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 at http://www.cs.bham.ac.uk/~pbl/papers/cbpvefftt.pdf .

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

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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