Author:
Leino K. Rustan M.,Moskal Michał
Publisher
Springer International Publishing
Reference36 articles.
1. Abel, A.: MiniAgda: Integrating sized and dependent types. In: Workshop on Partiality And Recursion in Interative Theorem Provers, PAR 2010 (2010)
2. Altenkirch, T., Danielsson, N.A.: Termination checking in the presence of nested inductive and coinductive types. Short note supporting a talk given at PAR 2010 (2010),
http://www.cse.chalmers.se/~nad/publications/
3. LNAI,2007
4. Lecture Notes in Computer Science;Y. Bertot,2005
5. Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Development — Coq’Art: The Calculus of Inductive Constructions. Springer (2004)
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Quantifier-free induction for lists;Archive for Mathematical Logic;2024-04-20
2. Lark: Verified Cross-Domain Access Control for Trusted Execution Environments;2023 IEEE 34th International Symposium on Software Reliability Engineering (ISSRE);2023-10-09
3. Some techniques for reasoning automatically on co-inductive data structures;Journal of Logic and Computation;2023-06-06
4. Checking equivalence in a non-strict language;Proceedings of the ACM on Programming Languages;2022-10-31
5. Coinduction inductively: mechanizing coinductive proofs in Liquid Haskell;Proceedings of the 15th ACM SIGPLAN International Haskell Symposium;2022-09-06