Comonadic Notions of Computation

Tarmo Uustalu, Varmo Vene
2008 Electronical Notes in Theoretical Computer Science  
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
more » ... Stone on the use of computational comonads in intensional semantics.
doi:10.1016/j.entcs.2008.05.029 fatcat:cyunhgexjrbdflj6wo4zypbv2m