CALCO
2009
Springer
13 years 11 months ago
2009
Springer
A theory of traces of computations has emerged within the field of coalgebra, via finality in Kleisli categories. In concurrency theory, traces are traditionally obtained from ex...
CALCO
2009
Springer
13 years 11 months ago
2009
Springer
CALCO
2009
Springer
13 years 11 months ago
2009
Springer
Higher-order recursion schemes are equations defining recursively new operations from given ones called “terminals”. Every such recursion scheme is proved to have a least inte...
CALCO
2009
Springer
13 years 11 months ago
2009
Springer
CALCO
2009
Springer
13 years 11 months ago
2009
Springer
d abstract) Sam Staton Computer Laboratory, University of Cambridge Abstract. A labelled transition system can be understood as a coalgebra for a particular endofunctor on the cate...
CALCO
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of mea...
CALCO
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. This is a theoretical paper giving the extended Stone duality perspective on the recently discovered connection between duality theory as studied in non-classical logic a...
CALCO
2009
Springer
13 years 11 months ago
2009
Springer
The microcosm principle, advocated by Baez and Dolan and formalized for Lawvere theories lately by three of the authors, has been applied to coalgebras in order to describe composi...
CALCO
2009
Springer
13 years 11 months ago
2009
Springer
CALCO
2009
Springer
13 years 11 months ago
2009
Springer
We generalize the unfolding semantics, previously developed for concrete formalisms such as Petri nets and graph grammars, to the setting of (single pushout) rewriting over adhesiv...