CurryInfo: rewriting-3.0.0 / Rewriting.Position.disjoint
definition: 
|
disjoint :: Pos -> Pos -> Bool disjoint p q = not (above p q || below p q) |
|
demand:
|
no demanded arguments |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Checks whether two positions are disjoint. |
|
failfree:
|
(_, _) |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,_) |-> {False,True}}
|
|
name:
|
disjoint |
|
precedence:
|
no precedence defined |
|
result-values:
|
{False,True}
|
|
signature:
|
[Prelude.Int] -> [Prelude.Int] -> Prelude.Bool |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
reducible on all ground data terms |