|
definition:
|
parRStrategy :: Eq f => (Pos -> Pos -> Ordering) -> RStrategy f
parRStrategy cmp trs t = case redexes trs t of
[] -> []
ps@(_:_) -> head (groupBy g (sortBy s ps))
where
g :: Pos -> Pos -> Bool
g p q = (cmp p q) == EQ
s :: Pos -> Pos -> Bool
s p q = (cmp p q) /= GT
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Returns a parallel reduction strategy according to the given ordering
--- function.
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_,_) |-> _}
|
|
name:
|
parRStrategy
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Prelude.Eq a => ([Prelude.Int] -> [Prelude.Int] -> Prelude.Ordering)
-> [(Rewriting.Term.Term a, Rewriting.Term.Term a)] -> Rewriting.Term.Term a
-> [[Prelude.Int]]
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|