A book on term rewriting systems written by a writer's collective:

Terese
Term Rewriting Systems
Cambridge Tracts in Theoretical Computer Science, Volume 55, Cambridge University Press, 2003.

• M. Hendriks, C. Kaliszyk, F. van Raamsdonk, and F. Wiedijk
  Teaching logic using a state-of-the-art proof assistant Acta Didactica Napocensia, 3(2):35-48, June 2010.
• C. Kaliszyk, F. Wiedijk, M. Hendriks and F. van Raamsdonk
  Teaching logic using a state-of-the-art proof assistant
  In: FORMED'08
  pdf
• C. Kaliszyk, F. Wiedijk, M. Hendriks and F. van Raamsdonk
  Teaching logic using a state-of-the-art proof assistant
  In: H. Geuvers and P. Courtieu (eds.), PATE'07, International Workshop on Proof Assistants and Types in Education, Paris, France, June 2007.
  pdf
• Jan Willem Klop, Vincent van Oostrom, and Femke van Raamsdonk
  Reduction Strategies and Acyclicity
  In: H. Comon-Lundh, C. Kirchner, H. Kirchner (eds.), Rewriting, Computation and Proof: Essays dedicated to Jean-Pierre Jouannaud on the occasion of his 60th birthday.
  pdf
• Examples of higher-order rewriting systems
  
  
• Femke van Raamsdonk
  On Termination of Higher-Order Rewriting
  In: A. Middeldorp, editor, Proceedings of the 12th International Conference on Rewriting Techniques and Applications (RTA '01), Utrecht, The Netherlands, May 2001, pp. 261--275.
  Copyright Springer Verlag.
  abstract
  postscript
  postscript long version
  
  
  
• Gilles Barthe and Femke van Raamsdonk
  Constructor subtyping in the Calculus of Inductive Constructions
  In the proceedings of FOSSACS 2000.
  abstract
  postscript
  
  
• Sandro Etalle and Femke van Raamsdonk
  Logic Programming with Requests
  Proceedings of the 1999 International Conference on Logic Programming (ICLP '99), Las Cruces, USA, December 1999, pp. 558 - 572, MIT Press.
  abstract
  postscript
  
  
• Femke van Raamsdonk
  Higher-Order Rewriting
  Proceedings of the 10th International Conference on Rewriting Techniques and Applications (RTA '99), Trento, Italy, July 1999, pp. 220 - 239, LNCS 1631.
  Copyright Springer Verlag.
  abstract
  postscript
  
  
• Femke van Raamsdonk, Paula Severi, Morten Heine Sørensen and Hongwei Xi
  Perpetual Reductions in Lambda Calculus
  Information and Computation 149(2):173--225, March 1999.
  abstract
  postscript
  
  
• Femke van Raamsdonk and Paula Severi
  On Normalisation
  CWI technical report CS-R9545
  (this is the report behind Perpetual Reductions in Lambda Calculus)
  abstract
  postscript
  
  
• Sandro Etalle and Femke van Raamsdonk
  Beyond Success and Failure
  Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming (JICSLP '98), Manchester, UK, June 1998, pp. 190 - 204, MIT Press.
  abstract
  postscript
  
  
• Gilles Barthe and Femke van Raamsdonk
  Termination of Algebraic Type Systems: the Syntactic Approach
  Proceedings of the 6th International Joint Conference ALP '97 - HOA '97, Southampton, UK, September 1997, pp. 174 - 193, LNCS 1298.
  abstract
  postscript
  
  
• Femke van Raamsdonk
  Translating Logic Programs into Conditional Rewriting Systems
  Proceedings of the 14th International Conference on Logic Programming (ICLP '97), Leuven, Belgium, July 1997, pp. 168 - 182, MIT Press.
  abstract
  postscript
  report
  
  
• Femke van Raamsdonk
  Outermost-Fair Rewriting
  Proceedings of the 3rd International Conference on Typed Lambda Calculi and Applications (TLCA '97), Nancy, France, April 1997, pp. 284 - 299, LNCS 1210.
  abstract
  postscript