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 条
[1]  
Abrial J., 2005, The B-book: Assigning Programs to Meanings
[2]  
ALVARADO C, 2000, P 2 WORKSH LOG FRAM
[3]  
ARTS T, 1997, THESIS U UTRECHT
[4]  
Baader F., 1998, Term Rewriting and All That
[5]   BASIC PARAMODULATION [J].
BACHMAIR, L ;
GANZINGER, H ;
LYNCH, C ;
SNYDER, W .
INFORMATION AND COMPUTATION, 1995, 121 (02) :172-192
[6]  
BACHMAIR L, 1993, LECT NOTES COMPUTER, V668, P61
[7]  
BARENDREGT H, 2002, IN PRESS J SYMBOLIC
[8]  
BEFFARA E, 2001, P BISFAI 2001 TEL AV
[9]   COMPLEXITY OF MATCHING PROBLEMS [J].
BENANAV, D ;
KAPUR, D ;
NARENDRAN, P .
JOURNAL OF SYMBOLIC COMPUTATION, 1987, 3 (1-2) :203-216
[10]  
Borovansky P., 2001, International Journal of Foundations of Computer Science, V12, P69, DOI 10.1142/S0129054101000412