|
definition: |
(&) :: Bool -> Bool -> Bool |
|
demand: |
no demanded arguments |
|
deterministic: |
deterministic operation |
|
documentation: |
| Concurrent conjunction. An expression like `(c1 & c2)` is evaluated by evaluating the `c1` and `c2` in a concurrent manner. |
|
failfree: |
({True}, {True})
|
|
indeterministic: |
referentially transparent operation |
|
infix: |
infixr |
|
iotype: |
{(_,_) |-> _}
|
|
name: |
& |
|
precedence: |
0 |
|
result-values: |
_ |
|
signature: |
Bool -> Bool -> Bool |
|
solution-complete: |
operationally complete operation |
|
terminating: |
yes |
|
totally-defined: |
reducible on all ground data terms |