|
definition:
|
sequenceA :: (Applicative f) => [f a] -> f [a]
sequenceA [] = pure []
sequenceA (x:xs) = (:) <$> x <*> sequenceA xs
|
|
demand:
|
arguments 1 2
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Evaluate each action in the list from left to right, and
--- collect the results. For a version that ignores the results
--- see 'sequenceA_'.
|
|
failfree:
|
(_, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,{[]}) |-> _ || (_,{:}) |-> _}
|
|
name:
|
sequenceA
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Prelude.Applicative a => [a b] -> a [b]
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
yes
|
|
totally-defined:
|
reducible on all ground data terms
|