Author:
Bulwahn Lukas,Krauss Alexander,Nipkow Tobias
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Archive of Formal Proofs, http://afp.sourceforge.net/
2. Abel, A.: foetus – termination checker for simple functional programs. Programming Lab. Report (1998)
3. Abel, A., Altenkirch, T.: A predicative analysis of structural recursion. J. Functional Programming 12(1), 1–41 (2002)
4. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theor. Comput. Sci. 236(1-2), 133–178 (2000)
5. Lecture Notes in Computer Science;G. Barthe,2006
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Termination of Recursive Functions by Lexicographic Orders of Linear Combinations;Companion Proceedings of the 2022 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity;2022-11-29
2. Friends with Benefits;Programming Languages and Systems;2017
3. Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic;Frontiers of Combining Systems;2017
4. Partiality and recursion in interactive theorem provers – an overview;Mathematical Structures in Computer Science;2014-11-10
5. Verification of distributed systems with local–global predicates;Formal Aspects of Computing;2011-09