1. Eguchi, N.: Predicative lexicographic path orders: towards a maximal model for primitive recursive functions. In: Waldmann, J. (ed.): Proceedings of 13th International Workshop on Termination (WST 2013), pp. 41–45 (2013)
2. Cichon, E.A., Weiermann, A.: Term rewriting theory for the primitive recursive functions. Ann. Pure Appl. Logic 83(3), 199–223 (1997)
3. Adaptation, Learning, and Optimization;J Seiffertt,2010
4. Lecture Notes in Computer Science;M Avanzini,2008
5. Avanzini, M., Eguchi, N., Moser, G.: A path order for rewrite systems that compute exponential time functions. In: Proceedings of 22nd International Conference on Rewriting Techniques and Applications (RTA 2011), vol. 10, pp. 123–138. Leibniz International Proceedings in Informatics (2011)