This class encapsulates the rule based system AntiUnifySystem
and allows to justify the result by back substitution of the generalization
with the reported differences inside the computed store and testing alpha
equivalence with also allowing eta expansion.
This class represents an anti-unification problem (AUP) which consists of one
generalization variable (the most general generalization), a list of
abstracted bound variables and an anti-unification equation.
This class represents a rule based system for (a variant of) higher-order
anti-unification.
The algorithm P is described in the paper: Alexander Baumgartner, Temur Kutsia, Jordi Levy and Mateu Villaret, A Variant of
Higher-Order Anti-Unification
This package contains the classes which are needed to build up the term tree
and the DataStructureFactory which
instantiates common data structures like Lists,
Maps, Sets.