Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Chen, T., Anantharaman, S.: Storm: A many-to-one associative-commutative matcher. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol. 914, Springer, Heidelberg (1995)
Christian, J.: Flatterms, Discrimination Nets, and Fast Term Rewriting. Journal of Automated Reasoning 10(1), 95–113 (1993)
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)
Eker, S.: Associative-Commutative Matching Via Bipartite Graph Matching. Computer Journal 38(5), 381–399 (1995)
Hullot, J.-M.: Associative commutative pattern matching. In: Proc. 6th IJCAI, Tokyo, August 1979, vol. I, pp. 406–412 (1979)
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)
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)
The Coq Development Team. The Coq Proof Assistant Reference Manual – Version V7.4 (January 2003), http://coq.inria.fr
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Contejean, E. (2004). A Certified AC Matching Algorithm. In: van Oostrom, V. (eds) Rewriting Techniques and Applications. RTA 2004. Lecture Notes in Computer Science, vol 3091. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25979-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-25979-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22153-1
Online ISBN: 978-3-540-25979-4
eBook Packages: Springer Book Archive