|
definition:
|
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
|
|
demand:
|
argument 3
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
-- 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.
|
|
failfree:
|
(_, _, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,{[]}) |-> {:} || (_,_,{:}) |-> {:}}
|
|
name:
|
insertSemEq
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{:}
|
|
signature:
|
Prelude.Ord a => SemEq a -> [SemEq a] -> [SemEq a]
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|