Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ENTCS
2008

favoriteEmaildiscussreport

126views more ENTCS 2008»

Comonadic Notions of Computation

13 years 4 months ago

Comonadic Notions of Computation

Download www.cs.ioc.ee

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.

Tarmo Uustalu, Varmo Vene

Real-time Traffic

Computation | ENTCS 2008 | Semantics | Simply Typed Lambda Calculus |

claim paper

Related Content

» Covarieties of Coalgebras Comonads and Coequations

» A Categorical Outlook on Cellular Automata

» Categorical Combinatorics for Innocent Strategies

» Monads and Adjunctions for Global Exceptions

» Ypnos declarative parallel structured grid programming

» Algebras Versus Coalgebras

» On invariant notions of Segre varieties in binary projective spaces

» Notions and relations for RKAsecure permutation and function families

» States and exceptions are dual effects

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	ENTCS
Authors	Tarmo Uustalu, Varmo Vene

Comments (0)