Publisher
Springer Berlin Heidelberg
Reference34 articles.
1. Lecture Notes in Computer Science;A. Abel,2008
2. Lecture Notes in Computer Science;A. Abel,2008
3. Agda wiki (2008), appserv.cs.chalmers.se/users/ulfn/wiki/agda.php
4. Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Develpment. Coq’Art: The Calculus of Inductive Constructions. Springer, Heidelberg (2004)
5. Bove, A., Capretta, V.: Modelling general recursion in type theory. Mathematical Structures in Computer Science 15, 671–708 (2005)
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Typing Requirement Model as Coroutines;IEEE Access;2024
2. Typing Composable Coroutines;2023 12th International Conference on Computer Technologies and Development (TechDev);2023-10-14
3. Higher-order games with dependent types;Theoretical Computer Science;2023-09
4. Verifying Correctness of Smart Contracts with Conditionals;2022 IEEE 1st Global Emerging Technology Blockchain Forum: Blockchain & Beyond (iGETblockchain);2022-11-07
5. Agda Formalization of a Security-preserving Translation from Flow-sensitive to Flow-insensitive Security Types;Electronic Notes in Theoretical Computer Science;2020-09