Abstract | ||
---|---|---|
Maude is a high-level language and a high-performance system supporting executable specification and declarative programming in rewriting logic. 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 strategies and user-definable interfaces. In this paper we first summarize the main reflective capabilities of Maude, and then we explain their use in a non-trivial interactive metaprogramming application: an inductive theorem prover for Maude implemented in Maude itself. |
Year | DOI | Venue |
---|---|---|
2003 | 10.1016/S1571-0661(05)82612-X | Electronic Notes in Theoretical Computer Science |
Keywords | Field | DocType |
Reflection,strategies,user interfaces,Maude | Metaprogramming,Programming language,Computer science,Automated theorem proving,Theoretical computer science,Rewriting,Declarative programming,User interface,Executable | Journal |
Volume | Issue | ISSN |
86 | 4 | 1571-0661 |
Citations | PageRank | References |
1 | 0.35 | 4 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Manuel Clavel | 1 | 1061 | 66.26 |