|
definition:
|
reduceBy :: Eq f => RStrategy f -> TRS f -> Int -> Term f -> Term f
reduceBy s trs n t | n <= 0 = t
| otherwise = case s trs t of
[] -> t
ps@(_:_) -> reduceBy s trs (n - 1) (reduceAtL trs ps t)
|
|
demand:
|
argument 5
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Reduces 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:
|
reduceBy
|
|
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)] -> 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
|