|
definition:
|
applySubst :: Subst f -> Term f -> Term f
applySubst sub t@(TermVar v) = fromMaybe t (lookupSubst sub v)
applySubst sub (TermCons c ts) = TermCons c (map (applySubst sub) ts)
|
|
demand:
|
argument 2
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Applies a substitution to the given term.
|
|
failfree:
|
(_, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,{TermVar}) |-> _ || (_,{TermCons}) |-> {TermCons}}
|
|
name:
|
applySubst
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Data.Map.Map Prelude.Int (Rewriting.Term.Term a) -> 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
|