mtl-2.2.1: Monad classes, using functional dependencies

Copyright | (c) Andy Gill 2001 (c) Oregon Graduate Institute of Science and Technology 2001
License | BSD-style (see the file LICENSE)
Maintainer | libraries@haskell.org
Stability | experimental
Portability | portable
Safe Haskell | Safe
Language | Haskell98

Control.Monad.List

Description

The List monad.

Synopsis

- newtype ListT m a :: (* -> *) -> * -> * = ListT {
  - runListT :: m [a]
  }
- mapListT :: (m [a] -> n [b]) -> ListT m a -> ListT n b
- module Control.Monad
- module Control.Monad.Trans

# 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 |
Methods lift :: Monad m => m a -> ListT m a #
MonadState s m => MonadState s (ListT m) Source # |
Methods get :: ListT m s Source # put :: s -> ListT m () Source # state :: (s -> (a, s)) -> ListT m a Source #
MonadReader r m => MonadReader r (ListT m) Source # |
Methods ask :: ListT m r Source # local :: (r -> r) -> ListT m a -> ListT m a Source # reader :: (r -> a) -> ListT m a Source #
MonadError e m => MonadError e (ListT m) Source # |
Methods throwError :: e -> ListT m a Source # catchError :: ListT m a -> (e -> ListT m a) -> ListT m a Source #
Monad m => Monad (ListT m) |
Methods (>>=) :: ListT m a -> (a -> ListT m b) -> ListT m b # (>>) :: ListT m a -> ListT m b -> ListT m b # return :: a -> ListT m a # fail :: String -> ListT m a #
Functor m => Functor (ListT m) |
Methods fmap :: (a -> b) -> ListT m a -> ListT m b # (<$) :: a -> ListT m b -> ListT m a #
Monad m => MonadFail (ListT m) |
Methods fail :: String -> ListT m a #
Applicative m => Applicative (ListT m) |
Methods pure :: a -> ListT m a # (<*>) :: ListT m (a -> b) -> ListT m a -> ListT m b # (*>) :: ListT m a -> ListT m b -> ListT m b # (<*) :: ListT m a -> ListT m b -> ListT m a #
Foldable f => Foldable (ListT f) |

Methods

fold :: Monoid m => ListT f m -> m #

foldMap :: Monoid m => (a -> m) -> ListT f a -> m #

foldr :: (a -> b -> b) -> b -> ListT f a -> b #

foldr' :: (a -> b -> b) -> b -> ListT f a -> b #

foldl :: (b -> a -> b) -> b -> ListT f a -> b #

foldl' :: (b -> a -> b) -> b -> ListT f a -> b #

foldr1 :: (a -> a -> a) -> ListT f a -> a #

foldl1 :: (a -> a -> a) -> ListT f a -> a #

toList :: ListT f a -> [a] #

null :: ListT f a -> Bool #

length :: ListT f a -> Int #

elem :: Eq a => a -> ListT f a -> Bool #

maximum :: Ord a => ListT f a -> a #

minimum :: Ord a => ListT f a -> a #

sum :: Num a => ListT f a -> a #

product :: Num a => ListT f a -> a #

Traversable f => Traversable (ListT f) |
Methods traverse :: Applicative f => (a -> f b) -> ListT f a -> f (ListT f b) # sequenceA :: Applicative f => ListT f (f a) -> f (ListT f a) # mapM :: Monad m => (a -> m b) -> ListT f a -> m (ListT f b) # sequence :: Monad m => ListT f (m a) -> m (ListT f a) #
Eq1 m => Eq1 (ListT m) |
Methods liftEq :: (a -> b -> Bool) -> ListT m a -> ListT m b -> Bool #
Ord1 m => Ord1 (ListT m) |
Methods liftCompare :: (a -> b -> Ordering) -> ListT m a -> ListT m b -> Ordering #
Read1 m => Read1 (ListT m) |
Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (ListT m a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [ListT m a] #
Show1 m => Show1 (ListT m) |
Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> ListT m a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [ListT m a] -> ShowS #
MonadZip m => MonadZip (ListT m) |
Methods mzip :: ListT m a -> ListT m b -> ListT m (a, b) # mzipWith :: (a -> b -> c) -> ListT m a -> ListT m b -> ListT m c # munzip :: ListT m (a, b) -> (ListT m a, ListT m b) #
MonadIO m => MonadIO (ListT m) |
Methods liftIO :: IO a -> ListT m a #
Applicative m => Alternative (ListT m) |
Methods empty :: ListT m a # (<|>) :: ListT m a -> ListT m a -> ListT m a # some :: ListT m a -> ListT m [a] # many :: ListT m a -> ListT m [a] #
Monad m => MonadPlus (ListT m) |
Methods mzero :: ListT m a # mplus :: ListT m a -> ListT m a -> ListT m a #
MonadCont m => MonadCont (ListT m) Source # |
Methods callCC :: ((a -> ListT m b) -> ListT m a) -> ListT m a Source #
(Eq1 m, Eq a) => Eq (ListT m a) |
Methods (==) :: ListT m a -> ListT m a -> Bool # (/=) :: ListT m a -> ListT m a -> Bool #
(Ord1 m, Ord a) => Ord (ListT m a) |
Methods compare :: ListT m a -> ListT m a -> Ordering # (<) :: ListT m a -> ListT m a -> Bool # (<=) :: ListT m a -> ListT m a -> Bool # (>) :: ListT m a -> ListT m a -> Bool # (>=) :: ListT m a -> ListT m a -> Bool # max :: ListT m a -> ListT m a -> ListT m a # min :: ListT m a -> ListT m a -> ListT m a #
(Read1 m, Read a) => Read (ListT m a) |
Methods readsPrec :: Int -> ReadS (ListT m a) # readList :: ReadS [ListT m a] # readPrec :: ReadPrec (ListT m a) # readListPrec :: ReadPrec [ListT m a] #
(Show1 m, Show a) => Show (ListT m a) |
Methods showsPrec :: Int -> ListT m a -> ShowS # show :: ListT m a -> String # showList :: [ListT m a] -> ShowS #

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

Map between `ListT` computations.

-     runListT (mapListT f m) = f (runListT m)

module Control.Monad

module Control.Monad.Trans