CurryInfo: call-analysis-3.2.0 / Analysis.insertSemEq

 
insertSemEq :: Ord a => SemEq a -> SemInt a -> SemInt a
insertSemEq x []     = [x]
insertSemEq x (y:ys) | x == y    = y : ys
                     | x <= y    = x : y : ys
                     | otherwise = y : insertSemEq x ys

 argument 3

 deterministic operation

 
Generic ordered insertion of semantic equations into an interpretation.
The first argument is some ordering on terms (compatible with the
information ordering on terms). An equation is not inserted
if it is already there, i.e., the interpretation is managed as a set.

 (_, _, _)

 referentially transparent operation

 no fixity defined

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

 insertSemEq

 no precedence defined

 {:}

 Prelude.Ord a => SemEq a -> [SemEq a] -> [SemEq a]

 operation might suspend on free variables

 possibly non-terminating

 possibly non-reducible on same data term