|
definition:
|
verifyPostConditions :: TAProg -> VStateM TAProg
verifyPostConditions prog = do
postconds <- gets $ postConds . trInfo
-- Operations with postcondition checks:
let fdecls = progFuncs prog
newfuns <- provePostConds postconds fdecls
return $ updProgFuncs (const newfuns) prog
where
provePostConds [] fdecls = return fdecls
provePostConds (pof : pofs) fdecls =
provePostCondition pof fdecls >>= provePostConds pofs
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
------------------------------------------------------------------------
-- Try to verify postconditions: If an operation `f` has a postcondition,
-- a proof for the validity of the postcondition is extracted.
-- If the proof is not successful, a postcondition check is added to `f`.
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_) |-> _}
|
|
name:
|
verifyPostConditions
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
FlatCurry.Annotated.Types.AProg FlatCurry.Types.TypeExpr
-> Control.Monad.Trans.State.StateT VerifierState.VState Prelude.IO (FlatCurry.Annotated.Types.AProg FlatCurry.Types.TypeExpr)
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|