| definition: |
leqQName :: QName -> QName -> Bool leqQName (mod1,n1) (mod2,n2) = n1 <= n2 || n1==n2 && mod1 <= mod2 |
| demand: |
arguments 1 2 |
| deterministic: |
deterministic operation |
| documentation: |
-- order qualified names by basename first: |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({(,)},{(,)}) |-> _}
|
| name: |
leqQName |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
(String, String) -> (String, String) -> Prelude.Bool |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |