| definition: |
getStartValues :: Analysis a -> Prog -> IO [(QName,a)]
getStartValues analysis prog =
if isSimpleAnalysis analysis
then return []
else do
let startvals = case analysis of
DependencyFuncAnalysis _ _ _ ->
map (\func->(funcName func,startValue analysis))
(progFuncs prog)
CombinedDependencyFuncAnalysis _ _ _ _ _ ->
map (\func->(funcName func,startValue analysis))
(progFuncs prog)
DependencyTypeAnalysis _ _ _ ->
map (\typeDecl->(typeName typeDecl,startValue analysis))
(progTypes prog)
CombinedDependencyTypeAnalysis _ _ _ _ _ ->
map (\typeDecl->(typeName typeDecl,startValue analysis))
(progTypes prog)
_ -> error "Internal error in WorkerFunctions.getStartValues"
return startvals
|
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
--- Compute the start (bottom) values for a dependency analysis. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> _}
|
| name: |
getStartValues |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Analysis.Types.Analysis a -> FlatCurry.Types.Prog -> Prelude.IO [((String, String), a)] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
reducible on all ground data terms |