CurryInfo: flatcurry-smt-2.0.0 / FlatCurry.Names2SMT.binaryPrimOps

definition: 
binaryPrimOps :: [(String,String)]
binaryPrimOps =
  [("&&","and")
  ,("||","or")
  ,("==","=")
  ,("constrEq","=")
  ,("_impl#==#Prelude.Eq#Prelude.Int#","=")
  ,("_impl#==#Prelude.Eq#Prelude.Float#","=")
  ,("_impl#==#Prelude.Eq#Prelude.Char#","=")
  ,("/=","/=")  -- should be translated as negated '='
  ,("_impl#/=#Prelude.Eq#Prelude.Int#","/=")
  ,("_impl#/=#Prelude.Eq#Prelude.Float#","/=")
  ,("_impl#/=#Prelude.Eq#Prelude.Char#","/=")
  ,("_impl#+#Prelude.Num#Prelude.Int#","+")
  ,("_impl#-#Prelude.Num#Prelude.Int#","-")
  ,("_impl#*#Prelude.Num#Prelude.Int#","*")
  ,("_impl#negate#Prelude.Num#Prelude.Int#","-")
  ,("_impl#div#Prelude.Integral#Prelude.Int#","div")
  ,("_impl#mod#Prelude.Integral#Prelude.Int#","mod")
  ,("_impl#rem#Prelude.Integral#Prelude.Int#","rem")
  ,("_impl#>#Prelude.Ord#Prelude.Int#",">")
  ,("_impl#<#Prelude.Ord#Prelude.Int#","<")
  ,("_impl#>=#Prelude.Ord#Prelude.Int#",">=")
  ,("_impl#<=#Prelude.Ord#Prelude.Int#","<=")
  ,("_impl#+#Prelude.Num#Prelude.Float#","+")
  ,("_impl#-#Prelude.Num#Prelude.Float#","-")
  ,("_impl#*#Prelude.Num#Prelude.Float#","*")
  ,("_impl#/#Prelude.Num#Prelude.Float#","/")
  ,("_impl#>#Prelude.Ord#Prelude.Float#",">")
  ,("_impl#<#Prelude.Ord#Prelude.Float#","<")
  ,("_impl#>=#Prelude.Ord#Prelude.Float#",">=")
  ,("_impl#<=#Prelude.Ord#Prelude.Float#","<=")
  ,("_impl#>#Prelude.Ord#Prelude.Char#",">")
  ,("_impl#<#Prelude.Ord#Prelude.Char#","<")
  ,("_impl#>=#Prelude.Ord#Prelude.Char#",">=")
  ,("_impl#<=#Prelude.Ord#Prelude.Char#","<=")
  ]
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: 
operationally complete operation
terminating: 
yes
totally-defined: 
reducible on all ground data terms