|
definition:
|
composeSubst :: Subst f -> Subst f -> Subst f
composeSubst phi sigma = Map.union phi (Map.mapWithKey (\_ t -> applySubst phi t) sigma)
|
|
demand:
|
arguments 1 2
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Composes the first substitution `phi` with the second substitution
--- `sigma`. The resulting substitution `sub` fulfills the property
--- `sub(t) = phi(sigma(t))` for a term `t`. Mappings in the first
--- substitution shadow those in the second.
|
|
failfree:
|
(_, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_) |-> _}
|
|
name:
|
composeSubst
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Data.Map.Map Prelude.Int (Rewriting.Term.Term a)
-> Data.Map.Map Prelude.Int (Rewriting.Term.Term a)
-> Data.Map.Map Prelude.Int (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
|