Compilation techniques for associative-commutative normalisation

Authors:
Pierre-Etienne Moreau;Hélène Kirchner
Affiliations:
LORIA & UHP, Villers-les-Nancy Cedex, France;LORIA & CNRS, Villers-les-Nancy Cedex, France
Venue:
Algebraic'97 Proceedings of the 2nd international conference on Theory and Practice of Algebraic Specifications
Year:
1997

Citing 8
Cited 4

Completion of a set of rules modulo a set of equations

SIAM Journal on Computing
Complexity of matching problems

Journal of Symbolic Computation
An introduction to OBJ 3

1st international workshop on Conditional Term Rewriting Systems
Left-to-right tree pattern matching

RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
OPAL: design and implementation of an algebraic programming language

Proceedings of the international conference on Programming languages and system architectures
Complete Sets of Reductions for Some Equational Theories

Journal of the ACM (JACM)
Associative-Commutative Discrimination Nets

TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
A Compiler for Nondeterministic Term Rewriting Systems

RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications

Single Elementary Associative-Commutative Matching

Journal of Automated Reasoning
Rewriting logic: roadmap and bibliography

Theoretical Computer Science - Rewriting logic and its applications
Rule-Based Constraint Programming

Fundamenta Informaticae
Building Constraint Satisfaction Problem Solvers Using Rewrite Rules and Strategies

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider 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 method, illustrated on three examples, is based on compact bipartite graphs, and is designed for working very efficiently on specific classes of AC patterns. Our experimental results provide strong evidence that compilation of many-to-one AC normalisation is a useful technique for improving the performance of algebraic programming languages.