Difference between revisions of "Rewriting Logic"

From The Maude System
Jump to: navigation, search
Line 20: Line 20:
 
* [https://project.inria.fr/wrla18/ WRLA'18], Greece
 
* [https://project.inria.fr/wrla18/ WRLA'18], Greece
 
* [https://wrla2020.webs.upv.es/ WRLA'20], Ireland
 
* [https://wrla2020.webs.upv.es/ WRLA'20], Ireland
 +
 +
Several journal special issues have been published on rewriting logic:
 +
[https://www.sciencedirect.com/journal/theoretical-computer-science/vol/285/issue/2 TCS 285 (2002)],
 +
[https://link.springer.com/journal/10990/20/1/page/1 HOSC 20 (2007)]
 +
[https://www.sciencedirect.com/journal/the-journal-of-logic-and-algebraic-programming/vol/81 JLAMP 81 (2012)],
 +
[https://www.sciencedirect.com/journal/science-of-computer-programming/vol/99/ SCP 99 (2012)],
 +
[https://www.sciencedirect.com/journal/journal-of-logical-and-algebraic-methods-in-programming/vol/85/issue/1/part/P1 JLAMP 85 (2016)]
 +
[https://www.sciencedirect.com/journal/journal-of-logical-and-algebraic-methods-in-programming/vol/86/issue/1 JLAMP 86 (2017)],
 +
[https://www.sciencedirect.com/journal/journal-of-logical-and-algebraic-methods-in-programming/special-issue/10QHD3B3JSJ JLAMP 93 (2017)].
  
 
Furthermore, several language implementations of rewriting logic
 
Furthermore, several language implementations of rewriting logic

Revision as of 11:28, 21 December 2020

The theory and applications of rewriting logic have been vigorously developed by researchers all over the world during the past years, with more than three hundred papers related to rewriting logic published so far (see the roadmap).

The following international workshops on rewriting logic have been held:

Several journal special issues have been published on rewriting logic: TCS 285 (2002), HOSC 20 (2007) JLAMP 81 (2012), SCP 99 (2012), JLAMP 85 (2016) JLAMP 86 (2017), JLAMP 93 (2017).

Furthermore, several language implementations of rewriting logic (CafeOBJ, ELAN, Maude, etc.) and a variety of formal tools have also been developed and have been used in a wide range of applications.

Several snapshots of the state of rewriting logic research—some more global in scope, and others restricted to specific areas such as concurrency or object-based systems—have appeared so far CONCUR'96, Marktoberdorf'98, RTA'00, FMOODS'00, TCS'02, JLAMP'12, and WoLLIC'18.

Maude should be seen as our contribution to the broader collective effort of building good language implementations for rewriting logic. In this regard, a key distinguishing feature of Maude is its systematic and efficient use of reflection, exploiting the fact that rewriting logic is reflective, a feature that makes Maude remarkably extensible and powerful, and that allows many advanced metaprogramming and metalanguage applications.

Several versions of Maude have also been presented in different venues: RTA'99, WRLA'00, RTA'03, RTA'04, RTA'11, and IJCAR'16. An account of the history of the language may be found in the Two Decades of Maude 2015 paper.