AntiUnifySystem
)
and its sub-algorighm PermEquivSystem
.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 and testing alpha
equivalence with also allowing eta expansion.
|
AntiUnifyProblem |
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.
|
AntiUnifySystem |
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 |
PermEquiv |
This class encapsulates the rule based system PermEquivSystem.
|
PermEquivProblem |
This class represents a matching problem of two TermNodes.
|
PermEquivSystem |
This class represents a rule based system for computing a bijection by
variable permutation between two terms.
|
Substitution |
This class represents a substitution, which is a mapping from variables to
terms.
It is used inside the rule based system AntiUnifySystem to compute generalizations for given AntiUnifyProblems. |
Enum | Description |
---|---|
DebugLevel |
Enumeration with 5 different levels of debugging.
|
Exception | Description |
---|---|
JustificationException |
This ControlledException is thrown if the justification of the
computed generalization fails.
|
AntiUnifySystem
)
and its sub-algorighm PermEquivSystem
.