CurryInfo: call-analysis-3.2.0 / Analysis.updateSemEq

 
updateSemEq :: Ord a => (SemEq a -> SemEq a -> Bool)
                     -> SemEq a -> SemInt a -> SemInt a
updateSemEq _              x []     = [x]
updateSemEq lessSpecificEq x (y:ys)
 | x == y             = y : ys
 | lessSpecificEq y x = updateSemEq lessSpecificEq x ys
 | lessSpecificEq x y = y : ys
 | x <= y             = x : y : ys
 | otherwise          = y : updateSemEq lessSpecificEq x ys

 argument 4

 deterministic operation

 
Generic ordered insertion of semantic equations into an interpretation
where existing equations with less information are removed from the
interpretation. Thus, the resulting interpretation contains
equations with more specific abstract values.
First argument: ordering relation on abstract terms (used to order
                all equations of the interpretation)
Second argument: less-specific ordering on equations

 (_, _, _, _)

 referentially transparent operation

 no fixity defined

 {(_,_,_,{[]}) |-> {:} || (_,_,_,{:}) |-> {:}}

 updateSemEq

 no precedence defined

 {:}

 Prelude.Ord a => (SemEq a -> SemEq a -> Prelude.Bool) -> SemEq a -> [SemEq a]
-> [SemEq a]

 operation might suspend on free variables

 possibly non-terminating

 possibly non-reducible on same data term