1. Franz Baader and Tobias Nipkow. 1999. Term Rewriting and All That. Cambridge University Press.
2. Heiko Becker, Jasmin Christian Blanchette, Uwe Waldmann, and Daniel Wand. 2017. A Transfinite Knuth-Bendix Order for LambdaFree Higher-Order Terms. In Proceedings of the 26th International Conference on Automated Deduction (CADE) (Lecture Notes in Computer Science) , Vol. 10395. Springer, 432–453.
3. Manuel Clavel Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, and Carolyn Talcott. 2007. All About Maude – A High-Performance Logical Framework . Lecture Notes in Computer Science, Vol. 4350. Springer.
4. Donald E. Knuth and Peter B. Bendix. 1970. Simple Word Problems in Universal Algebras. In Computational Problems in Abstract Algebra , John Leech (Ed.). Pergamon, 263–297.
5. Martin Korp, Christian Sternagel, Harald Zankl, and Aart Middeldorp. 2009. Tyrolean Termination Tool 2. In Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA) (Lecture Notes in Computer Science) , Vol. 5595. Springer, 295–304.