|
definition:
|
allQIdsOfTerm :: Term -> [QIdent]
allQIdsOfTerm (TConst _) = []
allQIdsOfTerm (TSVar _) = []
allQIdsOfTerm (TComb f args) = foldr union [f] (map allQIdsOfTerm args)
allQIdsOfTerm (Forall _ arg) = allQIdsOfTerm arg
allQIdsOfTerm (Exists _ arg) = allQIdsOfTerm arg
allQIdsOfTerm (Let bs e) =
foldr union [] (map allQIdsOfTerm (e : map snd bs))
allQIdsOfTerm (Match e ps) =
foldr union [] (map allQIdsOfTerm (e : map snd ps))
|
|
demand:
|
argument 1
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
------------------------------------------------------------------------
All possibly sorted identifiers occurring in a SMT term.
|
|
failfree:
|
_
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{({TConst}) |-> {[]} || ({TSVar}) |-> {[]} || ({TComb}) |-> _ || ({Forall}) |-> _ || ({Exists}) |-> _ || ({Let}) |-> _ || ({Match}) |-> _}
|
|
name:
|
allQIdsOfTerm
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Term -> [QIdent]
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
reducible on all ground data terms
|