|
definition:
|
applySubstEqs :: Subst f -> TermEqs f -> TermEqs f
applySubstEqs sub = map (applySubstEq sub)
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Applies a substitution to every term equation in the given list.
|
|
failfree:
|
_
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_) |-> {map}}
|
|
name:
|
applySubstEqs
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{map}
|
|
signature:
|
Data.Map.Map Prelude.Int (Rewriting.Term.Term a)
-> [(Rewriting.Term.Term a, 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
|