|
definition:
|
proveNonFailingFuncs :: Options -> ProgInfo [(QName,Int)] -> IORef VState
-> [TAFuncDecl] -> IO ()
proveNonFailingFuncs opts siblingconsinfo vstref =
mapM_ (proveNonFailingFunc opts siblingconsinfo vstref)
|
|
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:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
name:
|
proveNonFailingFuncs
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{.._#lambda508}
|
|
signature:
|
ToolOptions.Options
-> Analysis.ProgInfo.ProgInfo [((String, String), Prelude.Int)]
-> Data.IORef.IORef VerifierState.VState
-> [FlatCurry.Annotated.Types.AFuncDecl FlatCurry.Types.TypeExpr]
-> Prelude.IO ()
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|