CurryInfo: verify-non-fail-2.0.0 / Verify.WithSMT.primNames

definition:
 
primNames :: [(String,String)]
primNames =
  [ -- Operations
  ("&&","and")
  ,("||","or")
  ,("not","not")
  ,("==","=")
  ,("/=","/=")
  ,("===","=")
  ,("/==","/=")
  ,("=","=")
  ,("<","<")
  ,("<=","<=")
  ,(">",">")
  ,(">=",">=")
  ,("+","+")
  ,("-","-")
  ,("*","*")
  -- Constructors:
  ,("True","true")
  ,("False","false")
  ,("[]","nil")
  ,(":","insert")
  ,("()","unit")
  ,("(,)","mk-pair")
  ,("LT","LT")
  ,("EQ","EQ")
  ,("GT","GT")
  ,("Nothing","Nothing")
  ,("Just","Just")
  ,("Left","Left")
  ,("Right","Right")
  ,("_","_") -- for anonymous patterns in case expressions
  ] ++
  map (\i -> ('(' : take (i-1) (repeat ',') ++ ")", "Tuple" ++ show i)) [3..15]
demand:
 no demanded arguments
deterministic:
 deterministic operation
documentation:
 
-------------------------------------------------------------------------
Some primitive names of the prelude and their SMT names.
failfree:
 ()
indeterministic:
 referentially transparent operation
infix:
 no fixity defined
iotype:
 {() |-> _}
name:
 primNames
precedence:
 no precedence defined
result-values:
 _
signature:
 [(String, String)]
solution-complete:
 operation might suspend on free variables
terminating:
 possibly non-terminating
totally-defined:
 possibly non-reducible on same data term