| definition: |
inferNFCs :: String -> ProgInfo (TypeDecl, [Constructor]) -> VStateM ()
inferNFCs modname pinfo = do
vstate <- get
let infconds = nub (inferNFConds modname pinfo (allFuncs ti))
ti = trInfo vstate
ti' = ti
{ allFuncs = allFuncs ti ++ infconds -- TODO: remove duplicate NFCs
, nfConds = nfConds ti ++ infconds
}
line = replicate 78 '-'
put vstate { trInfo = ti' }
addNFCsToProgs infconds
printWhenAll
$ unlines
$ ["INFERRED NON-FAILURE CONDITIONS:", line]
++ map (('\n' :) . showFuncDeclAsFlatCurry . unAnnFuncDecl) infconds
++ [line]
checkProgs
|
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> _}
|
| name: |
inferNFCs |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
String -> Analysis.ProgInfo.ProgInfo (FlatCurry.Types.TypeDecl, [((String, String), Prelude.Int)]) -> Control.Monad.Trans.State.StateT VState Prelude.IO () |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |