|
definition:
|
roRStrategy :: Eq f => RStrategy f
roRStrategy = seqRStrategy roOrder
where
roOrder :: Pos -> Pos -> Ordering
roOrder p q | p == q = EQ
| rightOf p q = LT
| above p q = LT
| otherwise = GT
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- The rightmost outermost reduction strategy.
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_) |-> {seqRStrategy}}
|
|
name:
|
roRStrategy
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{seqRStrategy}
|
|
signature:
|
Prelude.Eq a => [(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
|