Lazy AC-Pattern Matching for Rewriting
Logic in Computer Science
2012-04-26 v1 Programming Languages
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.
Cite
@article{arxiv.1204.5543,
title = {Lazy AC-Pattern Matching for Rewriting},
author = {Walid Belkhir and Alain Giorgetti},
journal= {arXiv preprint arXiv:1204.5543},
year = {2012}
}
Comments
In Proceedings WRS 2011, arXiv:1204.5318