Author:
Svendsen Kasper,Birkedal Lars,Nanevski Aleksandar
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. The Coq Proof Assistant, http://coq.inria.fr/
2. Coq Reference Manual, Version 8.3
3. Lecture Notes in Computer Science;M. Abbott,2004
4. Amadio, R.M.: Recursion over Realizability Structures. Information and Computation 91, 55–85 (1991)
5. Birkedal, L., Støvring, K., Thamsborg, J.: Realisability semantics of parametric polymorphism, general references and recursive types. Math. Struct. Comp. Sci. 20(4), 655–703 (2010)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Specifying concurrent programs in separation logic: morphisms and simulations;Proceedings of the ACM on Programming Languages;2019-10-10
2. Integrating Linear and Dependent Types;ACM SIGPLAN Notices;2015-05-11
3. Probabilistic relational verification for cryptographic implementations;Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages;2014-01-08
4. Combining proofs and programs in a dependently typed language;Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages;2014-01-08
5. Partiality, State and Dependent Types;Lecture Notes in Computer Science;2011