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