CurryInfo: verify-non-fail-2.0.0 / FlatCurry.Names.binaryPrimOps
definition: 
|
binaryPrimOps :: [(String,String)] binaryPrimOps = map transEqu2 (drop 2 FlatCurry.Names2SMT.binaryPrimOps) where transEqu2 (fc,fsmt) = (fc, if fsmt == "=" then "==" else fsmt) |
|
demand:
|
no demanded arguments |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Primitive binary operations of the prelude and their SMT names. |
|
failfree:
|
() |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{() |-> {:,[]}}
|
|
name:
|
binaryPrimOps |
|
precedence:
|
no precedence defined |
|
result-values:
|
{:,[]}
|
|
signature:
|
[(String, String)] |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
reducible on all ground data terms |