|
definition: |
mapM :: Monad m => (a -> m b) -> [a] -> m [b] mapM f = sequence . map f |
|
demand: |
no demanded arguments |
|
deterministic: |
deterministic operation |
|
documentation: |
| Maps a monadic action function on a list of elements. The results of all monadic actions are collected in a list. |
|
failfree: |
(_, _) |
|
indeterministic: |
referentially transparent operation |
|
infix: |
no fixity defined |
|
iotype: |
{(_,_) |-> {.._#lambda508}}
|
|
name: |
mapM |
|
precedence: |
no precedence defined |
|
result-values: |
{.._#lambda508}
|
|
signature: |
Monad b => (a -> b c) -> [a] -> b [c] |
|
solution-complete: |
operation might suspend on free variables |
|
terminating: |
possibly non-terminating |
|
totally-defined: |
reducible on all ground data terms |