| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Algebra.Monad.Free
Documentation
Instances
| ConcreteMonad Free | |
| MonadTrans Free | |
| MonadCounter w a m => MonadCounter w a (Free m) | |
| MonadFuture m t => MonadFuture m (Free t) | |
| MonadError e m => MonadError e (Free m) | |
| MonadWriter w m => MonadWriter w (Free m) | |
| MonadReader r m => MonadReader r (Free m) | |
| MonadState s m => MonadState s (Free m) | |
| MonadFree m (Free m) | |
| Unit (Free f) | |
| MonadList m => MonadList (Free m) | |
| MonadIO m => MonadIO (Free m) | |
| MonadFix f => MonadFix (Free f) | |
| Traversable f => Traversable (Free f) | |
| Foldable f => Foldable (Free f) | |
| Comonad f => Comonad (Free f) | |
| Counit f => Counit (Free f) | |
| Functor f => Monad (Free f) | |
| Functor f => Applicative (Free f) | |
| Functor f => Functor (Free f) | |
| (Ord (f (Free f a)), Ord a, Unit f) => Eq (Free f a) | |
| (Ord (f (Free f a)), Ord a, Unit f) => Ord (Free f a) | |
| (Show (f (Free f a)), Show a) => Show (Free f a) |
coerceStep :: forall m f g a. (Monad m, MonadFree m f) => (f a -> g a) -> g a -> m (g a) Source
coercePerform :: forall m f g a. (Monad m, MonadFree m f) => (f a -> g a) -> g a -> m a Source
coerceLiftF :: forall m f g a. (Functor m, MonadFree m f) => (f a -> g a) -> m a -> g a Source
Instances
| Unit m => Unit (Cofree m) | |
| Traversable w => Traversable (Cofree w) | |
| Foldable w => Foldable (Cofree w) | |
| Functor w => Comonad (Cofree w) | |
| Counit (Cofree w) | |
| Applicative m => Monad (Cofree m) | |
| Applicative m => Applicative (Cofree m) | |
| Functor w => Functor (Cofree w) |