Results 1 
3 of
3
Coalgebraic Monads
, 2002
"... 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 graphs. We develop a general method for obtaining finitary coalgebraic monads which allows us to generalise the notion of rat ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
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 graphs. We develop a general method for obtaining finitary coalgebraic monads which allows us to generalise the notion of rational term and term graph to categories other than Set. As an application we sketch part of the correctness of the the term graph implementation of functional programming languages.
Iteration Monads
 Proceedings CMCS'01. Electronic Notes in Theoretical Computer Science 44
, 2000
"... . It has already been noticed by C. Elgot and his collaborators that the algebra of (nite and innite) trees is completely iterative, i.e., every system of ideal recursive equations has a unique solution. We prove that this is a special case of a very general coalgebraic phenomenon: suppose that an e ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
. It has already been noticed by C. Elgot and his collaborators that the algebra of (nite and innite) trees is completely iterative, i.e., every system of ideal recursive equations has a unique solution. We prove that this is a special case of a very general coalgebraic phenomenon: suppose that an endofunctor