paper

Lazy AC-Pattern Matching for Rewriting

arXiv:1204.5543 · doi:10.4204/EPTCS.82.3

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.

In Proceedings WRS 2011, arXiv:1204.5318

Lazy AC-Pattern Matching for Rewriting · wovepaper