Sciweavers

18 search results - page 1 / 4
» Coalgebraic Monads
Sort
View
FOSSACS
2011
Springer
12 years 8 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
2002
141views more  ENTCS 2002»
13 years 4 months ago
Coalgebraic Monads
This paper introduces coalgebraic monads as a unified model of term algebras covering fundamental examples such as initial algebras, final coalgebras, rational terms and term grap...
Neil Ghani, Christoph Lüth, Federico De March...
ENTCS
2008
84views more  ENTCS 2008»
13 years 4 months ago
Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) have been studied for quite some time. Separately, they are reasonably well-und...
Bart Jacobs
ENTCS
2006
125views more  ENTCS 2006»
13 years 4 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
ENTCS
2002
136views more  ENTCS 2002»
13 years 4 months ago
Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors
Every endofunctor F of Set has an initial algebra and a final coalgebra, but they are classes in general. Consequently, the endofunctor F of the category of classes that F induces...
Jirí Adámek, Stefan Milius, Jiri Vel...