CurryInfo: contract-prover-4.0.0 / ESMT.substDefSig

definition:
 
substDefSig :: TPSubst -> FunSigTerm -> FunSigTerm
substDefSig tsub (ps, fsig, term) =
  (ps \\ FM.keys tsub, substFunSig tsub fsig, substTerm tsub term)
demand:
 argument 2
deterministic:
 deterministic operation
failfree:
 (_, _)
indeterministic:
 referentially transparent operation
infix:
 no fixity defined
iotype:
 {(_,{(,,)}) |-> {(,,)}}
name:
 substDefSig
precedence:
 no precedence defined
result-values:
 {(,,)}
signature:
 Data.Map.Map String Sort -> ([String], FunSig, Term) -> ([String], FunSig, Term)
solution-complete:
 operation might suspend on free variables
terminating:
 possibly non-terminating
totally-defined:
 possibly non-reducible on same data term