|
definition:
|
proveNonFailingFunc :: Options -> ProgInfo [(QName,Int)] -> IORef VState
-> TAFuncDecl -> IO ()
proveNonFailingFunc opts siblingconsinfo vstref fdecl =
unless (isContractOp (funcName fdecl) || isProperty fdecl) $ do
printWhenIntermediate opts $
"Operation to be analyzed: " ++ snd (funcName fdecl)
modifyIORef vstref incNumAllInStats
let efdecl = etaExpandFuncDecl fdecl
proveNonFailingRule opts siblingconsinfo vstref
(funcName efdecl) (funcType efdecl)
(funcRule efdecl)
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
-- Prove that a function is fail free (w.r.t. their non-fail condition).
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
name:
|
proveNonFailingFunc
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
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
|