Lazy AC-Pattern Matching for Rewriting

Walid Belkhir
(University of Franche-Comté)
Alain Giorgetti
(University of Franche-Comté)

We define a lazy pattern-matching mechanism modulo associativity and commutativity. The solutions of a pattern-matching problem are stored in a lazy list composed of a first substitution at the head and a non-evaluated object that encodes the remaining computations. We integrate the lazy AC-matching in a strategy language: rewriting rule and strategy application produce a lazy list of terms.

In Santiago Escobar: Proceedings 10th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2011), Novi Sad, Serbia, 29 May 2011 , Electronic Proceedings in Theoretical Computer Science 82, pp. 37–51.
Published: 24th April 2012.

ArXived at: http://dx.doi.org/10.4204/EPTCS.82.3 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org