|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Call-by-push-value (part 1)
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:
Note that ex-directory lists are not shown.
Other listsPathology Seminars Tanner Lectures Health
Other talksTo be announced Interplay Between Intrachain and Interchain Interactions in Semiconducting Polymers: “Jekyll-Hyde” Behavior in Common Emissive Polymers Feudalism in the Medieval West: ‘The Tyranny of a Construct’ Mothers' compromise. How NK cells regulate placentation. Provocation and imagination: reading Brazilian Children's literature Exploring transcriptional regulatory elements using functional genomics strategies