Agda-2.3.2.2: A dependently typed functional programming language and proof assistant

Synopsis

Documentation

when_ :: Monad m => Bool -> m a -> m ()Source

`when_` is just `Control.Monad.when` with a more general type.

unless_ :: Monad m => Bool -> m a -> m ()Source

`unless_` is just `Control.Monad.unless` with a more general type.

whenJust :: Monad m => Maybe a -> (a -> m ()) -> m ()Source

whenM :: Monad m => m Bool -> m a -> m ()Source

unlessM :: Monad m => m Bool -> m a -> m ()Source

whenJustM :: Monad m => m (Maybe a) -> (a -> m ()) -> m ()Source

ifM :: Monad m => m Bool -> m a -> m a -> m aSource

and2M :: Monad m => m Bool -> m Bool -> m BoolSource

andM :: Monad m => [m Bool] -> m BoolSource

or2M :: Monad m => m Bool -> m Bool -> m BoolSource

orM :: Monad m => [m Bool] -> m BoolSource

altM1 :: Monad m => (a -> m (Either err b)) -> [a] -> m (Either err b)Source

Lazy monadic disjunction with `Either` truth values.

mapM' :: (Foldable t, Monad m, Monoid b) => (a -> m b) -> t a -> m bSource

Generalized version of `mapM_ :: Monad m => (a -> m ()) -> [a] -> m ()` Executes effects and collects results in left-to-right order. Works best with left-associative monoids.

Note that there is an alternative

`mapM' f t = foldr mappend mempty \$ mapM f t`

that collects results in right-to-left order (effects still right-to-left). It might be preferable for right associative monoids.

forM' :: (Foldable t, Monad m, Monoid b) => t a -> (a -> m b) -> m bSource

Generalized version of `forM_ :: Monad m => [a] -> (a -> m ()) -> m ()`

type Cont r a = (a -> r) -> rSource

thread :: (a -> Cont r b) -> [a] -> Cont r [b]Source

`mapM` for the continuation monad. Terribly useful.

zipWithM' :: Monad m => (a -> b -> m c) -> [a] -> [b] -> m [c]Source

Requires both lists to have the same lengths.

mapMaybeM :: (Monad m, Functor m) => (a -> m (Maybe b)) -> [a] -> m [b]Source

A monadic version of `mapMaybe :: (a -> Maybe b) -> [a] -> [b]`.

finally :: (Error e, MonadError e m) => m a -> m b -> m aSource

Finally for the `Error` class. Errors in the finally part take precedence over prior errors.

Arguments

 :: (Error e, MonadError e m) => m a Acquires resource. Run first. -> (a -> m c) Releases resource. Run last. -> (a -> m b) Computes result. Run in-between. -> m b

Bracket for the `Error` class.

Arguments

 :: Monad m => m a Acquires resource. Run first. -> (a -> m c) Releases resource. Run last. -> m b Computes result. Run in-between. -> m b

Bracket without failure. Typically used to preserve state.

localState :: MonadState s m => m a -> m aSource

Restore state after computation.

An infix synonym for `fmap`.