| definition: |
extractStrictness :: Eq a => ADom a -> SemInt a -> [(String,[Int])]
extractStrictness adom aint = map checkStrictArgs allfuncs
where
abot = adomBottom adom
allfuncs = nub (map (\ (Eq f args _) -> (f,length args)) aint)
checkStrictArgs (f,n) = (f,concatMap checkStrictArg [1..n])
where
checkStrictArg i =
let argibotEqs = filter (\ (Eq g args _) -> f==g && args!!(i-1) == abot)
aint
in if not (null argibotEqs) && all (\ (Eq _ _ r) -> r==abot) argibotEqs
then [i]
else []
|
| demand: |
argument 3 |
| deterministic: |
deterministic operation |
| documentation: |
-- extract list of strict arguments for each function from least fixpoint |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_) |-> {:,[]}}
|
| name: |
extractStrictness |
| precedence: |
no precedence defined |
| result-values: |
{:,[]}
|
| signature: |
Prelude.Eq a => ADom a -> [SemEq a] -> [(String, [Prelude.Int])] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |