| definition: |
eqSemInt :: Eq a => SemInt a -> SemInt a -> Bool eqSemInt = (==) |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
-- generic equality on interpretations (note that equations are kept ordered) |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_) |-> {_impl#==#Prelude.Eq#[]#0##}}
|
| name: |
eqSemInt |
| precedence: |
no precedence defined |
| result-values: |
{_impl#==#Prelude.Eq#[]#0##}
|
| signature: |
Prelude.Eq a => [SemEq a] -> [SemEq a] -> Prelude.Bool |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
reducible on all ground data terms |