Comonadic Notions of Computation Export

@article{citeulike:4075281, abstract = {We argue that symmetric (semi)monoidal comonads provide a means to structure context-dependent notions of computation such as notions of dataflow computation (computation on streams) and of tree relabelling as in attribute evaluation. We propose a generic semantics for extensions of simply typed lambda calculus with context-dependent operations analogous to the Moggi-style semantics for effectful languages based on strong monads. This continues the work in the early 90s by Brookes, Geva and Van Stone on the use of computational comonads in intensional semantics.}, address = {Amsterdam, The Netherlands, The Netherlands}, author = {Uustalu, Tarmo and Vene, Varmo}, citeulike-article-id = {4075281}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1380266}, citeulike-linkout-1 = {http://dx.doi.org/10.1016/j.entcs.2008.05.029}, citeulike-linkout-2 = {http://linkinghub.elsevier.com/retrieve/pii/S1571066108003435}, doi = {10.1016/j.entcs.2008.05.029}, issn = {1571-0661}, journal = {Electron. Notes Theor. Comput. Sci.}, keywords = {category-theory, comonad, functional-programming}, number = {5}, pages = {263--284}, posted-at = {2009-11-03 09:49:40}, priority = {0}, publisher = {Elsevier Science Publishers B. V.}, title = {Comonadic Notions of Computation}, url = {http://dx.doi.org/10.1016/j.entcs.2008.05.029}, volume = {203}, year = {2008} }

TY - JOUR ID - citeulike:4075281 L3 - citeulike-article-id:4075281 N2 - We argue that symmetric (semi)monoidal comonads provide a means to structure context-dependent notions of computation such as notions of dataflow computation (computation on streams) and of tree relabelling as in attribute evaluation. We propose a generic semantics for extensions of simply typed lambda calculus with context-dependent operations analogous to the Moggi-style semantics for effectful languages based on strong monads. This continues the work in the early 90s by Brookes, Geva and Van Stone on the use of computational comonads in intensional semantics. IS - 5 JF - Electron. Notes Theor. Comput. Sci. SN - 1571-0661 AD - Amsterdam, The Netherlands, The Netherlands EP - 284 TI - Comonadic Notions of Computation PB - Elsevier Science Publishers B. V. VL - 203 SP - 263 KW - category-theory KW - comonad KW - functional-programming AU - Uustalu, Tarmo AU - Vene, Varmo PY - 2008/// UR - http://dx.doi.org/10.1016/j.entcs.2008.05.029 ER -