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