1. M. Abadi, A. Banerjee, N. Heintze & J.G. Riecke (1999): A core calculus of dependency. In: POPL, doi:10.1145/292540.292555.
  2. Thorsten Altenkirch, James Chapman & Tarmo Uustalu (2010): Monads need not be endofunctors. In: FOSSACS, doi:10.1007/978-3-642-12032-9_21.
  3. Robert Atkey (2009): Parameterised notions of computation. Journal of Functional Programming 19(3 & 4), pp. 335–376, doi:10.1017/S095679680900728X.
  4. Greg Cooper & Shriram Krishnamurthi (2006): Embedding dynamic dataflow in a call-by-value language. In: ESOP, doi:10.1007/11693024_20.
  5. K. Crary, A. Kliger & F. Pfenning (2005): A monadic analysis of information flow security with mutable state. J. Funct. Program. 15(02), pp. 249–291, doi:10.1017/S0956796804005441.
  6. D. Devriese & F. Piessens (2011): Information flow enforcement in monadic libraries. In: TLDI, doi:10.1145/1929553.1929564.
  7. Conal Elliott & Paul Hudak (1997): Functional reactive animation. In: ICFP, doi:10.1145/258948.258973.
  8. A. Filinski (1999): Representing layered monads. In: POPL, doi:10.1145/292540.292557.
  9. Andrzej Filinski (1994): Representing monads. In: POPL, doi:10.1145/174675.178047.
  10. Jean-Christophe Filliâtre (1999): A Theory of Monads Parameterized By Effects.
  11. J.A. Goguen & J. Meseguer (1982): Security policy and security models. In: Symposium on Security and Privacy.
  12. John Hughes (2000): Generalising monads to arrows. Sci. Comput. Program. 37(1-3), doi:10.1016/S0167-6423(99)00023-4.
  13. Graham Hutton & Erik Meijer (1998): Monadic Parsing in Haskell. J. Funct. Program. 8(4), pp. 437–444, doi:10.1017/S0956796898003050.
  14. Mark P. Jones (1992): A theory of qualified types. In: ESOP, doi:10.1007/3-540-55253-7_17.
  15. Mark P. Jones (1993): Coherence for Qualified Types. Technical Report YALEU/DCS/RR-989. Yale University.
  16. Mark P. Jones (1994): Simplifying and Improving Qualified Types. Technical Report YALEU/DCS/RR-1040. Yale University.
  17. O. Kiselyov & C. Shan (2008): Lightweight monadic regions. In: Haskell Symposium, doi:10.1145/1411286.1411288.
  18. Edward Kmett (2012): Control.Monad.Parameterized package. On Hackage repository.
  19. P. Li & S. Zdancewic (2006): Encoding information flow in Haskell. In: CSFW, doi:10.1109/CSFW.2006.13.
  20. E. Moggi (1989): Computational Lambda-calculus and Monads. In: Proceedings of the Fourth Annual Symposium on Logic in Computer Science. IEEE Press, pp. 14–23, doi:10.1109/lics.1989.39155.
  21. Iulian Neamtiu, Michael Hicks, Jeffrey S. Foster & Polyvios Pratikakis (2008): Contextual Effects for Version-Consistent Dynamic Software Updating and Safe Concurrent Programming. In: POPL, doi:10.1145/1328438.1328447.
  22. Gordon D. Plotkin & John Power (2001): Semantics for Algebraic Operations. Electr. Notes Theor. Comput. Sci. 45, doi:10.1016/S1571-0661(04)80970-8.
  23. R. Pucella & J.A. Tov (2008): Haskell session types with (almost) no class. In: Haskell Symposium, doi:10.1145/1411286.1411290.
  24. Norman Ramsey & Avi Pfeffer (2002): Stochastic lambda calculus and monads of probability distributions. In: POPL, doi:10.1145/565816.503288.
  25. Alejandro Russo, Koen Claessen & John Hughes (2008): A library for lightweight information-flow security in Haskell. In: Haskell Symposium, doi:10.1145/1411286.1411289.
  26. Nikhil Swamy, Nataliya Guts, Daan Leijen & Michael Hicks (2011): Lightweight Monadic Programming in ML. In: ICFP, doi:10.1145/2034574.2034778.
  27. Ross Tate (2013): The Sequential Semantics of Producer Effect Systems. In: POPL, doi:10.1145/2480359.2429074.
  28. Tarmo Uustalu & Varmo Vene (2008): Comonadic Notions of Computation. Electr. Notes Theor. Comput. Sci. 203(5), doi:10.1016/j.entcs.2008.05.029.
  29. Philip Wadler & Peter Thiemann (2003): The marriage of effects and monads. ACM Trans. Comput. Logic 4, pp. 1–32, doi:10.1145/601775.601776.

Comments and questions to:
For website issues: