Lazy AC-Pattern Matching for Rewriting - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Lazy AC-Pattern Matching for Rewriting


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

Dates and versions

hal-00756343 , version 1 (22-11-2012)



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



Gmail Facebook Twitter LinkedIn More