Author:
Giesl Jürgen,Thiemann René,Schneider-Kamp Peter
Publisher
Springer Berlin Heidelberg
Reference37 articles.
1. Lecture Notes in Computer Science;T. Aoto,2003
2. Aoto, T., Yamada, T.: Termination of simply typed applicative term rewriting systems. In: Proc. HOR 2004, Report AIB-2004-03, RWTH, pp. 61–65 (2004)
3. Lecture Notes in Computer Science;T. Aoto,2005
4. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 133–178 (2000)
5. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge (1998)
Cited by
67 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Non-termination in Term Rewriting and Logic Programming;Journal of Automated Reasoning;2024-02-02
2. CoCo 2019: report on the eighth confluence competition;International Journal on Software Tools for Technology Transfer;2021-05-28
3. mu-term: Verify Termination Properties Automatically (System Description);Automated Reasoning;2020
4. A Static Higher-Order Dependency Pair Framework;Programming Languages and Systems;2019
5. Confluence Competition 2019;Tools and Algorithms for the Construction and Analysis of Systems;2019