Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Reference59 articles.
1. Peter Aczel.Non-Well-Founded Sets. Number 14 in CSLI Lecture Notes. Stanford University, 1988.
2. Peter Aczel. Algebras and coalgebras. In Roland Backhouse, Roy Crole, and Jeremy Gibbons, editors,Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, volume 2297 ofLNCS, pages 79-88. Springer, 2002.
3. Antonia Balaa and Yves Bertot. Fix-point equations for well-founded recursion in type theory. In J. Harrison and M. Aagaard, editors,Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000, volume 1869 ofLecture Notes in Computer Science, pages 1-16. Springer-Verlag, 2000.
4. H. P. Barendregt. Lambda calculi with types. In S. Abramsky, Dov M. Gabbay, and T. S. E. Maibaum, editors,Handbook of Logic in Computer Science, Volume 2, pages 117-309. Oxford University Press, 1992.
5. Proof-Assistants Using Dependent Type Systems
Cited by
91 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Primitive Recursive Dependent Type Theory;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. Martin-Löf à la Coq;Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs;2024-01-09
3. Sparcl: A language for partially invertible computation;Journal of Functional Programming;2024
4. Reconciling Partial and Local Invertibility;Lecture Notes in Computer Science;2024
5. While Loops in Coq;Electronic Proceedings in Theoretical Computer Science;2023-09-22