Safe Haskell | None |
---|---|
Language | Haskell2010 |
Algebra.Classes
- class Functor f where
- class Functor f => SemiApplicative f where
- class (Unit f, SemiApplicative f) => Applicative f
- class Applicative m => Monad m where
- class Counit w where
- class (Functor w, Counit w) => Comonad w where
- class Functor f => Foldable f where
- class Functor t => Traversable t where
- class Monad m => MonadFix m where
- class MonadTrans t where
- class MonadTrans t => ConcreteMonad t where
- class Monad m => MonadState s m | m -> s where
- class Monad m => MonadReader r m | m -> r where
- class (Monad m, Monoid w) => MonadWriter w m | m -> w where
- class (SubSemi acc w, MonadWriter w m) => MonadCounter w acc m | m -> acc where
- class Monad m => MonadIO m where
- class Monad m => MonadList m where
- class Monad m => MonadCont m where
- class Monad m => MonadError e m | m -> e where
- class Monad m => MonadLogic m l | l -> m where
- coerceDeduce :: forall l m l' m' a. MonadLogic m l => (forall b. l b -> l' b) -> (forall b. m b -> m' b) -> l' a -> m' (Maybe (a, l' a))
- coerceInduce :: forall l m l' m' a. MonadLogic m l => (forall b. l b -> l' b) -> (forall b. m b -> m' b) -> m' (Maybe (a, l' a)) -> l' a
- class MonadFix t => MonadFuture m t | t -> m where
Documentation
class Functor f where Source #
Minimal complete definition
Instances
class Functor f => SemiApplicative f where Source #
Methods
(<*>) :: f (a -> b) -> f a -> f b infixl 1 Source #
(<*>) :: Monad f => f (a -> b) -> f a -> f b infixl 1 Source #
Instances
class (Unit f, SemiApplicative f) => Applicative f Source #
Instances
class Applicative m => Monad m where Source #
Instances
Monad Strict Source # | |
Monad TimeVal Source # | |
Monad (ContT m) Source # | |
Applicative m => Monad (Cofree m) Source # | |
Functor f => Monad (Free f) Source # | |
Monad m => Monad (StrictT m) Source # | |
Monad m => Monad (MaybeT m) Source # | |
Monad m => Monad (TreeT m) Source # | |
Monad m => Monad (ListT m) Source # | |
Monad (LogicT m) Source # | |
Monad (IOVar w) Source # | |
(Monad f, Monad g, Traversable f) => Monad (Compose' f g) Source # | |
Monad m => Monad (EitherT e m) Source # | |
Monad m => Monad (ReaderT r m) Source # | |
Monad m => Monad (StateT s m) Source # | |
(Monoid w, Monad m) => Monad (WriterT w m) Source # | |
Ring t => Monad (ProbT t m) Source # | |
(Monoid w, Monad m) => Monad (CounterT w a m) Source # | |
(Monoid w, Monad m) => Monad (RWST r w s m) Source # | |
Minimal complete definition
class Functor f => Foldable f where Source #
Minimal complete definition
Instances
Foldable DeQue Source # | |
Foldable TimeVal Source # | |
Foldable f => Foldable (Zip f) Source # | |
Foldable w => Foldable (Cofree w) Source # | |
Foldable f => Foldable (Free f) Source # | |
Foldable m => Foldable (StrictT m) Source # | |
Foldable m => Foldable (MaybeT m) Source # | |
Foldable m => Foldable (TreeT m) Source # | |
Foldable m => Foldable (ListT m) Source # | |
(Monad m, Foldable m) => Foldable (LogicT m) Source # | |
(Foldable f, Foldable g) => Foldable (Compose' f g) Source # | |
Foldable m => Foldable (EitherT e m) Source # | |
Foldable m => Foldable (WriterT w m) Source # | |
Foldable (Queue push pop) Source # | |
Foldable m => Foldable (RWST Void w Void m) Source # | |
class Functor t => Traversable t where Source #
Minimal complete definition
Methods
sequence :: Applicative f => t (f a) -> f (t a) Source #
Instances
Traversable DeQue Source # | |
Traversable TimeVal Source # | |
Traversable w => Traversable (Cofree w) Source # | |
Traversable f => Traversable (Free f) Source # | |
Traversable m => Traversable (StrictT m) Source # | |
Traversable m => Traversable (MaybeT m) Source # | |
Traversable m => Traversable (TreeT m) Source # | |
Traversable m => Traversable (ListT m) Source # | |
(Monad m, Traversable m) => Traversable (LogicT m) Source # | |
(Traversable g, Traversable f) => Traversable (Compose' f g) Source # | |
Traversable m => Traversable (EitherT e m) Source # | |
Traversable m => Traversable (WriterT e m) Source # | |
Traversable (Queue push pop) Source # | |
Traversable m => Traversable (RWST Void w Void m) Source # | |
class Monad m => MonadFix m where Source #
The class of all monads that have a fixpoint
Minimal complete definition
Instances
MonadFix m => MonadFix (ContT m) Source # | |
MonadFix f => MonadFix (Free f) Source # | |
MonadFix m => MonadFix (StrictT m) Source # | |
MonadFix m => MonadFix (MaybeT m) Source # | |
MonadFix m => MonadFix (TreeT m) Source # | |
MonadFix m => MonadFix (ListT m) Source # | |
MonadFix m => MonadFix (LogicT m) Source # | |
(Monad f, Traversable f, MonadFix g) => MonadFix (Compose' f g) Source # | |
MonadFix m => MonadFix (EitherT e m) Source # | |
MonadFix m => MonadFix (ReaderT r m) Source # | |
MonadFix m => MonadFix (StateT s m) Source # | |
(MonadFix m, Monoid w) => MonadFix (WriterT w m) Source # | |
(Ring t, MonadFix m) => MonadFix (ProbT t m) Source # | |
(MonadFix m, Monoid w) => MonadFix (CounterT w acc m) Source # | |
(Monoid w, MonadFix m) => MonadFix (RWST r w s m) Source # | |
class MonadTrans t where Source #
Minimal complete definition
Instances
MonadTrans ContT Source # | |
MonadTrans Free Source # | |
MonadTrans StrictT Source # | |
MonadTrans MaybeT Source # | |
MonadTrans TreeT Source # | |
MonadTrans ListT Source # | |
MonadTrans LogicT Source # | |
Monad m => MonadTrans (Compose' m) Source # | |
MonadTrans (EitherT e) Source # | |
MonadTrans (ReaderT r) Source # | |
MonadTrans (StateT s) Source # | |
Monoid w => MonadTrans (WriterT w) Source # | |
Monoid w => MonadTrans (CounterT w acc) Source # | |
Monoid w => MonadTrans (RWST r w s) Source # | |
class MonadTrans t => ConcreteMonad t where Source #
Minimal complete definition
Methods
generalize :: Monad m => t Id a -> t m a Source #
Instances
ConcreteMonad Free Source # | |
Monad m => ConcreteMonad (Compose' m) Source # | |
ConcreteMonad (StateT s) Source # | |
Monoid w => ConcreteMonad (WriterT w) Source # | |
Monoid w => ConcreteMonad (CounterT w acc) Source # | |
Monoid w => ConcreteMonad (RWST r w s) Source # | |
class Monad m => MonadState s m | m -> s where Source #
Minimal complete definition
Instances
MonadState s m => MonadState s (Free m) Source # | |
MonadState s m => MonadState s (ListT m) Source # | |
MonadState s m => MonadState s (TreeT m) Source # | |
MonadState s m => MonadState s (MaybeT m) Source # | |
MonadState s m => MonadState s (StrictT m) Source # | |
MonadState s m => MonadState s (LogicT m) Source # | |
(Traversable f, Monad f, MonadState s g) => MonadState s (Compose' f g) Source # | |
MonadState s m => MonadState s (ReaderT r m) Source # | |
Monad m => MonadState s (StateT s m) Source # | |
(Monoid w, MonadState r m) => MonadState r (WriterT w m) Source # | |
(MonadState s m, Monoid w) => MonadState s (CounterT w acc m) Source # | |
(Monad m, Monoid w) => MonadState s (RWST r w s m) Source # | |
class Monad m => MonadReader r m | m -> r where Source #
Instances
MonadReader r m => MonadReader r (Free m) Source # | |
MonadReader r m => MonadReader r (TreeT m) Source # | |
MonadReader r m => MonadReader r (MaybeT m) Source # | |
MonadReader r m => MonadReader r (StrictT m) Source # | |
MonadReader r m => MonadReader r (LogicT m) Source # | |
(Traversable f, Monad f, MonadReader r g) => MonadReader r (Compose' f g) Source # | |
Monad m => MonadReader r (ReaderT r m) Source # | |
MonadReader r m => MonadReader r (StateT s m) Source # | |
(Monoid w, MonadReader r m) => MonadReader r (WriterT w m) Source # | |
(Monad m, Monoid w) => MonadReader r (RWST r w s m) Source # | |
class (Monad m, Monoid w) => MonadWriter w m | m -> w where Source #
Instances
MonadWriter w m => MonadWriter w (Free m) Source # | |
MonadWriter w m => MonadWriter w (ListT m) Source # | |
MonadWriter w m => MonadWriter w (TreeT m) Source # | |
MonadWriter w m => MonadWriter w (MaybeT m) Source # | |
MonadWriter w m => MonadWriter w (StrictT m) Source # | |
MonadWriter w m => MonadWriter w (LogicT m) Source # | |
(Traversable f, Monad f, MonadWriter w g) => MonadWriter w (Compose' f g) Source # | |
MonadWriter w m => MonadWriter w (ReaderT r m) Source # | |
MonadWriter w m => MonadWriter w (StateT s m) Source # | |
(Monoid w, Monad m) => MonadWriter w (WriterT w m) Source # | |
(Monad m, SubSemi acc w, Monoid w) => MonadWriter w (CounterT w acc m) Source # | |
(Monad m, Monoid w) => MonadWriter w (RWST r w s m) Source # | |
Ring t => MonadWriter (Product t) (ProbT t m) Source # | |
class (SubSemi acc w, MonadWriter w m) => MonadCounter w acc m | m -> acc where Source #
Minimal complete definition
Instances
MonadCounter w a m => MonadCounter w a (Free m) Source # | |
MonadCounter w acc m => MonadCounter w acc (ReaderT r m) Source # | |
MonadCounter w acc m => MonadCounter w acc (StateT s m) Source # | |
(Monad m, Monoid w, SubSemi acc w) => MonadCounter w acc (CounterT w acc m) Source # | |
class Monad m => MonadList m where Source #
Minimal complete definition
Instances
MonadList m => MonadList (Free m) Source # | |
Monad m => MonadList (ListT m) Source # | |
MonadList m => MonadList (ReaderT r m) Source # | |
MonadList m => MonadList (StateT s m) Source # | |
(MonadList m, Monoid w) => MonadList (WriterT w m) Source # | |
(Monad m, Invertible t) => MonadList (ProbT t m) Source # | |
(Monoid w, MonadList m) => MonadList (RWST r w s m) Source # | |
class Monad m => MonadError e m | m -> e where Source #
Instances
MonadError e m => MonadError e (Free m) Source # | |
Monad m => MonadError Void (ListT m) Source # | |
Monad m => MonadError Void (LogicT m) Source # | |
MonadError e m => MonadError e (StateT s m) Source # | |
(Monoid w, MonadError e m) => MonadError e (RWST r w s m) Source # | |
class Monad m => MonadLogic m l | l -> m where Source #
Instances
Monad m => MonadLogic m (LogicT m) Source # | |
MonadLogic m l => MonadLogic (ReaderT r m) (ReaderT r l) Source # | |
MonadLogic l m => MonadLogic (StateT s l) (StateT s m) Source # | |
(Monoid w, MonadLogic m l) => MonadLogic (WriterT w m) (WriterT w l) Source # | |
(Monoid w, MonadLogic l m) => MonadLogic (RWST r w s l) (RWST r w s m) Source # | |
coerceDeduce :: forall l m l' m' a. MonadLogic m l => (forall b. l b -> l' b) -> (forall b. m b -> m' b) -> l' a -> m' (Maybe (a, l' a)) Source #
coerceInduce :: forall l m l' m' a. MonadLogic m l => (forall b. l b -> l' b) -> (forall b. m b -> m' b) -> m' (Maybe (a, l' a)) -> l' a Source #
class MonadFix t => MonadFuture m t | t -> m where Source #
Minimal complete definition
Instances
MonadFuture m t => MonadFuture m (Free t) Source # | |
(Monad m, MonadFuture n m) => MonadFuture n (ReaderT r m) Source # | |
(Monad m, MonadFuture n m) => MonadFuture n (StateT s m) Source # | |
(Monad m, Monoid w, MonadFuture n m) => MonadFuture n (WriterT w m) Source # | |
(Monad m, Monoid w, MonadFuture n m) => MonadFuture n (CounterT w acc m) Source # | |
(Monad m, Monoid w, MonadFuture n m) => MonadFuture n (RWST r w s m) Source # | |