CurryInfo: contract-prover-4.0.0 / ESMT.substSV

definition:
 
substSV :: TPSubst -> SortedVar -> SortedVar
substSV sub (SV v s) = SV v (substSort sub s)
demand:
 argument 2
deterministic:
 deterministic operation
failfree:
 (_, _)
indeterministic:
 referentially transparent operation
infix:
 no fixity defined
iotype:
 {(_,{SV}) |-> {SV}}
name:
 substSV
precedence:
 no precedence defined
result-values:
 {SV}
signature:
 Data.Map.Map String Sort -> SortedVar -> SortedVar
solution-complete:
 operation might suspend on free variables
terminating:
 possibly non-terminating
totally-defined:
 possibly non-reducible on same data term