Unification in combinations of collapse-free regular theories
Journal of Symbolic Computation
Unification in a combination of arbitrary disjoint equational theories
Journal of Symbolic Computation
Matching - A special case of unification?
Journal of Symbolic Computation
Handbook of theoretical computer science (vol. B)
Combining matching algorithms: The regular case
Journal of Symbolic Computation
Combining unification algorithms
Journal of Symbolic Computation
Combining decision algorithms for matching in the union of disjoint equational theories
Information and Computation
Unification in the union of disjoint equational theories: combining decision procedures
Journal of Symbolic Computation
Matching with Free Function Symbols - A Simple Extension of Matching?
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Matching with Free Function Symbols - A Simple Extension of Matching?
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
| Hi-index | 0.00 |
Matching is a solving process which is crucial in declarative (rule-based) programming languages. In order to apply rules, one has to match the left-hand side of a rule with the term to be rewritten. In several declarative programming languages, programs involve operators that may also satisfy some structural axioms. Therefore, their evaluation mechanism must implement powerful matching algorithms working modulo equational theories. In this paper, we show the existence of an equational theory where matching is decidable (resp. finitary) but matching in presence of additional (free) operators is undecidable (resp. infinitary). The interest of this result is to easily prove the existence of a frontier between matching and matching with free operators.