1. Solution to the problem of Zantema on a persistent property of term rewriting systems;Aoto;Journal of Functional and Logic Programming,2001
2. T. Aoto, Y. Toyama, Extending persistency of confluence with ordered sorts, Technical Report IS-RR-96-0025F, School of Information Science, JAIST, 1996.
3. Persistency of confluence;Aoto;Journal of Universal Computer Science,1997
4. A reduction-preserving completion for proving confluence of non-terminating term rewriting systems;Aoto;Logical Methods in Computer Science,2012
5. Higher-order (non-)modularity;Appel,2010