|
definition:
|
getValues :: [SMT.Term] -> SMT (Either [SMTError] [SMT.ValuationPair])
getValues ts = do
sendCmds [SMT.GetValue ts]
valMsg <- getDelimited
case parseCmdRsps valMsg of
Left msg -> return $ Left $ [ParserError msg]
Right [SMT.GetValueRsp m] -> return $ Right $ m
Right rsps -> return $ Left $ map rsp2Msg rsps
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Get bindings for given variables for the current assertions
--- on the solver stack
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_) |-> _}
|
|
name:
|
getValues
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
[Language.SMTLIB.Types.Term]
-> SMT (Prelude.Either [Solver.SMTLIB.Types.SMTError] [(Language.SMTLIB.Types.Term, 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
|