Author:
Hirokawa Nao,Middeldorp Aart,Zankl Harald
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software
Reference47 articles.
1. Aoto, T., Yamada, T.: Termination of simply typed term rewriting by translation and labelling. In: Nieuwenhuis, R. (ed.) Proc. 14th International Conference on Rewriting Techniques and Applications. LNCS, vol. 2706, pp. 380–394 (2003)
2. Aoto, T., Yamada, T.: Termination of simply-typed applicative term rewriting systems. In: Proc. 2nd International Workshop on Higher-Order Rewriting. Technical Report AIB-2004-03, pp. 61–65. RWTH Aachen (2004)
3. Aoto, T., Yamada, T.: Dependency pairs for simply typed term rewriting. In: Giesl, J. (ed.) Proc. 16th International Conference on Rewriting Techniques and Applications. LNCS, vol. 3467, pp. 120–134 (2005)
4. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoret. Comput. Sci. 236(1–2), 133–178 (2000)
5. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献