A monadic formalization of ML5

Electronic Proceedings in Theoretical Computer Science, EPTCS

Volumn 34, Issue , 2010, Pages 69-83

  Licata, Daniel R ^a   Harper, Robert ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADA (PROGRAMMING LANGUAGE); DISTRIBUTED COMPUTER SYSTEMS; FORMAL LOGIC; SEMANTICS;

CURRY-HOWARD CORRESPONDENCE; DEPENDENTLY TYPED PROGRAMMING; KRIPKE SEMANTICS; MODAL LOGIC; MODAL LOGIC S5; PROOF THEORY; SEMANTIC EMBEDDING;

COMPUTER CIRCUITS;

EID: 84865576288     PISSN: 20752180     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4204/EPTCS.34.7     Document Type: Conference Paper

References (28)

1. M. Abadi, A. Banerjee, N. Heintze, and J. G. Riecke. A core calculus of dependency. In Proc. 26th ACM Symp. on Principles of Programming Languages (POPL, pages 147-160. ACM Press, 1999.
2. S. F. Allen. From dy/dx to[]P: A matter of notation. In Proceedings of the Conference on User Interfaces for Theorem Provers, 1998.
3. T. Altenkirch and C. McBride. Generic programming within dependently typed programming. In IFIP TC2 Working Conference on Generic Programming, Schloss Dagstuhl, 2003.
4. T. Altenkirch, C. McBride, and W. Swierstra. Observational equality, now! In Programming Languages meets Program Verification Workshop, 2007.
5. C. Areces, P. Blackburn, and M. Marx. Hybrid logics: Characterization, interpolation and complexity. Journal of Symbolic Logic, 66(3):977-1010, 2001.
6. R. Atkey. Parameterised notions of computation. Journal of Functional Programming, 19(3-4):335-376, 2009.
7. K. Avijit, A. Datta, and R. Harper. Distributed programming with distributed authorization. In ACM SIGPLAN-SIGACT Symposium on Types in Language Design and Implementation, 2010.
8. A. Avron, F. Honsell, M. Miculan, and C. Paravano. Encoding modal logics in logical frameworks. Studia Logica, 60(1):161-208, 1998.
9. M. Benke, P. Dybjer, and P. Jansson. Universes for generic programs and proofs in dependent type theory. Nordic Journal of Computing, 10(4):265-289, 2003.
10. P. Benton, G. M. Bierman, and V. C. V. D. Paiva. Computational types from a logical perspective. Journal of Functional Programming, 8(2):177-193, 1998.
11. A. Bucalo, M. Hofmann, F. Honsell, M. Miculan, and I. Scagnetto. Consistency of the theory of contexts. Journal of Functional Programming, 16(3):327-395, May 2006.
12. A. Chlipala. A certified type-preserving compiler from l-calculus to assembly language. In ACM SIGPLAN Conference on Programming Language Design and Implementation, 2007.
13. Coq Development Team. The Coq Proof Assistant Reference Manual. INRIA, 2007. Available from http://coq.inria.fr/.
14. K. Crary. Type Theoretic Methodology for Practical Programming Languages. PhD thesis, Cornell University, 1998.
15. H. Curry. The elimination theorem when modality is present. Journal of Symbolic Logic, 17:249-265, 1952.
16. J. Despeyroux, A. Felty, and A. Hirschowitz. Higher-order abstract syntax in Coq. In M. Dezani-Ciancaglini and G. Plotkin, editors, International Conference on Typed Lambda Calculi and Applications, Volume 902 of Lecture Notes in Computer Science, pages 124-138, Edinburgh, Scotland, 1995. Springer-Verlag.
17. P. Dybjer and A. Setzer. Indexed induction-recursion. In Proof Theory in Computer Science, pages 93-113. Springer, 2001.
18. R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. Journal of the Association for Computing Machinery, 40(1), 1993.
19. L. Jia and D. Walker. Modal proofs as distributed programs. In European Symposium on Programming, Volume 2986 of Lecture Notes in Computer Science. Springer, April 2004.
20. D. R. Licata and R. Harper. A universe of binding and computation. In ACM SIGPLAN International Conference on Functional Programming, 2009.
21. E. Moggi. Notions of computation and monads. Information And Computation, 93(1), 1991.
22. J. Morgenstern and D. R. Licata. Security-typed programming within dependently-typed programming. Available from http://www.cs.cmu.edu/~drl, April 2010.
23. T. Murphy, VII. Modal Types for Mobile Code. PhD thesis, Carnegie Mellon, January 2008. Available as technical report CMU-CS-08-126.
24. A. Nanevski, G. Morrisett, and L. Birkedal. Polymorphism and separation in Hoare Type Theory. In ACM SIGPLAN International Conference on Functional Programming, pages 62-73, Portland, Oregon, 2006.
25. U. Norell. Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers University of Technology, 2007.
26. F. Pfenning and C. Schürmann. System description: Twelf - a meta-logical framework for deductive systems. In H. Ganzinger, editor, International Conference on Automated Deduction, pages 202-206, 1999.
27. A. Russo, K. Claessen, and J. Hughes. A library for light-weight information-flow security in Haskell. In ACM SIGPLAN Symposium on Haskell, pages 13-24. ACM, 2008.
28. A. Simpson. The Proof Theory and Semantics of Intuitionistic Modal Logic. PhD thesis, University of Edinburgh, 1993.