|
definition: |
concatPR :: PR [a] -> PR [a] -> PR [a] concatPR (OK x) (OK y) = okPR (x ++ y) concatPR (Errors p1) (Errors p2) = Errors (p1 ++ p2) concatPR (Errors p1) (OK _) = Errors p1 concatPR (OK _) (Errors p2) = Errors p2 |
|
demand: |
arguments 1 2 |
|
deterministic: |
deterministic operation |
|
documentation: |
Join two Error Monads |
|
failfree: |
(_, _) |
|
indeterministic: |
referentially transparent operation |
|
infix: |
no fixity defined |
|
iotype: |
{({OK},{OK}) |-> {OK} || ({OK},{Errors}) |-> {Errors} || ({Errors},{Errors}) |-> {Errors} || ({Errors},{OK}) |-> {Errors}}
|
|
name: |
concatPR |
|
precedence: |
no precedence defined |
|
result-values: |
{Errors,OK}
|
|
signature: |
PR [a] -> PR [a] -> PR [a] |
|
solution-complete: |
operationally complete operation |
|
terminating: |
yes |
|
totally-defined: |
reducible on all ground data terms |