Return to Question

Has anyone ever seen a Monad that is very much like the List Monad but is also a co-monad, and also a Frobenius monad. In this paper they give examples of List-like monads called Containers and they give one that is a Comonad, namely Trees. The comonad axiom takes each node in the tree and labels it with the tree rooted at that node. In the comments, there is an answer to a previous question of mine where someone suggests a bimonad, so comonad and monad that does not satisfy the frobenius property.

Has anyone ever seen a Monad that is very much like the List Monad but is also a co-monad, and also a Frobenius monad? In this paper they give examples of List-like monads called Containers and they give one that is a Comonad, namely Trees. The comonad axiom takes each node in the tree and labels it with the tree rooted at that node. In the comments, there is an answer to a previous question of mine where someone suggests a bimonad, so comonad and monad that does not satisfy the frobenius property.

Has anyone ever seen a Monad that is very much like the List Monad but is also a co-monad, and also a Frobenius monad. In this paper they give examples of List-like monads called Containers and they give one that is a Comonad, namely Trees. The comonad axiom takes each node in the tree and labels it with the tree rooted at that node.

Has anyone ever seen a Monad that is very much like the List Monad but is also a co-monad, and also a Frobenius monad. In this paper they give examples of List-like monads called Containers and they give one that is a Comonad, namely Trees. The comonad axiom takes each node in the tree and labels it with the tree rooted at that node. In the comments, there is an answer to a previous question of mine where someone suggests a bimonad, so comonad and monad that does not satisfy the frobenius property.