![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Paul Levy, University of Birmingham (visiting Cambridge until March 15)
Wednesday 04 February 2009, 16:15-17:00
Call-by-push-value (part 2)
- 👤 Speaker: Paul Levy, University of Birmingham (visiting Cambridge until March 15)
- 📅 Date & Time: Wednesday 04 February 2009, 16:15 - 17:00
- 📍 Venue: Room FW26, Computer Laboratory, William Gates Building
Abstract
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 .
Series This talk is part of the Mini Courses in Theoretical Computer Science series.
Included in Lists
- All Talks (aka the CURE list)
- All transferable skills in the university: computing
- bld31
- Cambridge talks
- Computing and Mathematics
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Logic and Semantics Seminar (Computer Laboratory)
- Martin's interesting talks
- Mini Courses in Theoretical Computer Science
- Modelling Biology
- Room FW26, Computer Laboratory, William Gates Building
- School of Technology
- tcw57’s list
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.