文章基本信息

标题：Lazy AC-Pattern Matching for Rewriting
本地全文：下载
作者：Walid Belkhir ; Alain Giorgetti
期刊名称：Electronic Proceedings in Theoretical Computer Science
电子版ISSN：2075-2180
出版年度：2011
卷号：82
页码：37-51
DOI：10.4204/EPTCS.82.3
出版社：Open Publishing Association
摘要：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.