Author:
Aoto Takahito,Yamada Toshiyuki
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Lecture Notes in Computer Science;T. Aoto,2003
2. Aoto, T., Yamada, T.: Termination of simply-typed applicative term rewriting systems. In: Proceedings of the 2nd International Workshop on Higher-Order Rewriting (2004)
3. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236(1-2), 133–178 (2000)
4. Giesl, J., Arts, T.: Verification of Erlang processes by dependency pairs. Applicable Algebra in Engineering, Communication and Computing 12(1/2), 39–72 (2001)
5. Giesl, J., Arts, T., Ohlebusch, E.: Modular termination proofs for rewriting using dependency pairs. Journal of Symbolic Computation 34(1), 21–58 (2002)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Dynamic Dependency Pairs for Algebraic Functional Systems;Logical Methods in Computer Science;2012-06-19
2. Uncurrying for Termination and Complexity;Journal of Automated Reasoning;2012-04-25
3. Harnessing First Order Termination Provers Using Higher Order Dependency Pairs;Frontiers of Combining Systems;2011
4. Argument Filterings and Usable Rules for Simply Typed Dependency Pairs;Frontiers of Combining Systems;2009
5. Order-sorted dependency pairs;Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming;2008-07-15