|
definition:
|
sortsOfTerm :: SMT.Term -> [SMT.Sort]
sortsOfTerm (SMT.TConst _) = []
sortsOfTerm (SMT.Let bs t) = concatMap (sortsOfTerm . snd) bs
++ sortsOfTerm t
sortsOfTerm (SMT.Forall vs t) = map sortOfSortedVar vs ++ sortsOfTerm t
sortsOfTerm (SMT.Exists vs t) = map sortOfSortedVar vs ++ sortsOfTerm t
sortsOfTerm (SMT.Match e ps) = concatMap (sortsOfTerm . snd) ps
++ sortsOfTerm e
sortsOfTerm (SMT.Annot t _) = sortsOfTerm t
sortsOfTerm (SMT.TComb f ts) = sortsOfQIdent f ++ concatMap sortsOfTerm ts
where
sortsOfQIdent (SMT.Id _) = []
sortsOfQIdent (SMT.As _ s) = [s]
|
|
demand:
|
argument 1
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
-- Get all sorts occurring in a term.
|
|
failfree:
|
_
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{({TConst}) |-> {[]} || ({Let}) |-> _ || ({Forall}) |-> _ || ({Exists}) |-> _ || ({Match}) |-> _ || ({Annot}) |-> _ || ({TComb}) |-> _}
|
|
name:
|
sortsOfTerm
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Language.SMTLIB.Types.Term -> [Language.SMTLIB.Types.Sort]
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
reducible on all ground data terms
|