AntiUnifySystem
) to solve the nominal
anti-unification problem and an algorithm to solve the nominal
equivariance problem (EquivarianceSystem
)
which is needed by the anti-unification algorithm.See: Description
Class | Description |
---|---|
AntiUnify |
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.
|
AntiUnifyProblem |
This class represents an anti-unification problem (AUP) which consists of one
generalization variable (the most general generalization) and an
anti-unification Equation.
|
AntiUnifySystem |
This class represents a rule based system for Nominal Anti-Unificaion.
|
Equivariance |
This class encapsulates the rule based system EquivarianceSystem
and allows to justify the result by applying the computed permutation and
testing alpha equivalence.
|
EquivarianceProblem |
This class represents an equivariance problem (an equation of the form t = s)
of two NominalPairs.
|
EquivarianceSystem |
This class represents a rule based system to compute an equivariance
permutation for nominal terms by atom swapping.
|
Substitution |
This class represents a substitution, which is a mapping from variables to
nominal terms.
|
Enum | Description |
---|---|
DebugLevel |
Enumeration with 4 different levels for debugging.
|
Exception | Description |
---|---|
JustificationException |
This ControlledException is thrown if the justification of the
computed generalization fails.
|
AntiUnifySystem
) to solve the nominal
anti-unification problem and an algorithm to solve the nominal
equivariance problem (EquivarianceSystem
)
which is needed by the anti-unification algorithm. Solving the equivariance
problem is an interesting problem by itself and it can also be used to test
alpha equivalence.