mtl-2.2.1: Monad classes, using functional dependencies

Copyright(c) Andy Gill 2001, (c) Oregon Graduate Institute of Science and Technology, 2001
LicenseBSD-style (see the file LICENSE)
Maintainerlibraries@haskell.org
Stabilityexperimental
Portabilityportable
Safe HaskellSafe-Inferred
LanguageHaskell98

Control.Monad.List

Description

The List monad.

Synopsis

Documentation

newtype ListT m a :: (* -> *) -> * -> *

Parameterizable list monad, with an inner monad.

Note: this does not yield a monad unless the argument monad is commutative.

Constructors

ListT 

Fields

runListT :: m [a]
 

Instances

MonadTrans ListT 
MonadState s m => MonadState s (ListT m) 
MonadReader r m => MonadReader r (ListT m) 
MonadError e m => MonadError e (ListT m) 
Applicative m => Alternative (ListT m) 
Monad m => Monad (ListT m) 
Functor m => Functor (ListT m) 
Monad m => MonadPlus (ListT m) 
Applicative m => Applicative (ListT m) 
Foldable f => Foldable (ListT f) 
Traversable f => Traversable (ListT f) 
Eq1 m => Eq1 (ListT m) 
Ord1 m => Ord1 (ListT m) 
Read1 m => Read1 (ListT m) 
Show1 m => Show1 (ListT m) 
MonadIO m => MonadIO (ListT m) 
MonadCont m => MonadCont (ListT m) 
(Eq1 m, Eq a) => Eq (ListT m a) 
(Ord1 m, Ord a) => Ord (ListT m a) 
(Read1 m, Read a) => Read (ListT m a) 
(Show1 m, Show a) => Show (ListT m a) 

mapListT :: (m [a] -> n [b]) -> ListT m a -> ListT n b

Map between ListT computations.