L. Augustsson, A compiler for lazy ML, Proceedings of the 1984 ACM Symposium on LISP and functional programming , LFP '84, pp.218-227, 1984.
DOI : 10.1145/800055.802038

F. Baader and T. Nipkow, Term rewriting and all that, 1998.

J. C. Baeten, J. A. Bergstra, and J. W. Klop, Term rewriting systems with priorities, Proceedings of the 2nd International Conference on Rewriting Techniques and Applications, pp.83-94, 1987.
DOI : 10.1007/3-540-17220-3_8
URL : http://dspace.library.uu.nl:8080/handle/1874/12932

J. C. Baeten, J. A. Bergstra, J. W. Klop, and W. P. Weijland, Term-rewriting systems with rule priorities, Theoretical Computer Science, vol.67, issue.2-3, pp.283-301, 1989.
DOI : 10.1016/0304-3975(89)90006-6
URL : http://doi.org/10.1016/0304-3975(89)90006-6

A. S. De-oliveira, Réécriture et Modularité pour les Politiques de Scurité, 2008.

A. S. De-oliveira, E. K. Wang, C. Kirchner, and H. Kirchner, Weaving rewrite-based access control policies, Proceedings of the 2007 ACM workshop on Formal methods in security engineering , FMSE '07, pp.71-80, 2007.
DOI : 10.1145/1314436.1314446
URL : https://hal.archives-ouvertes.fr/inria-00185710

D. J. Dougherty, K. Fisler, and S. Krishnamurthi, Specifying and Reasoning About Dynamic Access-Control Policies, Proceedings of the 3rd International Joint Conference on Automated Reasoning (IJCAR), pp.632-646, 2006.
DOI : 10.1007/11814771_51

T. Genet, Decidable approximations of sets of descendants and sets of normal forms, Proceedings of the 9th Conference on Rewriting Techniques and Applications, pp.151-165, 1998.
DOI : 10.1007/BFb0052368
URL : https://hal.archives-ouvertes.fr/inria-00073364

I. Gnaedig and H. Kirchner, Termination of Rewriting under Strategies To appear. Preliminary version available at http://www.loria.fr/?gnaedig, ACM Transactions on Computational LogicPAPERS, 2007.

N. Marti-oliet, J. Meseguer, and A. Verdejo, Towards a Strategy Language for Maude, Proceedings of the Fifth International Workshop on Rewriting Logic and Its Applications, pp.417-441, 2004.
DOI : 10.1016/j.entcs.2004.06.020

C. K. Mohan, Priority rewriting: Semantics, confluence, and conditionals, Proceedings of the 3rd International Conference on Rewriting Techniques and Applications, pp.278-291, 1989.
DOI : 10.1007/3-540-51081-8_114

P. Moreau, C. Ringeissen, and M. Vittek, A Pattern Matching Compiler for Multiple Target Languages, Proceedings of the 12th Conference on Compiler Construction, pp.61-76, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00099427

R. Plasmeijer and M. Van-eekelen, Functional Programming and Parallel Graph Rewriting, 1993.

M. Sakai and Y. Toyama, Semantics and strong sequentiality of priority term rewriting systems, Theoretical Computer Science, vol.208, issue.1-2, pp.87-110, 1998.
DOI : 10.1016/S0304-3975(98)00080-2

J. Van, Operational semantics of rewriting with priorities, Theoretical Computer Science, vol.200, issue.12, pp.289-312, 1998.

J. Van-de-pol and H. Zantema, Generalized Innermost Rewriting, Proceedings of the 16th International Conference on Rewriting Techniques and Applications, pp.2-16, 2005.
DOI : 10.1007/978-3-540-32033-3_2

M. G. Van-den-brand, P. Klint, and C. Verhoef, Term Rewriting for Sale, Proceedings of the First International Workshop on Rewriting Logic and its Applications, pp.139-161, 1998.
DOI : 10.1016/S1571-0661(05)80014-3