Parameterized Notions of Computation Export

@inproceedings{citeulike:2283383, abstract = {Moggi's Computational Monads and Power et al's equivalent notion of Freyd category have captured a large range of computational effects present in programming languages such as exceptions, side-effects, input/output and continuations. We present generalisations of both constructs, which we call parameterised monads and parameterised Freyd categories, that also capture computational effects with parameters. Examples of such are composable continuations, side-effects where the type of the state varies and input/output where the range of inputs and outputs varies. By also considering monoidal parameterisation, we extend the range of effects to cover separated side-effects and multiple independent streams of I/O. We also present two typed λ-calculi that soundly and completely model our categorical definitions — with and without monoidal parameterisation — and act as prototypical languages with parameterised effects.}, author = {Atkey, Robert}, booktitle = {MSFP 2006}, citeulike-article-id = {2283383}, citeulike-linkout-0 = {http://homepages.inf.ed.ac.uk/ratkey/param-notions.pdf}, journal = {Proceedings of Workshop on Mathematically Structured Functional Programming}, keywords = {category-theory, monads, monoidal-categories, notions-of-computation}, month = {July}, posted-at = {2008-01-24 06:03:43}, priority = {0}, title = {Parameterized Notions of Computation}, url = {http://homepages.inf.ed.ac.uk/ratkey/param-notions.pdf}, year = {2006} }

TY - CONF ID - citeulike:2283383 L3 - citeulike-article-id:2283383 N2 - Moggi’s Computational Monads and Power et al’s equivalent notion of Freyd category have captured a large range of computational effects present in programming languages such as exceptions, side-effects, input/output and continuations. We present generalisations of both constructs, which we call parameterised monads and parameterised Freyd categories, that also capture computational effects with parameters. Examples of such are composable continuations, side-effects where the type of the state varies and input/output where the range of inputs and outputs varies. By also considering monoidal parameterisation, we extend the range of effects to cover separated side-effects and multiple independent streams of I/O. We also present two typed λ-calculi that soundly and completely model our categorical definitions — with and without monoidal parameterisation — and act as prototypical languages with parameterised effects. JF - Proceedings of Workshop on Mathematically Structured Functional Programming TI - Parameterized Notions of Computation T2 - MSFP 2006 KW - category-theory KW - monads KW - monoidal-categories KW - notions-of-computation AU - Atkey, Robert PY - 2006/07// UR - http://homepages.inf.ed.ac.uk/ratkey/param-notions.pdf ER -