Author:
Hirokawa Nao,Middeldorp Aart
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference44 articles.
1. B. Alarcón, R. Gutiérrez, S. Lucas, Context-sensitive dependency pairs, in: Proceedings of the 26th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, vol. 4337, 2006, pp. 298–309.
2. T. Aoto, T. Yamada, Termination of simply typed term rewriting by translation and labelling, in: Proceedings of the 14th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 2706, 2003, pp. 380–394.
3. T. Aoto, T. Yamada, Termination of simply-typed applicative term rewriting systems, in: Proceedings of the 2nd International Workshop on Higher-Order Rewriting, Technical Report AIB-2004-03, RWTH Aachen, 2004, pp. 61–65.
4. T. Aoto, T. Yamada, Dependency pairs for simply typed term rewriting, in: Proceedings of the 16th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 3467, 2005, pp. 120–134.
5. Termination of term rewriting using dependency pairs;Arts;Theoretical Computer Science,2000
Cited by
73 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献