|
definition:
|
reductionBy :: Eq f => RStrategy f -> TRS f -> Int -> Term f -> Reduction f
reductionBy s trs n t
| n <= 0 = NormalForm t
| otherwise = case s trs t of
[] -> NormalForm t
ps@(_:_) -> let t' = reduceAtL trs ps t
in RStep t ps (reductionBy s trs (n - 1) t')
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Returns the reduction of 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:
|
{(_,_,_,_,_) |-> {NormalForm,RStep}}
|
|
name:
|
reductionBy
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{NormalForm,RStep}
|
|
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 -> Reduction a
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|