Control.ContStuff.Simple

This module provides all the transformers from Control.ContStuff.Trans, but with a simplified interface, hiding the underlying CPS machinery.

Choice/nondeterminism

type ChoiceT m a = forall r i. ChoiceT r i m a

choice :: [a] -> ChoiceT m a

findAll :: (Alternative f, Applicative m) => ChoiceT m a -> m (f a)

findAll_ :: Applicative m => ChoiceT m a -> m ()

findFirst :: (Alternative f, Applicative m) => ChoiceT m a -> m (f a)

findFirst_ :: Applicative m => ChoiceT m a -> m ()

listA :: Alternative f => [a] -> f a

Turn a list into a computation with alternatives.

listChoiceT :: Applicative m => ChoiceT m a -> m [a]

maybeChoiceT :: Applicative m => ChoiceT m a -> m (Maybe a)

Exceptions

type EitherT e m a = forall r. EitherT r e m a

evalEitherT :: Applicative m => EitherT e m a -> m (Either e a)

testEitherT :: Applicative m => EitherT e m a -> m Bool

type MaybeT m a = forall r. MaybeT r m a

evalMaybeT :: Applicative m => MaybeT m a -> m (Maybe a)

testMaybeT :: Applicative m => MaybeT m a -> m Bool

State

type StateT s m a = forall r. StateT r s m a

evalStateT :: Applicative m => s -> StateT s m a -> m a

execStateT :: Applicative m => s -> StateT s m a -> m s

Writer

type WriterT w m a = forall r. OldWriterT r w m a

runWriterT :: (Applicative m, Monoid w) => WriterT w m a -> m (a, w)

evalWriterT :: (Applicative m, Monoid w) => WriterT w m a -> m a

execWriterT :: (Applicative m, Monoid w) => WriterT w m a -> m w

Reexports

module Control.Applicative

module Control.ContStuff.Classes

module Control.Monad