| definition: |
forM :: Monad m => [a] -> (a -> m b) -> m [b] forM = flip mapM |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- `forM` is `mapM` with its arguments flipped. |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_) |-> {flip}}
|
| name: |
forM |
| precedence: |
no precedence defined |
| result-values: |
{flip}
|
| signature: |
Prelude.Monad b => [a] -> (a -> b c) -> b [c] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
reducible on all ground data terms |