Dependent types and multi-monadic effects in F∗

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn 20-22-January-2016, Issue , 2016, Pages 256-270

  Swamy, Nikhil ^a   Hriţcu, Cətəlin ^b   Keller, Chantal ^a,c   Rastogi, Aseem ^d   Delignat Lavaud, Antoine ^b,e   Forest, Simon ^b,e   Bhargavan, Karthikeyan ^b   Fournet, Cédric ^a,c   Strub, Pierre Yves ^f   Kohlweiss, Markulf ^a   Zinzindohoue, Jean Karim ^b,e   Zanella Béguelin, Santiago ^a  

^a MICROSOFT RESEARCH   (United States)

^b INRIA   (France)

^c MSR INRIA   (France)

^d UMD   (France)

^e ECOLE NORMALE SUPÉRIEURE   (France)

^f IMDEA SOFTWARE INSTITUTE   (Spain)

Author keywords

Effectful programming; Proof assistants; Verification

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; COMPUTER PROGRAMMING LANGUAGES; DIFFERENTIATION (CALCULUS); SEMANTICS; SPECIFICATIONS; VERIFICATION;

CONSTRUCTIVE PROOF; GENERAL-PURPOSE PROGRAMMING LANGUAGE; PREDICATE TRANSFORMER SEMANTICS; PROOF ASSISTANT; PROOF OBLIGATIONS; SIMPLY TYPED LAMBDA CALCULUS; WEAKEST PRECONDITION; WELL-FOUNDED ORDERINGS;

COMPUTATIONAL LINGUISTICS;

EID: 84962556156     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2837614.2837655     Document Type: Conference Paper

References (42)

1. A. Abel. foetus - termination checker for simple functional programs. Programming Lab Report 474, LMU München, 1998.
2. A. Abel. Type-based termination: a polymorphic lambda-calculus with sized higher-order types. PhD thesis, LMU München, 2007.
3. R. Adams. Formalized metatheory with terms represented by an indexed family of types. In Types for Proofs and Programs, International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers, 2006.
4. T. Altenkirch and B. Reus. Monadic presentations of lambda terms using generalized inductive types. In Computer Science Logic, 13th International Workshop, CSL '99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings, 1999.
5. R. Atkey. Parameterised notions of computation. Journal of Functional Programming, 19:335-376, 2009.
6. L. Augustsson. Cayenne - A language with dependent types. In Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming, 1998.
7. G. Barthe, M. J. Frade, E. Giménez, L. Pinto, and T. Uustalu. Typebased termination of recursive definitions. Mathematical Structures in Computer Science, 14(1):97-141, 2004.
8. N. Benton, C. Hur, A. Kennedy, and C. McBride. Strongly typed term representations in Coq. J. Autom. Reasoning, 49(2):141-159, 2012.
9. K. Bhargavan, C. Fournet, and A. D. Gordon. Modular verification of security protocol code by typing. In 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'10), 2010.
10. K. Bhargavan, C. Fournet, M. Kohlweiss, A. Pironti, and P. Strub. Implementing TLS with verified cryptographic security. In IEEE Symposium on Security and Privacy, 2013.
11. A. Bove. Simple general recursion in type theory. Nordic Journal of Computing, 8(1):22-42, 2001.
12. E. Brady. Programming and reasoning with algebraic effects and dependent types. In Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming, 2013.
13. C. Casinghino, V. Sjöberg, and S. Weirich. Combining proofs and programs in a dependently typed language. In The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, San Diego, CA, USA, January 20-21, 2014, 2014.
14. C. Chen and H. Xi. Combining Programming with Theorem Proving. In Proceedings of the Tenth ACM SIGPLAN International Conference on Functional Programming, September 2005.
15. A. Chlipala, G. Malecha, G. Morrisett, A. Shinnar, and R. Wisnesky. Effective interactive proofs for higher-order imperative programs. In Proceedings of the 14th ACM SIGPLAN International Conference on Functional Programming, 2009.
16. R. L. Constable, S. F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harper, D. J. Howe, T. B. Knoblock, N. P. Mendler, P. Panangaden, J. T. Sasaki, and S. F. Smith. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, 1986.
17. T. Dierks and E. Rescorla. The Transport Layer Security (TLS) Protocol Version 1.2. IETF RFC 5246, 2008.
18. E. W. Dijkstra. Guarded commands, nondeterminacy and formal derivation of programs. Commun. ACM, 18(8):453-457, Aug. 1975.
19. J.-C. Filliâtre and A. Paskevich. Why3 - where programs meet provers. In M. Felleisen and P. Gardner, editors, Proceedings of the 22nd European Symposium on Programming. Mar. 2013.
20. T. Freeman and F. Pfenning. Refinement types for ML. In Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation (PLDI), Toronto, Ontario, Canada, June 26-28, 1991, 1991.
21. R. Harper. Practical foundations for programming languages. Cambridge University Press, second edition, 2015.
22. G. Kimmell, A. Stump, H. D. E. III, P. Fu, T. Sheard, S. Weirich, C. Casinghino, V. Sjöberg, N. Collins, and K. Y. Ahn. Equational reasoning about programs with general recursion and call-by-value semantics. Progress in Informatics, 2013.
23. A. Krauss, C. Sternagel, R. Thiemann, C. Fuhs, and J. Giesl. Termination of Isabelle functions via termination of rewriting. In Second International Conference on Interactive Theorem Proving. 2011.
24. B. W. Lampson, J. J. Horning, R. L. London, J. G. Mitchell, and G. J. Popek. Report on the programming language Euclid. SIGPLAN Not., 12(2):1-79, Feb. 1977.
25. K. R. M. Leino. Dafny: An automatic program verifier for functional correctness. In Proceedings of the 16th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning. 2010.
26. P. Letouzey. Coq extraction, an overview. In LTA '08. 2008.
27. J. McCarthy. Towards a mathematical science of computation. In IFIP Congress, 1962.
28. E. Moggi. Computational lambda-calculus and monads. In Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), Pacific Grove, California, USA, June 5-8, 1989, 1989.
29. A. Nanevski, J. G. Morrisett, and L. Birkedal. Hoare type theory, polymorphism and separation. J. Funct. Program., 18(5-6):865-911, 2008.
30. U. Norell. Towards a practical programming language based on dependent type theory. PhD thesis, Department of Computer Science and Engineering, Chalmers University of Technology, 2007.
31. P. Rogaway. Authenticated-encryption with associated-data. In 9th ACM Conference on Computer and Communications Security, 2002.
32. P. M. Rondon, M. Kawaguchi, and R. Jhala. Liquid types. In Proceedings of the ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation, Tucson, AZ, USA, June 7-13, 2008, 2008.
33. J. Rushby, S. Owre, and N. Shankar. Subtypes for specifications: Predicate subtyping in pvs. IEEE Transactions on Software Engineering, 24:709-720, 1998.
34. S. Schäfer, T. Tebbi, and G. Smolka. Autosubst: Reasoning with de Bruijn terms and parallel substitutions. In Interactive Theorem Proving - 6th International Conference, ITP 2015, Nanjing, China, August 24-27, 2015, Proceedings. 2015.
35. M. Sozeau. Subset Coercions in Coq. In T. Altenkirch and C. McBride, editors, TYPES'06. 2007.
36. N. Swamy, J. Chen, C. Fournet, P. Strub, K. Bhargavan, and J. Yang. Secure distributed programming with value-dependent types. J. Funct. Program., 23(4):402-451, 2013a.
37. N. Swamy, J.Weinberger, C. Schlesinger, J. Chen, and B. Livshits. Verifying higher-order programs with the Dijkstra monad. In Proceedings of the 34th annual ACM SIGPLAN conference on Programming Language Design and Implementation, 2013b.
38. The Coq development team. The Coq proof assistant.
39. M. Tofte and J.-P. Talpin. Region-based memory management. Inf. Comput., 132(2):109-176, Feb. 1997.
40. M. Utting. Reasoning about aliasing. In The Fourth Australasian Refinement Workshop, 1996.
41. N. Vazou, E. L. Seidel, R. Jhala, D. Vytiniotis, and S. L. P. Jones. Refinement types for Haskell. In Proceedings of the 19th ACM SIGPLAN international conference on Functional programming (ICFP'14), 2014.
42. B. Ziliani, D. Dreyer, N. R. Krishnaswami, A. Nanevski, and V. Vafeiadis. Mtac: a monad for typed tactic programming in Coq. In G. Morrisett and T. Uustalu, editors, ACM SIGPLAN International Conference on Functional Programming. 2013.