Difference between revisions of "Rewriting Logic"
(Elan link fixed) |
|||
| (12 intermediate revisions by 2 users not shown) | |||
| Line 5: | Line 5: | ||
(see the [[Roadmap and Bibliography|roadmap]]). | (see the [[Roadmap and Bibliography|roadmap]]). | ||
| − | + | International workshops on rewriting logic have been held in | |
| + | [http://www.sciencedirect.com/science/journal/15710661/4 United States (1996)], | ||
| + | [http://www.sciencedirect.com/science/journal/15710661/15 France (1998)], | ||
| + | [http://www.sciencedirect.com/science/journal/15710661/36 Japan (2000)], | ||
| + | [http://www.sciencedirect.com/science/journal/15710661/71 Italy (2002)], | ||
| + | [http://www.sciencedirect.com/science/journal/15710661/117 Spain (2004)], | ||
| + | [http://www.sciencedirect.com/science/journal/15710661/176/4 Austria (2006)], | ||
| + | [http://www.sciencedirect.com/science/journal/15710661/238/3 Hungary (2008)], [http://link.springer.com/book/10.1007/978-3-642-16310-4/page/1 Cyprus (2010)], [http://link.springer.com/book/10.1007/978-3-642-34005-5/page/1 Estonia (2012)], [http://users.dsic.upv.es/workshops/wrla2014/ France (2014)], [https://fmse.info.uaic.ro/events/WRLA2016/ The Netherlands (2016)], [https://project.inria.fr/wrla18/ Greece (2018)], [https://wrla2020.webs.upv.es/ Ireland (2020)]. | ||
| − | + | 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)], and | ||
| + | [https://www.sciencedirect.com/journal/journal-of-logical-and-algebraic-methods-in-programming/special-issue/10R8T94S8FM JLAMP 110 (2020)]. | ||
Furthermore, several language implementations of rewriting logic | Furthermore, several language implementations of rewriting logic | ||
| Line 18: | Line 29: | ||
have also been developed and have been used in a wide range of applications. | 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, | |
| − | Several snapshots of the state of rewriting logic research | + | and others restricted to specific areas such as concurrency or object-based systems—have |
| − | and others restricted to specific areas such as concurrency or object-based systems | + | |
appeared so far | appeared so far | ||
| − | [ | + | [https://doi.org/10.1007/3-540-61604-7_64 CONCUR'96], |
| − | [ | + | [http://maude.cs.illinois.edu/papers/abstract/Mdirections_1998.html Marktoberdorf'98], |
| − | [ | + | [https://doi.org/10.1007/10721975_1 RTA'00], |
| − | [ | + | [https://doi.org/10.1007/978-0-387-35520-7_5 FMOODS'00], |
| − | [ | + | [http://maude.cs.illinois.edu/papers/abstract/MMroadmap_2001.html TCS'02], |
| − | + | [https://doi.org/10.1016/j.jlap.2012.06.003 JLAMP'12], and | |
| + | [https://doi.org/10.1007/978-3-662-57669-4_2 WoLLIC'18]. | ||
Maude should be seen as our contribution to the broader | Maude should be seen as our contribution to the broader | ||
| Line 36: | Line 47: | ||
makes Maude remarkably extensible and powerful, and that allows many | makes Maude remarkably extensible and powerful, and that allows many | ||
advanced metaprogramming and metalanguage applications. | advanced metaprogramming and metalanguage applications. | ||
| + | |||
| + | Several versions of Maude have also been presented in different venues: | ||
| + | [https://doi.org/10.1007/3-540-48685-2_18 RTA'99], | ||
| + | [https://doi.org/10.1016/S1571-0661(05)80137-9 WRLA'00], | ||
| + | [https://doi.org/10.1007/3-540-44881-0_7 RTA'03], | ||
| + | [https://doi.org/10.1007/978-3-642-02348-4_27 RTA'04], | ||
| + | [https://doi.org/10.4230/LIPIcs.RTA.2011.31 RTA'11], and | ||
| + | [https://doi.org/10.1007/978-3-319-40229-1_13 IJCAR'16]. | ||
| + | An account of the history of the language may be found in the [https://doi.org/10.1007/978-3-319-23165-5_11 Two Decades of Maude] 2015 paper. | ||
Latest revision as of 11:43, 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).
International workshops on rewriting logic have been held in United States (1996), France (1998), Japan (2000), Italy (2002), Spain (2004), Austria (2006), Hungary (2008), Cyprus (2010), Estonia (2012), France (2014), The Netherlands (2016), Greece (2018), Ireland (2020).
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), and JLAMP 110 (2020).
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.
