O. Andrei, M. Fernández, G. Héì-ene-kirchner, O. Melançon, &. Namet et al., PORGY: Strategy-Driven Interactive Transformation of Graphs, TERMGRAPH, EPTCS 48, pp.54-68, 2011.
DOI : 10.4204/EPTCS.48.7
URL : https://hal.archives-ouvertes.fr/inria-00563249

O. Andrei-&héì-ene and . Kirchner, A Port Graph Calculus for Autonomic Computing and Invariant Verification, Electronic Notes in Theoretical Computer Science, vol.253, issue.4, pp.17-38, 2009.
DOI : 10.1016/j.entcs.2009.10.015

O. Andrei-&héì-ene and . Kirchner, A Higher-Order Graph Calculus for Autonomic Computing, Graph Theory, pp.15-26978, 2009.
DOI : 10.1007/978-3-540-73449-9_5

E. Balland, P. Moreau, and &. Antoine-reilles, Effective strategic programming for Java developers. Software: Practice and Experience, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01265319

P. Borovansk´yborovansk´y, C. Kirchner, &. Héì-ene-kirchner, . Pierre-etienne, and . Moreau, ELAN from a rewriting logic point of view, Theoretical Computer Science, vol.2, issue.28501, pp.155-18510, 2002.

T. Bourdier, H. Cirstea, D. J. Dougherty-&héì-ene, and . Kirchner, Extensional and Intensional Strategies, WRS, EPTCS 15, pp.1-19, 2009.
DOI : 10.4204/EPTCS.15.1
URL : https://hal.archives-ouvertes.fr/inria-00494636

H. Cirstea and &. Kirchner, The rewriting calculus - part II, Logic Journal of IGPL, vol.9, issue.3, pp.339-410, 2001.
DOI : 10.1093/jigpal/9.3.377
URL : https://hal.archives-ouvertes.fr/inria-00100532

M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-oliet et al., All About Maude -A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic, Lecture Notes in Computer Science, vol.4350, 2007.

J. Daniel and . Dougherty, Rewriting strategies and game strategies, 2008.

J. Giesl and &. Middeldorp, Innermost Termination of Context-Sensitive Rewriting, Proceedings of the 6th International Conference on Developments in Language Theory LNCS 2450, pp.231-244, 2002.
DOI : 10.1007/3-540-45005-X_20

J. Giesl, M. Raffelsieper, P. Schneider-kamp, S. Swiderski, and &. Thiemann, Automated termination proofs for haskell by term rewriting, ACM Transactions on Programming Languages and Systems, vol.33, issue.2, pp.1-7, 2011.
DOI : 10.1145/1890028.1890030

I. Gnaedig-&héì-ene and . Kirchner, Termination of rewriting under strategies, ACM Transactions on Computational Logic, vol.10, issue.2, pp.1-5210, 2009.
DOI : 10.1145/1462179.1462182

A. S. Kechris, Classical Descriptive Set Theory, Graduate Texts in Mathematics, vol.156, issue.10, pp.978-979, 1007.
DOI : 10.1007/978-1-4612-4190-4

C. Kirchner, F. Kirchner-&héì-ene, and . Kirchner, Strategic Computations and Deductions, 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, pp.339-364, 2008.

C. Kirchner, F. Kirchner-&héì-ene, and . Kirchner, Constraint Based Strategies, Proceedings 18th International Workshop on Functional and (Constraint) Logic Programming, pp.13-26978, 2009.
DOI : 10.1007/978-3-642-11999-6_2
URL : https://hal.archives-ouvertes.fr/inria-00494531

N. Meseguer, Rewriting logic as a logical and semantic framework, Electr. Notes Theor. Comput. Sci, vol.4, pp.190-225, 1996.

N. Martí-oliet, J. Meseguer, and A. Verdejo, A Rewriting Semantics for Maude Strategies, Electronic Notes in Theoretical Computer Science, vol.238, issue.3, pp.227-247, 2008.
DOI : 10.1016/j.entcs.2009.05.022

&. Vincent-van-oostrom, . Roel, and . Vrijer, Term Rewriting Systems, Strategies. Cambridge Tracts in Theoretical Computer Science, vol.9, issue.2, 2003.

I. Walukiewicz, A landscape with games in the background, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., pp.356-366, 2004.
DOI : 10.1109/LICS.2004.1319630