CurryInfo: contract-prover-4.0.0 / ESMT.rnmTerm

definition: Info 
 
rnmTerm :: (Ident -> Ident) -> Term -> Term
rnmTerm rnm term = case term of
  TConst _ -> term
  TSVar  _ -> term
  TComb f args -> TComb (rnmQId rnm f) (map (rnmTerm rnm) args)
  Forall svs arg -> Forall svs (rnmTerm rnm arg)
  Exists svs arg -> Forall svs (rnmTerm rnm arg)
  Let bs e -> Let (map (\ (v,s) -> (v, rnmTerm rnm s)) bs) (rnmTerm rnm e)
demand: Info 
 argument 2
deterministic: Info 
 deterministic operation
failfree: Info 
 (_, _)
indeterministic: Info 
 referentially transparent operation
infix: Info 
 no fixity defined
iotype: Info 
 {(_,{TConst}) |-> {TConst} || (_,{TSVar}) |-> {TSVar} || (_,{TComb}) |-> {TComb} || (_,{Forall}) |-> {Forall} || (_,{Exists}) |-> {Forall} || (_,{Let}) |-> {Let}}
name: Info 
 rnmTerm
precedence: Info 
 no precedence defined
result-values: Info 
 _
signature: Info 
 (String -> String) -> Term -> Term
solution-complete: Info 
 operation might suspend on free variables
terminating: Info 
 possibly non-terminating
totally-defined: Info 
 reducible on all ground data terms