ELAN from a rewriting logic point of view

被引:81
作者
Borovansky, P [1 ]
Kirchner, C
Kirchner, H
Moreau, PE
机构
[1] Comenius Univ, Bratislava 84215, Slovakia
[2] CNRS, LORIA, F-54506 Vandoeuvre Les Nancy, France
[3] INRIA, F-54506 Vandoeuvre Les Nancy, France
关键词
computational system; conditional rewriting logic; strategy theory; rule-based programming; rewriting calculus;
D O I
10.1016/S0304-3975(01)00358-9
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or to describe and execute deterministic as well as non-deterministic rule-based processes. With the general goal to make precise a rewriting logic-based semantics of ELAN, this paper has three contributions: a presentation of the concepts of rules and strategies available in ELAN, an expression of rewrite rules with matching conditions in conditional rewriting logic, and finally an enrichment mechanism of a rewrite theory into a strategy theory in conditional rewriting logic. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:155 / 185
页数:31
相关论文
共 73 条
[21]  
CASTRO C, 1998, LECT NOTES ARTIFICIA, V1476
[22]  
CIRSTEA H, 1998, P WORKSH STRAT AUT D
[23]  
Cirstea H., 1999, FRONTIERS COMBINING, P95
[24]  
Cirstea H., 2001, LECT NOTES COMPUTER, P166
[25]  
CIRSTEA H, 2001, LOG J IGPL, V9, P427, DOI DOI 10.1093/JIGPAL/9.3.339
[26]  
Cirstea H., 2001, LECT NOTES COMPUTER, V2051, P77
[27]  
CIRSTEA H, 2001, LECT NOTES COMPUTER, V1990, P138
[28]  
CIRSTEA H, 2000, THESIS U H POINCARE
[29]  
CIRSTEA H, 2000, ELECT NOTES THEORETI
[30]  
CLAVEL M, 1998, ELECT NOTES THEORETI, V15, P3