233 search results - page 33 / 47 » Computational Lambda-Calculus and Monads |
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
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...
JACM
2002
13 years 7 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
CALCO
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. We investigate the phenomenon that every monad is a linear state monad. We do this by studying a fully-complete state-passing translation from an impure call-by-value lan...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Global states and exceptions form two basic computational effects. In this paper it is proved that they can be seen as dual to each other: the lookup and update operations for glo...
ENTCS
2010
13 years 7 months ago
2010
The notion of arrow by Hughes is an axiomatization of the algebraic structure possessed by structured computations in general. We claim that an arrow also serves as a basic compon...