Maude:: Specification and programming in rewriting logic

被引:305
作者
Clavel, M
Durán, F
Eker, S
Lincoln, P
Martí-Oliet, N
Meseguer, J
Quesada, JF
机构
[1] Univ Complutense, Fac Matemat, E-28040 Madrid, Spain
[2] SRI Int, Comp Sci Lab, Menlo Pk, CA 94025 USA
[3] Univ Malaga, ETSI Informat, E-29071 Malaga, Spain
[4] Univ Navarra, Dep Filosofia, Navarra, Spain
[5] Ctr Informat Cientif Andalucia, Seville, Spain
基金
美国国家航空航天局; 美国国家科学基金会;
关键词
Maude; rewriting logic; functional modules; system modules; parameterization; reflection; internal strategies;
D O I
10.1016/S0304-3975(01)00359-0
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Maude is a high-level language and a high-performance system supporting executable specification and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational specification and programming in its sublanguage of functional modules and theories. The underlying equational logic chosen for Maude is membership equational logic, that has sorts, subsorts, operator overloading, and partiality definable by membership and equality conditions. Rewriting logic is reflective, in the sense of being able to express its own metalevel at the object level. Reflection is systematically exploited in Maude endowing the language with powerful metaprogramming capabilities, including both user-definable module operations and declarative strategies to guide the deduction process. This paper explains and illustrates with examples the main concepts of Maude's language design, including its underlying logic, functional, system and object-oriented modules, as well as parameterized modules, theories, and views. We also explain how Maude supports reflection, metaprogramming and internal strategies. The paper outlines the principles underlying the Maude system implementation, including its semicompilation techniques. We conclude with some remarks about applications, work on a formal environment for Maude, and a mobile language extension of Maude. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:187 / 243
页数:57
相关论文
共 64 条
[1]  
[Anonymous], ELECT NOTES THEORETI, DOI [DOI 10.1016/S1571-0661(04)00034-9, 10.1016/S1571-0661(04)00034-9]
[2]  
[Anonymous], 2000, ELECTRON NOTES THEOR
[3]  
[Anonymous], ELECT NOTES THEORETI
[4]  
Astesiano E., 1999, ALGEBRAIC FDN SYSTEM, Vfirst
[5]  
Basin D, 2000, LECT NOTES COMPUT SC, V1974, P55
[6]  
BERGSTRA JA, 1980, SPRINGER LECT NOTES, V81, P76
[7]  
BOROVANSKY P, 1998, 2 INT WORKSH THEOR P
[8]  
BOROVANSKY P, 1998, ELECT NOTES THEORETI, V15, P329
[9]  
Borovansky P., 1996, ELECT NOTES THEORETI, V4, P35, DOI [DOI 10.1016/S1571-0661(04)00032-5.FIRSTINTERNATIONALWORKSHOPONREWRITINGLOGICANDITSAPPLICATIONS(RWLW96, 10.1016/S1571-0661(04)00032-5]
[10]  
BOROVANSKY P, 1996, ELECT NOTES THEORETI, V4, P168