A Class of Rewriting Rules and Reverse Transformation for Rule-based Equivalent Transformation
A Class of Rewriting Rules and Reverse Transformation for Rule-based Equivalent Transformation
复制标题
基于规则的等价变换的一类重写规则和逆向变换
DOI：
10.1016/s1571-0661(04)00291-9
复制
发表时间：
2001
影响因子：
2.4
通讯作者：
H. Koike
中科院分区：
文献类型：
--
作者：
K. Akama;Ekawit Nantajeewarawat;H. Koike
在基于规则的等效转换（RBET）范式中，计算基于声明性描述的意义保持转换，一组重写规则被视为程序。确定了一大类重写规则的语法。两种不同类型的元变量的合并使得能够精确控制重写规则实例化。结果，重写规则的适用性和规则应用的结果可以被严格地指定。为证明重写规则的正确性建立了理论基础。讨论了RBET框架中的逆变换操作，证明了正确的重写规则是可逆的，即，通常可以通过在语法上颠倒另一个正确的重写规则来构造正确的重写规则。
In the rule-based equivalent transformation (RBET) paradigm, where computation is based on meaning-preserving transformation of declarative descriptions, a set of rewriting rules is regarded as a program. The syntax for a large class of rewriting rules is determined. The incorporation of meta-variables of two different kinds enables precise control of rewriting-rule instantiations. As a result, the applicability of rewriting rules and the results of rule applications can be rigorously specified. A theoretical basis for justifying the correctness of rewriting rules is established. Reverse transformation operation in the RBET framework is discussed, and it is shown that a correct rewriting rule is reversible, i.e., a correct rewriting rule can in general be constructed by syntactically reversing another correct rewriting rule.