Lazy AC-Pattern Matching for Rewriting

Walid Belkhir 1, 2 Alain Giorgetti 1, 2
2 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : 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
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-00756343
Contributor : Alain Giorgetti <>
Submitted on : Thursday, November 22, 2012 - 6:34:45 PM
Last modification on : Tuesday, December 18, 2018 - 4:38:25 PM

Links full text

Identifiers

Citation

Walid Belkhir, Alain Giorgetti. Lazy AC-Pattern Matching for Rewriting. 10th International Workshop on Reduction Strategies in Rewriting and Programming, May 2011, Novi Sad, Serbia. pp.37-51, ⟨10.4204/EPTCS.82.3⟩. ⟨hal-00756343⟩

Share

Metrics

Record views

399