Anti-unification algorithms and their applications in program analysis by Bulychev, P, Kostylev, E, Zakharov, V

“…We believe that anti-unification algorithms may have wide applications in program analysis. …”

Type inference and strong static type checking for Promela by Donaldson, A, Gay, S

“…To handle subtyping between base types, we present an extension to a standard unification algorithm to solve a system of equality and subtyping constraints, based on bounded substitutions.…”

Parallel algorithms for free and associative-commutative unification by Hains, G

“…The use of compact terms greatly simplifies free term matching and gives rise to a linear-time algorithm with lower processing overheads than the Paterson-Wegman unification algorithm. A sublinear-time solution to the same problem is also given, assuming preloaded data. …”