A Certified AC Matching Algorithm

  • Evelyne Contejean
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3091)


In this paper, we propose a matching algorithm for terms containing some function symbols which can be either free, commutative or associative-commutative. This algorithm is presented by inference rules and these rules have been formally proven sound and complete, and decreasing in the COQ proof assistant while the corresponding algorithm is implemented in the CiME system. Moreover some preparatory work has been done in COQ, such as proving that checking the equality of two terms modulo some commutative and associative-commutative theories is decidable.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bachmair, L., Chen, T., Ramakrishnan, I.V.: Associative-commutative discrimination nets. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol. 668, pp. 61–74. Springer, Heidelberg (1993)Google Scholar
  2. 2.
    Chen, T., Anantharaman, S.: Storm: A many-to-one associative-commutative matcher. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol. 914, Springer, Heidelberg (1995)Google Scholar
  3. 3.
    Christian, J.: Flatterms, Discrimination Nets, and Fast Term Rewriting. Journal of Automated Reasoning 10(1), 95–113 (1993)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 243–320. North-Holland, Amsterdam (1990)Google Scholar
  5. 5.
    Eker, S.: Associative-Commutative Matching Via Bipartite Graph Matching. Computer Journal 38(5), 381–399 (1995)CrossRefGoogle Scholar
  6. 6.
    Hullot, J.-M.: Associative commutative pattern matching. In: Proc. 6th IJCAI, Tokyo, August 1979, vol. I, pp. 406–412 (1979)Google Scholar
  7. 7.
    Kounalis, E., Lugiez, D.: Compiling pattern matching with associative- commutative functions. In: Abramsky, S., Maibaum, T.S.E. (eds.) CAAP 1991 and TAPSOFT 1991. LNCS, vol. 493, pp. 57–73. Springer, Heidelberg (1991)Google Scholar
  8. 8.
    Moreau, P.-E., Kirchner, H.: A Compiler for Rewrite Programs in Associative-Commutative Theories. In: Palamidessi, C., Meinke, K., Glaser, H. (eds.) ALP 1998 and PLILP 1998. LNCS, vol. 1490, pp. 230–249. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  9. 9.
    The Coq Development Team. The Coq Proof Assistant Reference Manual – Version V7.4 (January 2003),

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Evelyne Contejean
    • 1
  1. 1.LRI, CNRS UMR 8623 & LogiCal Project, INRIA Futurs Bât. 490Université Paris-Sud, Centre d’OrsayOrsay CedexFrance

Personalised recommendations