The Sequential Semantics of Producer Effect Systems
You need Flash to view this presentation. However, if you are using an iPhone or the like, you can watch this presentation here (it takes a few seconds to buffer).

Created using PowerPoint 2010.
Converted using Avidemux.
Embedded using JW Player 5.6.

The Sequential Semantics of Producer Effect Systems

POPL 2013: [pdf] [bibtex] [pptx] [mp4]

Technical Report: [pdf] [bibtex]

Author: Ross Tate

Abstract

Effects are fundamental to programming languages. Even the lambda calculus has effects, and consequently the two famous evaluation strategies produce different semantics. As such, much research has been done to improve our understanding of effects. Since Moggi introduced monads for his computational lambda calculus, further generalizations have been designed to formalize increasingly complex computational effects, such as indexed monads followed by layered monads followed by parameterized monads. This succession prompted us to determine the most general formalization possible. In searching for this formalization we came across many surprises, such as the insufficiencies of arrows, as well as many unexpected insights, such as the importance of considering an effect as a small component of a whole system rather than just an isolated feature. In this paper we present our semantic formalization for producer effect systems, which we call a productor, and prove its maximal generality by focusing on only sequential composition of effectful computations, consequently guaranteeing that the existing monadic techniques are specializations of productors.

Questions, Comments, and Suggestions

If you have any questions, comments, or suggestions, please e-mail me. I would be glad to know of any opinions people have or any clarifications I should make.