CurryInfo: rewriting-3.0.0 / Rewriting.Strategy.reduceByL

definition:
 
reduceByL :: Eq f => RStrategy f -> [TRS f] -> Int -> Term f -> Term f
reduceByL s trss = reduceBy s (concat trss)
demand:
 no demanded arguments
deterministic:
 deterministic operation
documentation:
 
Reduces a term with the given strategy and list of term rewriting systems
by the given number of steps.
failfree:
 <FAILING>
indeterministic:
 referentially transparent operation
infix:
 no fixity defined
iotype:
 {(_,_,_) |-> {reduceBy}}
name:
 reduceByL
precedence:
 no precedence defined
result-values:
 {reduceBy}
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