| definition: |
and :: [Bool] -> Bool and = foldr (&&) True |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Computes the conjunction of a Boolean list. |
| failfree: |
() |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{() |-> {foldr}}
|
| name: |
and |
| precedence: |
no precedence defined |
| result-values: |
{foldr}
|
| signature: |
[Bool] -> Bool |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |