| definition: |
narrowingTreeBy :: NStrategy f -> TRS f -> Int -> Term f -> NarrowingTree f
narrowingTreeBy s trs n t
| n <= 0 = NTree t []
| otherwise = let v = maybe 0 (+ 1) (maxVarInTerm t)
in narrowingTreeBy' v emptySubst s trs n t
|
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Returns a narrowing tree 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: |
{(_,_,_,_) |-> {NTree}}
|
| name: |
narrowingTreeBy |
| precedence: |
no precedence defined |
| result-values: |
{NTree}
|
| 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 -> NarrowingTree a |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |