| definition: |
zipWithM :: (Applicative m) => (a -> b -> m c) -> [a] -> [b] -> m [c] zipWithM f xs ys = sequenceA (zipWith f xs ys) |
| demand: |
arguments 1 3 |
| deterministic: |
deterministic operation |
| documentation: |
--- The 'zipWithM' function generalizes 'zipWith' to --- arbitrary applicative functors. |
| failfree: |
(_, _, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_,_) |-> _}
|
| name: |
zipWithM |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Prelude.Applicative c => (a -> b -> c d) -> [a] -> [b] -> c [d] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |