| definition: |
narrowBy :: NStrategy f -> TRS f -> Int -> Term f -> [(Subst f, Term f)]
narrowBy s trs n t | n <= 0 = []
| otherwise = let v = maybe 0 (+ 1) (maxVarInTerm t)
in narrowBy' v emptySubst s trs n t
|
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
Narrows a term with the given strategy and term rewriting system by the given number of steps. |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_,_) |-> _}
|
| name: |
narrowBy |
| 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 -> [(Data.Map.Map Prelude.Int (Rewriting.Term.Term a), 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 |