| definition: |
negBracket :: (Semiringc s, CGFunction s, Eq s) => [Int] ->
[Either Char (Char, Char)] -> Reg (Int, Char) s
negBracket li l = let l' = map negLift l
f = foldl (\g h -> (\c -> (g c) && (h c)))(head l')
(tail l')
in symc li (\c -> f c)
|
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
-- [^as] |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_,_,_) |-> {Reg}}
|
| name: |
negBracket |
| precedence: |
no precedence defined |
| result-values: |
{Reg}
|
| signature: |
(Semiringc a, CGFunction a, Prelude.Eq a) => [Prelude.Int] -> [Prelude.Either Prelude.Char (Prelude.Char, Prelude.Char)] -> Reg (Prelude.Int, Prelude.Char) a |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |