Equational rules for rewriting logic

被引：71

作者：

Viry, P ^{[1
]}

机构：

[1] ASTEM RI, Kyoto 6008813, Japan

来源：

THEORETICAL COMPUTER SCIENCE | 2002年 / 285卷 / 02期

关键词：

rewriting; equational programming; coherence; building-in equality;

D O I：

10.1016/S0304-3975(01)00366-8

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In addition to equations and rules, we introduce equational rules that are oriented while having an equational interpretation. Correspondence between operational behavior and intended semantics is guaranteed by a property of coherence, which can be checked by examination of critical pairs and linearity conditions. We present applications of this theory to three examples where the rewrite relation is interpreted, respectively, as equality, transition and deduction. 2002 Elsevier Science B.V. All rights reserved.

引用

页码：487 / 517

页数：31