|
definition:
|
runFixpointWL :: Eq a => ADom a -> (SemEq a -> SemEq a -> Bool) -> [Rule]
-> [(String,[a])] -> Bool
-> IO (SemInt a)
runFixpointWL adom lessSpecificEq rules maincalls withprint = do
garbageCollect
pi1 <- getProcessInfos
finals <- processWorkList adom lessSpecificEq withprint rules
maincalls (Table.empty (<=))
pi2 <- getProcessInfos
printTiming pi1 pi2
return finals
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
-- run a fixpoint computation with working lists starting form a given
-- list of abstract function calls:
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_,_,_,_) |-> _}
|
|
name:
|
runFixpointWL
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Prelude.Eq a => ADom a -> (SemEq a -> SemEq a -> Prelude.Bool) -> [TRS.Rule]
-> [(String, [a])] -> Prelude.Bool -> Prelude.IO [SemEq a]
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|