Recursively looks for a Substitution σ such that for each (a, b) ∈ pairs, σ(a) = b.
Recursively looks for a Substitution σ such that for each (a, b) ∈ pairs, σ(a) = b.
A list of pairs of expressions.
The partial substitution which is already fixed, and can no longer be changed.