Rewriting Logic Systems

Abstract We present an overview of rewriting-based systems that were presented at the workshop.

[1]  Hélène Kirchner,et al.  Under Consideration for Publication in J. Functional Programming Promoting Rewriting to a Programming Language: a Compiler for Non-deterministic Rewrite Programs in Associative-commutative Theories , 2022 .

[2]  Mark van den Brand,et al.  Applications of the Asf+SdfMeta-Environment , 2005, GTTSE.

[3]  Christophe Ringeissen,et al.  A Pattern Matching Compiler for Multiple Target Languages , 2003, CC.

[4]  Arie van Deursen,et al.  The ASF+SDF Meta-environment: A Component-Based Language Development Environment , 2001 .

[5]  Manuel Clavel,et al.  Reflection in conditional rewriting logic , 2002, Theor. Comput. Sci..

[6]  Narciso Martí-Oliet,et al.  The Maude 2.0 System , 2003, RTA.

[7]  Claude Kirchner,et al.  A rho-Calculus of Explicit Constraint Application , 2004, WRLA.

[8]  Eelco Visser,et al.  Stratego: A Language for Program Transformation Based on Rewriting Strategies , 2001, RTA.

[9]  Narciso Martí-Oliet,et al.  Maude: specification and programming in rewriting logic , 2002, Theor. Comput. Sci..

[10]  Paul Klint,et al.  Term rewriting with traversal functions , 2003, TSEM.

[11]  Narciso Martí-Oliet,et al.  All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic , 2007, All About Maude.

[12]  P. Klint,et al.  Efficient annotated terms , 2000 .

[13]  Teodor Rus,et al.  AMAST series in computing , 1993 .

[14]  Paul Klint,et al.  Compiling language definitions: the ASF+SDF compiler , 2000, TOPL.