R. Alur and P. Erný, Streaming transducers for algorithmic verication of single-pass list-processing programs, Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '11, p.599610, 2011.

F. Baader and T. Nipkow, Term Rewriting and All That, 1998.

P. Bahr and L. E. Day, Programming macro tree transducers, Proceedings of the 9th ACM SIGPLAN Workshop on Generic Programming, WGP '13, p.6172, 2013.

F. Bellegarde, Program transformation and rewriting, Rewriting Techniques and Applications, p.226239, 1991.

H. Cirstea, S. Lenglet, and P. Moreau, A faithful encoding of programmable strategies into term rewriting systems, RTA 2015, vol.36, p.7488, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01168956

H. Cirstea and P. Moreau, Generic encodings of constructor rewriting systems, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02130396

J. Garrigue, Programming with polymorphic variants, ACM Workshop on ML, 1998.

J. Giesl, M. Raelsieper, P. Schneider-kamp, S. Swiderski, and R. Thiemann, Automated termination proofs for Haskell by term rewriting, ACM Trans. Program. Lang. Syst, vol.33, issue.2, p.7, 2011.

A. W. Keep and R. K. Dybvig, A nanopass framework for commercial compiler development, Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming, ICFP '13, p.343350, 2013.

A. Krauss, C. Sternagel, R. Thiemann, C. Fuhs, and J. Giesl, Termination of Isabelle functions via termination of rewriting, ITP 2011, p.152167, 2011.

D. Lacey and O. De-moor, Imperative program transformation by rewriting, Proceedings of the 10th International Conference on Compiler Construction, CC '01, p.5268, 2001.

F. Pottier, Visitors unchained, Proceedings of the ACM on Programming Languages, vol.1, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01670735

G. Rosu and T. Serbanuta, An overview of the K semantic framework, Journal of Logic and Algebraic Programming, vol.79, issue.6, p.397434, 2010.

T. , Term Rewriting Systems, 2003.