Sciweavers

Share
2635 search results - page 1 / 527
» Comonadic Notions of Computation
Sort
View
ENTCS
2008
126views more  ENTCS 2008»
8 years 8 months ago
Comonadic Notions of Computation
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 strea...
Tarmo Uustalu, Varmo Vene
ICTAC
2005
Springer
9 years 1 months ago
Covarieties of Coalgebras: Comonads and Coequations
Coalgebras provide effective models of data structures and state-transition systems. A virtual covariety is a class of coalgebras closed under coproducts, images of coalgebraic mo...
Ranald Clouston, Robert Goldblatt
CORR
2010
Springer
141views Education» more  CORR 2010»
8 years 5 months ago
A Categorical Outlook on Cellular Automata
In programming language semantics, it has proved to be fruitful to analyze context-dependent notions of computation, e.g., dataflow computation and attribute grammars, using comona...
Silvio Capobianco, Tarmo Uustalu
LICS
2007
IEEE
9 years 2 months ago
Categorical Combinatorics for Innocent Strategies
We show how to construct the category of games and innocent strategies from a more primitive category of games. On that category we define a comonad and monad with the former dis...
Russell Harmer, Martin Hyland, Paul-André M...
ENTCS
2006
125views more  ENTCS 2006»
8 years 8 months ago
Monads and Adjunctions for Global Exceptions
In this paper, we look at two categorical accounts of computational effects (strong monad as a model of the monadic metalanguage, adjunction as a model of call-bypush-value with s...
Paul Blain Levy
books