|
definition:
|
reduceAtL :: Eq f => TRS f -> [Pos] -> Term f -> Term f
reduceAtL _ [] t = t
reduceAtL trs (p:ps) t = reduceAtL trs ps (reduceAt trs p t)
|
|
demand:
|
arguments 3 4
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Reduces a term with the given term rewriting system at the given redex
--- positions.
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,{[]},_) |-> _ || (_,_,{:},_) |-> _}
|
|
name:
|
reduceAtL
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Prelude.Eq a => [(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
|