Oana Andrei, Maribel Fernández, Hélène Kirchner, Guy Melançon, Olivier Namet & Bruno Pinaud (2011):
PORGY: Strategy-Driven Interactive Transformation of Graphs.
In: Rachid Echahed: TERMGRAPH,
EPTCS 48,
pp. 54–68.
Available at http://dx.doi.org/10.4204/EPTCS.48.7.
Oana Andrei & Hélène Kirchner (2009):
A Port Graph Calculus for Autonomic Computing and Invariant Verification.
Electronic Notes In Theoretical Computer Science 253(4),
pp. 17–38,
doi:10.1016/j.entcs.2009.10.015.
Oana Andrei & Hélène Kirchner (2009):
A Higher-Order Graph Calculus for Autonomic Computing.
In: Marina Lipshteyn, Vadim E. Levit & Ross M. McConnell: Graph Theory, Computational Intelligence and Thought,
Lecture Notes in Computer Science 5420.
Springer,
pp. 15–26.
Available at http://dx.doi.org/10.1007/978-3-642-02029-2_2.
Emilie Balland, Pierre-Etienne Moreau & Antoine Reilles (2012):
Effective strategic programming for Java developers.
Software: Practice and Experience,
doi:10.1002/spe.2159.
Peter Borovanský, Claude Kirchner, Hélène Kirchner & Pierre-Etienne Moreau (2002):
ELAN from a rewriting logic point of view.
Theoretical Computer Science 2(285),
pp. 155–185,
doi:10.1016/S0304-3975(01)00358-9.
Tony Bourdier, Horatiu Cirstea, Daniel J. Dougherty & Hélène Kirchner (2009):
Extensional and Intensional Strategies.
In: Maribel Fernández: WRS,
EPTCS 15,
pp. 1–19.
Available at http://dx.doi.org/10.4204/EPTCS.15.1.
Horatiu Cirstea & Claude Kirchner (2001):
The rewriting calculus — Part I and II.
Logic Journal of the Interest Group in Pure and Applied Logics 9(3),
pp. 339–410,
doi:10.1093/jigpal/9.3.339.
Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer & Carolyn L. Talcott (2007):
All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic.
Lecture Notes in Computer Science 4350.
Springer.
Daniel J. Dougherty (2008):
Rewriting strategies and game strategies.
Internal report.
J. Giesl & A Middeldorp (2003):
Innermost Termination of Context-Sensitive Rewriting.
In: Proceedings of the 6th International Conference on Developments in Language Theory (DLT 2002),
LNCS 2450.
Springer,
Kyoto, Japan,
pp. 231–244,
doi:10.1007/3-540-45005-X_20.
Jürgen Giesl, Matthias Raffelsieper, Peter Schneider-Kamp, Stephan Swiderski & René Thiemann (2011):
Automated termination proofs for Haskell by term rewriting.
ACM Trans. Program. Lang. Syst. 33(2),
pp. 7:1–7:39,
doi:10.1145/1890028.1890030.
Isabelle Gnaedig & Hélène Kirchner (2009):
Termination of rewriting under strategies.
ACM Trans. Comput. Logic 10(2),
pp. 1–52,
doi:10.1145/1462179.1462182.
Erich Grädel, Wolfgang Thomas & Thomas Wilke (2002):
Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001].
Lecture Notes in Computer Science 2500.
Springer.
Alexander S. Kechris (1995):
Classical Descriptive Set Theory.
Graduate Texts in Mathematics 156.
Springer,
doi:10.1007/978-1-4612-4190-4.
Claude Kirchner, Florent Kirchner & Hélène Kirchner (2008):
Strategic Computations and Deductions.
In: Christoph Benzmüller, Chad E. Brown, Jörg Siekmann & Richard Statman: Reasoning in Simple Type Theory. Festchrift in Honour of Peter B. Andrews on His 70th Birthday,
Studies in Logic and the Foundations of Mathematics 17.
College Publications,
pp. 339–364.
Claude Kirchner, Florent Kirchner & Hélène Kirchner (2010):
Constraint Based Strategies.
In: Proceedings 18th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2009), Brasilia,
LNCS 5979,
pp. 13–26,
doi:10.1007/978-3-642-11999-6_2.
Narciso Martí-Oliet & José Meseguer (1996):
Rewriting logic as a logical and semantic framework.
Electr. Notes Theor. Comput. Sci. 4,
pp. 190–225.
Available at http://dx.doi.org/10.1016/S1571-0661(04)00040-4.
Narciso Martí-Oliet, José Meseguer & Alberto Verdejo (2008):
A rewriting semantics for Maude strategies.
Electronic Notes in Theoretical Computer Science 238(3),
pp. 227–247,
doi:10.1016/j.entcs.2009.05.022.
Vincent van Oostrom & Roel de Vrijer (2003):
Term Rewriting Systems, chapter 9: Strategies,
Cambridge Tracts in Theoretical Computer Science 2.
Cambridge University Press.
Igor Walukiewicz (2004):
A Landscape with Games in the Background.
In: 19th IEEE Symposium on Logic in Computer Science (LICS 2004),
pp. 356–366,
doi:10.1109/LICS.2004.1319630.
eptcs@eptcs.org