Data.Profunctor.Comonad.Cofree

Cofree comonads; useful for histomorphisms and also recursion

unfold : Functor f => (g : b -> (a, f b)) -> b -> Cofree f a

Recursion using comonads

interface ComonadCofree 

Typeclass for cofree comonads

unwrap : ComonadCofree f w => w a -> f (w a)

data Cofree : (f : Type -> Type) -> Type -> Type

Constructor for a cofree comonad

Co : a -> f (Cofree f a) -> Cofree f a