|
definition:
|
proveNonFailingFuncs :: TAProg -> VStateM ()
proveNonFailingFuncs prog = do
siblingconsinfo <- lift $ loadAnalysisWithImports siblingCons prog
mapM_ (proveNonFailingFunc siblingconsinfo) $ progFuncs prog
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
---------------------------------------------------------------------------
-- Prove that a list of defined functions is fail free (w.r.t. their
-- non-fail conditions).
|
|
indeterministic:
|
might be indeterministic
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_) |-> _}
|
|
name:
|
proveNonFailingFuncs
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
FlatCurry.Annotated.Types.AProg FlatCurry.Types.TypeExpr
-> Control.Monad.Trans.State.StateT VerifierState.VState Prelude.IO ()
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|