Lightweight monadic programming in ML

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2011, Pages 15-27

  Swamy, Nikhil ^a   Guts, Nataliya ^b   Leijen, Daan ^a   Hicks, Michael ^b  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Coercion; Coherence; Monad; Rewriting; Type

Indexed keywords

COERCION; FUNCTIONAL LANGUAGES; INFORMATION FLOWS; MONAD; MORPHISMS; PROBABILISTIC MODELING; REACTIVE PROGRAMMING; REWRITING; REWRITING ALGORITHM; TYPE;

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; SEMANTICS;

FUNCTIONAL PROGRAMMING;

EID: 80054072580     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2034773.2034778     Document Type: Conference Paper

References (29)

1. M. Abadi, A. Banerjee, N. Heintze, and J.G. Riecke. A core calculus of dependency. In POPL, volume 26, pages 147-160, 1999.
2. Nick Benton and Andrew Kennedy. Monads, effects and transformations. In Electronic Notes in Theoretical Computer Science, 1999.
3. Greg Cooper and Shriram Krishnamurthi. Embedding dynamic dataflow in a call-by-value language. In ESOP, 2006.
4. K. Crary, A. Kliger, and F. Pfenning. A monadic analysis of information flow security with mutable state. Journal of functional programming, 15(02):249-291, 2005.
5. L. Damas and R. Milner. Principal type-schemes for functional programs. In POPL, pages 207-212, 1982.
6. D.E. Denning. A lattice model of secure information flow. Communications of the ACM, 19(5):236-243, 1976.
7. D. Devriese and F. Piessens. Information flow enforcement in monadic libraries. In TLDI, pages 59-72, 2011.
8. Conal Elliott and Paul Hudak. Functional reactive animation. In ICFP, pages 263-273, 1997.
9. A. Filinski. Representing layered monads. In POPL, pages 175-188, 1999.
10. A. Filinski. Monads in action. In POPL, pages 483-494, 2010.
11. Andrzej Filinski. Representing monads. In POPL, 1994.
12. J.A. Goguen and J. Meseguer. Security policy and security models. In Symposium on Security and Privacy, pages 11-20, 1982.
13. Graham Hutton and Erik Meijer. Monadic Parsing in Haskell. JFP, 8(4), 1998.
14. Mark P. Jones. A theory of qualified types. In ESOP, 1992.
15. Mark P. Jones. Coherence for qualified types. Technical Report YALEU/DCS/RR-989, Yale University, September 1993.
16. Mark P. Jones. Simplifying and Improving Qualified Types. Technical Report YALEU/DCS/RR-1040, Yale University, June 1994.
17. Mark P. Jones and Luc Duponcheel. Composing monads. Technical Report YALEU/DCS/RR-1004, Yale University, 1993.
18. Oleg Kiselyov and Chung chieh Shan. Embedded probabilistic programming. In DSL, 2009.
19. P. Li and S. Zdancewic. Encoding information flow in Haskell. In CSFW, pages 16-27, 2006.
20. Z. Luo. Coercions in a polymorphic type system. MSCS, 18(4), 2008.
21. Z. Luo and R. Kießling. Coercions in Hindley-Milner systems. In Proc. of Types, 2004.
22. Eugenio Moggi. Computational lambda-calculus and monads. In LICS, 1989.
23. Judea Pearl. Embracing causality in default reasoning (research note). Artificial Intelligence, 35(2):259-271, 1988.
24. F. Pottier and V. Simonet. Information flow inference for ML. TOPLAS, 25(1):117-158, 2003.
25. Norman Ramsey and Avi Pfeffer. Stochastic lambda calculus and monads of probability distributions. In POPL, pages 154-165, 2002.
26. Alejandro Russo, Koen Claessen, and John Hughes. A library for light-weight information-flow security in haskell. In Haskell, 2008.
27. Nikhil Swamy, Nataliya Guts, Daan Leijen, and Michael Hicks. Lightweight monadic programming in ML. Technical Report MSRTR-2011-039, Microsoft Research, May 2011.
28. Nikhil Swamy, Michael Hicks, and Gavin M. Bierman. A theory of typed coercions and its applications. In ICFP, 2009.
29. Philip Wadler. The essence of functional programming. In POPL, 1992.