1. [1] T. Aoto, Y. Yamada, and Y. Toyama, “Inductive theorems for higher-order rewriting, ” Proc. RTA2004, vol.3091 of LNCS, pp.269-284, Springer-Verlag, 2004.
2. [2] F. Baader and T. Nipkow, “Term rewriting and all that, ” Cambridge University Press, 1998.
3. Using circular programs to eliminate multiple traversals of data
4. A Transformation System for Developing Recursive Programs
5. [5] Y. Chiba and T. Aoto, “RAPT: A program transformation system based on term rewriting, ” Proc. RTA 2006, vol.4098 of LNCS, pp.267-276, Springer-Verlag, 2006.