Sciweavers

FOSSACS
2011
Springer
12 years 11 months ago
Coalgebraic Walks, in Quantum and Turing Computation
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of...
Bart Jacobs
ENTCS
2011
134views more  ENTCS 2011»
12 years 11 months ago
Idioms are Oblivious, Arrows are Meticulous, Monads are Promiscuous
We revisit the connection between three notions of computation: Moggi’s monads, Hughes’s arrows and McBride and Paterson’s idioms (also called applicative functors). We show...
Sam Lindley, Philip Wadler, Jeremy Yallop