|
definition:
|
postCondExpOf :: QName -> [(Int,TypeExpr)]
-> TransStateM SMT.Term
postCondExpOf qf args = do
postconds <- lift $ gets $ postConds . trInfo
maybe (return true)
(\fd -> applyFunc fd args >>= pred2SMT)
(find (\fd -> decodeContractQName (funcName fd)
== toPostCondQName (fromNoCheckQName qf)) postconds)
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
-- Returns the postcondition expression for a given operation
-- and its arguments (which are assumed to be variable indices).
-- Rename all local variables by adding `freshvar` to them and
-- return the new freshvar value.
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_) |-> _}
|
|
name:
|
postCondExpOf
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
(String, String) -> [(Prelude.Int, FlatCurry.Types.TypeExpr)]
-> Control.Monad.Trans.State.StateT TransState.TransState (Control.Monad.Trans.State.StateT VerifierState.VState Prelude.IO) 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
|