CurryInfo: call-analysis-3.2.0 / Analysis.callPatternAnalysis
definition: 
|
callPatternAnalysis :: Int -> Bool -> Bool -> String -> IO ()
callPatternAnalysis termdepth keepmax withwlist modname = do
rules <- readRules modname
let absdom = depthDom termdepth
maincalls = [abstractCall absdom (getMainCall rules)]
lessSpecificEq = lessSpecificEqCallPattern lessDSpecific
printProgram absdom rules maincalls
let seminsertion = if keepmax then updateSemEq lessSpecificEq
else insertSemEq
fpsem <- if not withwlist
then runFixpoint absdom seminsertion rules maincalls False eqSemInt
else runFixpointWL absdom lessSpecificEq rules maincalls False
putStrLn (showSemInt absdom (sort fpsem))
|
|
demand:
|
no demanded arguments |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Call pattern analysis with depth-k domain. |
|
failfree:
|
<FAILING> |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,_,_,_) |-> _}
|
|
name:
|
callPatternAnalysis |
|
precedence:
|
no precedence defined |
|
result-values:
|
_ |
|
signature:
|
Prelude.Int -> Prelude.Bool -> Prelude.Bool -> String -> Prelude.IO () |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
possibly non-reducible on same data term |