unification 0.1.3

unification

A first-order unification procedure unify is given by this library. It
can be applied on two terms of type Termtype that are also given by the
library.

The solution of a unification problem is a substitution, that is,
a mapping assigning a symbolic value to each variable of the problem's expressions.

The unification procedure reports unsolvability for a given problem or
computes the complete and minimal substitution set containing the
most general unifier. This is a set covering all solutions containing
no redundant members.