CurryInfo: rewriting-3.0.0 / Rewriting.Position.disjoint

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