Copyright | (c) Andy Gill 2001, (c) Oregon Graduate Institute of Science and Technology, 2001 |
---|---|
License | BSD-style (see the file LICENSE) |
Maintainer | R.Paterson@city.ac.uk |
Stability | experimental |
Portability | portable |
Safe Haskell | Safe |
Language | Haskell98 |
The ListT monad transformer, adding backtracking to a given monad, which must be commutative.
The ListT monad transformer
Parameterizable list monad, with an inner monad.
Note: this does not yield a monad unless the argument monad is commutative.
MonadTrans ListT # | |
Monad m => Monad (ListT m) # | |
Functor m => Functor (ListT m) # | |
Monad m => MonadFail (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) # | |
MonadZip m => MonadZip (ListT m) # | |
MonadIO m => MonadIO (ListT m) # | |
Applicative m => Alternative (ListT m) # | |
Monad m => MonadPlus (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) # | |