CurryInfo: rewriting-3.0.0 / Rewriting.Narrowing.narrowingBy
definition: 
|
narrowingBy :: NStrategy f -> TRS f -> Int -> Term f -> [Narrowing f]
narrowingBy s trs n t | n <= 0 = []
| otherwise = let v = maybe 0 (+ 1) (maxVarInTerm t)
in narrowingBy' v emptySubst s trs n t
|
|
demand:
|
no demanded arguments |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Returns a list of narrowings for a term with the given strategy, the given term rewriting system and the given number of steps. |
|
failfree:
|
<FAILING> |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,_,_,_) |-> _}
|
|
name:
|
narrowingBy |
|
precedence:
|
no precedence defined |
|
result-values:
|
_ |
|
signature:
|
([(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))]) -> [(Rewriting.Term.Term a, Rewriting.Term.Term a)] -> Prelude.Int -> Rewriting.Term.Term a -> [Narrowing a] |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
possibly non-reducible on same data term |