| definition: |
loNStrategy :: Eq f => NStrategy f
loNStrategy trs t =
let ns = stdNStrategy trs t
in [n | n@(p, _, _) <- ns,
all (\p' -> not (above p' p || leftOf p' p))
[p' | (p', _, _) <- ns, p' /= p]]
|
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- The leftmost outermost narrowing strategy. |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_) |-> _}
|
| name: |
loNStrategy |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Prelude.Eq a => [(Rewriting.Term.Term a, Rewriting.Term.Term a)] -> Rewriting.Term.Term a -> [([Prelude.Int], (Rewriting.Term.Term a, Rewriting.Term.Term a), Data.Map.Map Prelude.Int (Rewriting.Term.Term a))] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |