Subject
General Computer Science,Theoretical Computer Science
Reference37 articles.
1. Termination checking with types;Abel;Theor. Inform. and Appl.,2004
2. Infinite trees and completely iterative theories: a coalgebraic view;Aczel;Theor. Comput. Sci.,2003
3. Generalised coinduction;Bartels;Math. Struct. in Comput. Sci.,2003
4. Type-based termination of recursive definitions;Barthe;Math. Struct. in Comput. Sci.,2004
5. Complete sequent calculi for induction and infinite descent;Brotherston,2007
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Type-Based Approach to Divide-and-Conquer Recursion in Coq;Proceedings of the ACM on Programming Languages;2023-01-09
2. Proof Nets, Coends and the Yoneda Isomorphism;Electronic Proceedings in Theoretical Computer Science;2019-04-15
3. Unifying structured recursion schemes;Journal of Functional Programming;2016
4. Conjugate Hylomorphisms -- Or;ACM SIGPLAN Notices;2015-05-11
5. Conjugate Hylomorphisms -- Or;Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages;2015-01-14