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