Equational rules for rewriting logic

被引:71
作者
Viry, P [1 ]
机构
[1] ASTEM RI, Kyoto 6008813, Japan
关键词
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
相关论文
共 43 条
[31]  
MESEGUER J, 1993, RES DIRECTIONS OBJEC
[32]  
Milner R., 1989, INT SERIES COMPUTER
[33]  
MILNER R, 1991, ECSLFCS91180 U ED
[34]   COMPLETE-SETS OF REDUCTIONS FOR SOME EQUATIONAL THEORIES [J].
PETERSON, GE ;
STICKEL, ME .
JOURNAL OF THE ACM, 1981, 28 (02) :233-264
[35]  
RUBIO A, 1995, LECT NOTES COMPUTER, V944
[36]  
RUBIO A, 1995, LECT NOTES COMPUTER, V1092
[37]  
Viry P., 1992, THESIS U NANCY 1
[38]  
VIRY P, 1996, ELECT NOTES THEORETI, V4
[39]  
VIRY P, 1995, TR2095 U PIS
[40]  
VIRY P, 1994, LECT NOTES COMPUTER, V817