|
definition: |
substSort :: TPSubst -> Sort -> Sort substSort sub (SComb sn ss) = maybe (SComb sn (map (substSort sub) ss)) id (FM.lookup sn sub) |
|
demand: |
arguments 1 2 |
|
deterministic: |
deterministic operation |
|
documentation: |
Applies a sort substitution to a sort. |
|
failfree: |
(_, _) |
|
indeterministic: |
referentially transparent operation |
|
infix: |
no fixity defined |
|
iotype: |
{(_,{SComb}) |-> _}
|
|
name: |
substSort |
|
precedence: |
no precedence defined |
|
result-values: |
_ |
|
signature: |
Data.Map.Map String Sort -> Sort -> Sort |
|
solution-complete: |
operation might suspend on free variables |
|
terminating: |
possibly non-terminating |
|
totally-defined: |
possibly non-reducible on same data term |