Skip to Main content Skip to Navigation
Conference papers

A Compiler for Rewrite Programs in Associative-Commutative Theories

Pierre-Etienne Moreau 1 Hélène Kirchner 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We address the problem of term normalisation modulo Associative-Commutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduced term construction. The proposed matching method is based on the construction of compact bipartite graphs, and is designed for working very efficiently on specific classes of AC patterns. We show how to refine this algorithm to work in an eager way. General patterns are handled through a program transformation process. Variable instantiation resulting from the matching phase and construction of the resulting term are also addressed. %To improve efficiency of %term normalisation modulo \AC, we propose a few solutions %to share parts of terms thanks to a suitable term representation, %or to avoid useless constructions in matching. Our experimental results with the system ELAN provide strong evidence that compilation of many-to-one AC normalisation using the combination of these few techniques is crucial for improving the performance of algebraic programming languages.
Document type :
Conference papers
Complete list of metadata
Contributor : Publications Loria <>
Submitted on : Monday, September 25, 2006 - 5:01:37 PM
Last modification on : Friday, February 26, 2021 - 3:28:06 PM


  • HAL Id : inria-00098451, version 1



Pierre-Etienne Moreau, Hélène Kirchner. A Compiler for Rewrite Programs in Associative-Commutative Theories. ALP/PLILP: Principles of Declarative Programming, Palamidessi, C. & Glaser, H. & Meinke, K., 1998, Pisa, Italy, pp.230-249. ⟨inria-00098451⟩



Record views