References

• Baader, F., & Nipkow, T. (2009).
  Term rewriting and all that. Cambridge Univ. Press.

• Fokkink, W., Kamperman, J., & Walters, P. (1998).
  Within ARM’s reach. ACM Transactions on Programming Languages and Systems, 20(3), 679–706.
  https://doi.org/10.1145/291889.291903

• Fokkink, W., Kamperman, J., & Walters, P. (2000).
  Lazy rewriting on eager machinery. ACM Transactions on Programming Languages and Systems (TOPLAS), 22(1), 45–86.
  https://doi.org/10.1145/345099.345102

• Hertz, M., & Berger, E. D. (2005).
  Quantifying the performance of garbage collection vs. explicit memory management. ACM SIGPLAN Notices, 40(10), 313.
  https://doi.org/10.1145/1103845.1094836

• Kamperman, J., & Walters, P. (1995).
  Lazy rewriting and eager machinery. Rewriting Techniques and Applications, vol. 914, 147–162.
  https://doi.org/10.1007/3-540-59200-8_54

• Ohlebusch, E. (2002).
  Advanced topics in term rewriting. Springer.

• Walters, P. (1991).
  A Complete Term Rewriting System for Decimal Integer Arithmetic. Centre for Mathematics & Computer Science.
  https://www.researchgate.net/publication/2450227_A_Complete_Term_Rewriting_System_for_Decimal_Integer_Arithmetic

• Walters, P., & Kamperman, J. (1993).
  ARM abstract rewriting machine. Centre for Mathematics & Computer Science.
  https://www.researchgate.net/publication/2432082_ARM_abstract_rewriting_machine, Report CS-R9330

• Walters, P., & Kamperman, J. (1995a).
  A model for I/O in equational languages with don’t care non-determinism. Lecture Notes in Computer Science, 1130, pp 522-535.
  https://link.springer.com/chapter/10.1007/3-540-61629-2_61, Springer

• Walters, P., & Kamperman, J. (1995b).
  Minimal Term Rewriting Systems. Lecture Notes in Computer Science, 1130, pp 274-290.
  https://link.springer.com/chapter/10.1007/3-540-61629-2_48, Springer

• Walters, P., & Kamperman, J. (1996).
  Simulating TRSs by minimal TRSs: a simple, efficient, and correct compilation technique. Centre for Mathematics & Computer Science.
  https://www.researchgate.net/publication/2237614_Simulating_TRSs_by_Minimal_TRSs_a_Simple_Efficient_and_Correct_Compilation_Technique, Report CS-R9605

• Walters, P., & Zantema, H. (1995).
  Rewrite systems for integer arithmetic. Lecture Notes in Computer Science, vol. 914, pp. 324-338.
  https://doi.org/https://doi.org/10.1007/3-540-59200-8_67, In: Hsiang J. (eds) Rewriting Techniques and Applications. RTA 1995.

‌