A Compiler for Rewrite Programs in Associative-Commutative Theories - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1998

A Compiler for Rewrite Programs in Associative-Commutative Theories


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.
No file

Dates and versions

inria-00098451 , version 1 (25-09-2006)


  • 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⟩
81 View
0 Download


Gmail Facebook Twitter LinkedIn More