Matching with Free Function Symbols — A Simple Extension of Matching?

  • Christophe Ringeissen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2051)


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.


Normal Form Transformation Rule Function Symbol Equational Theory Combination Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    F. Baader and K. U. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. JSC, 21(2):211–243, February 1996.MATHMathSciNetGoogle Scholar
  2. 2.
    A. Boudet. Combining unification algorithms. JSC, 16(6):597–626, 1993.MATHMathSciNetGoogle Scholar
  3. 3.
    H.-J. Bürckert. Matching — A special case of unification? JSC, 8(5):523–536, 1989.MATHGoogle Scholar
  4. 4.
    N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 6, pages 244–320. Elsevier Science Publishers B. V. (North-Holland), 1990.Google Scholar
  5. 5.
    S. Eker. Fast matching in combination of regular equational theories. In J. Meseguer, editor, First Intl. Workshop on Rewriting Logic and its Applications, volume 4. Electronic Notes in Theoretical Computer Science, September 1996.Google Scholar
  6. 6.
    J.-P. Jouannaud and Claude Kirchner. Solving equations in abstract algebras: a rule-based survey of unification. In Jean-Louis Lassez and G. Plotkin, editors, Computational Logic. Essays in honor of Alan Robinson, chapter 8, pages 257–321. The MIT press, Cambridge (MA, USA), 1991.Google Scholar
  7. 7.
    C. Kirchner and H. Kirchner, editors. Second Intl. Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, Pont-à-Mousson (France), September 1998. Elsevier.Google Scholar
  8. 8.
    T. Nipkow. Combining matching algorithms: The regular case. JSC, 12:633–653, 1991.MATHMathSciNetGoogle Scholar
  9. 9.
    Ch. Ringeissen. Combining decision algorithms for matching in the union of disjoint equational theories. Information and Computation, 126(2):144–160, May 1996.MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Ch. Ringeissen. Matching with Free Function Symbols — A Simple Extension of Matching? (Full Version), 2001. Available at:
  11. 11.
    M. Schmidt-Schauβ. Unification in a Combination of Arbitrary Disjoint Equational Theories. JSC, 8(1 & 2):51–99, 1989.Google Scholar
  12. 12.
    P. Szabó. Unifikationstheorie erster Ordnung. PhD thesis, Universität Karlsruhe, 1982.Google Scholar
  13. 13.
    E. Tidén. First-order unification in combinations of equational theories. PhD thesis, The Royal Institute of Technology, Stockholm, 1986.MATHGoogle Scholar
  14. 14.
    K. Yelick. Unification in combinations of collapse-free regular theories. JSC, 3(1 & 2):153–182, April 1987.MATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Christophe Ringeissen
    • 1
  1. 1.LORIA — INRIAVillers-lés-Nancy CedexFrance

Personalised recommendations