|
definition:
|
reduceAt :: Eq f => TRS f -> Pos -> Term f -> Term f
reduceAt [] _ t = t
reduceAt (x:rs) p t = case unify [(l, tp)] of
Left _ -> reduceAt rs p t
Right s | tp == applySubst s l -> replaceTerm t p (applySubst s r)
| otherwise -> reduceAt rs p t
where
tp = t |> p
(l, r) = maybe x (\v -> renameRuleVars (v + 1) x) (maxVarInTerm tp)
|
|
demand:
|
arguments 2 4
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Reduces a term with the given term rewriting system at the given redex
--- position.
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,{[]},_,_) |-> _ || (_,{:},_,_) |-> _}
|
|
name:
|
reduceAt
|
|
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
|