8 search results - page 1 / 2 » Recursive coalgebras from comonads |
IANDC
2006
13 years 11 months ago
2006
We discuss Osius's [22] concept of a recursive coalgebra of a functor from the perspective of programming semantics and give some new sufficient conditions for the recursiven...
CALCO
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. The free algebra adjunction, between the category of algebras of a monad and the underlying category, induces a comonad on the category of algebras. The coalgebras of thi...
FOSSACS
2010
Springer
14 years 5 months ago
2010
Springer
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
ENTCS
2006
13 years 11 months ago
2006
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...
SBMF
2009
Springer
14 years 5 months ago
2009
Springer
Motivated by issues in designing practical total functional programming languages, we are interested in structured recursive equations that uniquely describe a function not because...