Control.Monad.Ideal

Ideal Monads

class Functor m => MonadIdeal m where

Methods

idealize :: m (Either a (m a)) -> m a

type Ideal = Ap Either

ideal :: Either a (f a) -> Ideal f a

destroyIdeal :: Algebra m a -> Ideal m a -> a

Mutual recursion for (co)ideal (co)monad (co)products

newtype Mutual p m n a

Constructors

Mutual

Fields

runMutual :: m (p a (Mutual p n m a))

Instances

(Bifunctor p Hask Hask Hask, Functor m, Functor n) => Functor (Mutual p m n)

Ideal Monad Coproduct

type :+ m n = Mutual' Either m n