|
definition:
|
declareVars :: Int -> SMT.Sort -> SMT [SMT.Term]
declareVars n sort = do
s <- get
let v = fresh s
names = map (('x' :) . show) [v .. v + n - 1]
put s { fresh = v + n
, globalDecls = globalDecls s ++ map (flip SMT.DeclareConst sort) names
}
return $ map var names
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Declare n fresh SMT variables of given sort
|
|
failfree:
|
(_, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_) |-> _}
|
|
name:
|
declareVars
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Prelude.Int -> Language.SMTLIB.Types.Sort -> SMT [Language.SMTLIB.Types.Term]
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|