References

  1. Robert Atkey, Neil Ghani, Bart Jacobs & Patricia Johann (2012): Fibrational Induction Meets Effects. In: Lars Birkedal: Foundations of Software Science and Computational Structures, Lecture Notes in Computer Science 7213. Springer, pp. 42–57. To Appear.
  2. Andrew Butterfield & Glenn Strong (2002): Proving Correctness of Programs with I/O - A Paradigm Comparison. In: Selected Papers from the 13th International Workshop on Implementation of Functional Languages, IFL '02. Springer-Verlag, London, UK, pp. 72–87, doi:10.1007/3-540-46028-4_5.
  3. Venanzio Capretta (2005): General Recursion via Coinductive Types. Logical Methods in Computer Science 1(2), pp. 1–18, doi:10.2168/LMCS-1(2:1)2005.
  4. Pietro Cenciarelli & Eugenio Moggi (1993): A Syntactic Approach to Modularity in Denotational Semantics. In: Proceedings of the 5th Biennial Meeting on Category Theory and Computer Science, CTCS '93. CWI Technical Report, Amsterdam, The Netherlands.
  5. Koen Claessen (1999): A poor man's concurrency monad. Journal of Functional Programming 9, pp. 313–323, doi:10.1017/S0956796899003342.
  6. Malcolm Dowse, Glenn Strong & Andrew Butterfield (2003): Proving make correct: I/O proofs in Haskell and Clean. In: Proceedings of the 14th International Conference on Implementation of Functional Languages, IFL'02. Springer-Verlag, Berlin, Heidelberg, pp. 68–83, doi:10.1007/3-540-44854-3_5.
  7. Andrzej Filinski & Kristian Støvring (2007): Inductive reasoning about effectful data types. In: Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming, ICFP '07. ACM, New York, NY, USA, pp. 97–110, doi:10.1145/1291151.1291168.
  8. Steven E. Ganz, Daniel P. Friedman & Mitchell Wand (1999): Trampolined style. In: Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming, ICFP '99. ACM, New York, NY, USA, pp. 18–27, doi:10.1145/317636.317779.
  9. William L. Harrison: Cheap (But Functional) Threads. Available at http://www.cs.missouri.edu/~harrison/drafts/CheapThreads.pdf.
  10. William L. Harrison (2006): The Essence of Multitasking. In: 1st International Conference on Algebraic Methodology and Software Technology (AMAST06), LNCS 4019. Springer-Verlag, doi:10.1007/11784180_14.
  11. Matthew Hennessy & Gordon Plotkin (1979): Full Abstraction for a Simple Parallel Programming Language. In: Jir\'ıBecvár: MFCS, Lecture Notes in Computer Science 74. Springer, pp. 108–120, doi:10.1007/3-540-09526-8_8.
  12. Ralf Hinze (2000): Deriving backtracking monad transformers. In: Proceedings of the fifth ACM SIGPLAN International Conference on Functional Programming, ICFP '00. ACM, New York, NY, USA, pp. 186–197, doi:10.1145/351240.351258.
  13. Martin Hyland, Gordon Plotkin & John Power (2006): Combining effects: sum and tensor. Theoretical Computer Science 357, pp. 70–99, doi:10.1016/j.tcs.2006.03.013.
  14. Mark P. Jones & Luc Duponcheel (1993): Composing Monads. Technical Report. Yale University.
  15. Donald Knuth & Andrew Yao (1976): The Complexity of Nonuniform Random Number Generation. In: J. F. Traub: Algorithms and Complexity: New Directions and Recent Results. Academic Press. Also in Selected Papers on the Analysis of Algorithms.
  16. Sheng Liang, Paul Hudak & Mark Jones (1995): Monad transformers and modular interpreters. In: Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '95. ACM, New York, NY, USA, pp. 333–343, doi:10.1145/199448.199528.
  17. Chuan-kai Lin (2006): Programming monads operationally with Unimo. In: Proceedings of the eleventh ACM SIGPLAN International Conference on Functional Programming, ICFP '06. ACM, New York, NY, USA, pp. 274–285, doi:10.1145/1159803.1159840.
  18. John McCarthy (1963): A Basis for a Mathematical Theory of Computation. In: P. Braffort & D. Hirschberg: Computer Programming and Formal Systems. North-Holland, Amsterdam, pp. 33–70, doi:10.1016/S0049-237X(08)72018-4.
  19. Eugenio Moggi (1991): Notions of computation and monads. Information and Computation 93, pp. 55–92, doi:10.1016/0890-5401(91)90052-4.
  20. Nikolaos S. Papaspyrou (2001): A Resumption Monad Transformer and its Applications in the Semantics of Concurrency. In: Proceedings of the 3rd Panhellenic Logic Symposium, Anogia, Crete.
  21. Simon L. Peyton Jones & Philip Wadler (1993): Imperative functional programming. In: Proceedings of the 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '93. ACM, New York, NY, USA, pp. 71–84, doi:10.1145/158511.158524.
  22. Wouter Swierstra (2008): A Functional Specification of Effects. University of Nottingham.
  23. Wouter Swierstra & Thorsten Altenkirch (2007): Beauty in the beast. In: Proceedings of the ACM SIGPLAN Workshop on Haskell, Haskell '07. ACM, New York, NY, USA, pp. 25–36, doi:10.1145/1291201.1291206.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org