| definition: |
wnNStrategy :: Eq f => NStrategy f
wnNStrategy trs t =
let dts = defTrees trs
v = fromMaybe 0 (minVarInTRS trs)
in case loDefTrees dts t of
Nothing -> []
Just (_, []) -> []
Just (p, dt:_) -> [(p .> q, r, sub) |
(q, r, sub) <- wnNStrategy' dts v (t |> p) dt]
|
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- The weakly needed narrowing strategy. |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_) |-> _}
|
| name: |
wnNStrategy |
| 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 |