Narciso Martí-Oliet

TL;DR: This chapter discusses core Maude, a Hierarchy of Data Types: From Trees to Sets to Sets, and Object-Based Programming, which specifies Parameterized Data Structures in Maude.

TL;DR: The paper outlines the principles underlying the Maude system implementation, including its semicompilation techniques, and 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.

TL;DR: Maude 2.0 as discussed by the authors is the most recent version of the Maude system, which supports rewriting logic and membership equational logic, operational semantics issues, new built-in modules, the more general Full Maude module algebra, the new META-LEVEL module, the LTL model checker, and new implementation techniques yielding substantial performance improvements in rewriting modulo.

TL;DR: The frontiers between logical systems, theorem provers, and declarative programming languages are shifting and becoming more and more tenuous, with each area influencing and being influenced by the others.

TL;DR: The theory and applications of rewriting logic have been vigorously developed by researchers all over the world during the past eleven years and several language implementations and a variety of formal tools have been developed and have been used in a wide range of applications.