References

  1. Peter Aczel, JiříAdámek, Stefan Milius & JiříVelebil (2003): Infinite trees and completely iterative theories: a coalgebraic view. Theoretical Computer Science 300(1-3), pp. 1–45, doi:10.1016/S0304-3975(02)00728-4.
  2. JiříAdámek, Stefan Milius & JiříVelebil (2006): Elgot Algebras. Logical Methods in Computer Science 2(5), doi:10.2168/LMCS-2(5:4)2006.
  3. 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, doi:10.1007/978-3-642-28729-9_3.
  4. Robert Atkey & Patricia Johann (2015): Interleaving data and effects. Journal of Functional Programming 25, doi:10.1017/S0956796815000209.
  5. Roland Carl Backhouse, Marcel Bijsterveld, Rik van Geldrop & Jaap van der Woude (1995): Categorical Fixed Point Calculus. In: Category Theory and Computer Science, pp. 159–179, doi:10.1007/3-540-60164-3_25.
  6. Michael Barr & Charles Wells (1985): Toposes, Triples, and Theories. Grundlehren der mathematischen Wissenschaften. Springer-Verlag, New York. Available at http://www.tac.mta.ca/tac/reprints/articles/12/tr12abs.html, doi:10.1007/978-1-4899-0021-0.
  7. Jonathan M. Beck (1967): Triples, Algebras and Cohomology. Columbia University. Available at http://www.tac.mta.ca/tac/reprints/articles/2/tr2abs.html.
  8. Jonathan M. Beck (1969): Distributive laws. In: B. Eckmann: Seminar on Triples and Categorical Homology Theory, Lecture Notes in Mathematics 80. Springer Berlin Heidelberg, pp. 119–140, doi:10.1007/BFb0083084. Available at http://www.tac.mta.ca/tac/reprints/articles/18/tr18abs.html.
  9. Richard S. Bird (2006): A program to solve Sudoku (functional pearl). Journal of Functional Programming 16(6), pp. 671–679, doi:10.1017/S0956796806006058.
  10. Andrzej Filinski & Kristian Støvring (2007): Inductive Reasoning About Effectful Data Types. SIGPLAN Not. 42(9), pp. 97–110, doi:10.1145/1291220.1291168.
  11. Marcelo Fiore (2013): An equational metalogic for monadic equational systems. Theory and Applications of Categories 27(18), pp. 465–492. Available at http://www.tac.mta.ca/tac/volumes/27/18/27-18abs.html.
  12. Marcelo P. Fiore, Gordon D. Plotkin & Daniele Turi (1999): Abstract syntax and variable binding. In: 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999. IEEE Computer Society, pp. 193–202, doi:10.1109/LICS.1999.782615.
  13. Ralf Hinze (2000): Deriving backtracking monad transformers (functional pearl). In: Martin Odersky & Philip Wadler: Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP '00), Montreal, Canada, September 18-21, 2000.. ACM, pp. 186–197, doi:10.1145/351240.351258.
  14. Ralf Hinze (2012): Kan extensions for program optimisation or: Art and Dan explain an old trick. In: Jeremy Gibbons & Pablo Nogueira: Mathematics of Program Construction - 11th International Conference, MPC 2012, Madrid, Spain, June 25-27, 2012. Proceedings, Lecture Notes in Computer Science 7342. Springer, pp. 324–362, doi:10.1007/978-3-642-31113-0_16.
  15. John Hughes (1995): The design of a pretty-printing Library. In: Johan Jeuring & Erik Meijer: Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques, Båstad, Sweden, May 24-30, 1995, Tutorial Text, Lecture Notes in Computer Science 925. Springer, pp. 53–96, doi:10.1007/3-540-59451-5_3.
  16. Martin Hyland, Gordon D. Plotkin & John Power (2006): Combining effects: Sum and tensor. Theoretical Computer Science 357(1-3), pp. 70–99, doi:10.1016/j.tcs.2006.03.013.
  17. Martin Hyland & John Power (2006): Discrete Lawvere theories and computational effects. Theoretical Computer Science 366(1-2), pp. 144–162, doi:10.1016/j.tcs.2006.07.007.
  18. Mauro Jaskelioff & Eugenio Moggi (2010): Monad transformers as monoid transformers. Theoretical Computer Science 411(51–52), pp. 4441–4466, doi:10.1016/j.tcs.2010.09.011.
  19. Gregory M. Kelly (1980): A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on. Bulletin of the Australian Mathematical Society 22, pp. 1–83, doi:10.1017/S0004972700006353.
  20. Oleg Kiselyov, Chung-chieh Shan, Daniel P. Friedman & Amr Sabry (2005): Backtracking, Interleaving, and Terminating Monad Transformers: (Functional Pearl). SIGPLAN Notices 40(9), pp. 192–203, doi:10.1145/1090189.1086390.
  21. Anders Kock (1971): Closed categories generated by commutative monads. Journal of the Australian Mathematical Society 12, pp. 405–424, doi:10.1017/S1446788700010272.
  22. Tom Leinster (2013): Codensity and the ultrafilter monad. Theory and Applications of Categories 28(13), pp. 332–370. Available at http://www.tac.mta.ca/tac/volumes/28/13/28-13abs.html.
  23. Saunders Mac Lane (1998): Categories for the Working Mathematician. Graduate Texts in Mathematics. Springer, doi:10.1007/978-1-4757-4721-8.
  24. Eugenio Moggi (1989): An Abstract View of Programming Languages. Technical Report. Edinburgh University. Available at http://www.lfcs.inf.ed.ac.uk/reports/90/ECS-LFCS-90-113/.
  25. Philip Mulry (2013): Notions of Monad Strength. In: Anindya Banerjee, Olivier Danvy, Kyung-Goo Doh & John Hatcliff: Semantics, Abstract Interpretation, and Reasoning about Programs: Essays Dedicated to David A. Schmidt on the Occasion of his Sixtieth Birthday, Manhattan, Kansas, USA, 19-20th September 2013, Electronic Proceedings in Theoretical Computer Science 129. Open Publishing Association, pp. 67–83, doi:10.4204/EPTCS.129.6.
  26. Maciej Piróg & Jeremy Gibbons (2014): The Coinductive Resumption Monad. Electronic Notes in Theoretical Computer Science 308, pp. 273–288, doi:10.1016/j.entcs.2014.10.015. Mathematical Foundations of Programming Semantics (MFPS XXX).
  27. Gordon D. Plotkin & John Power (2003): Algebraic Operations and Generic Effects. Applied Categorical Structures 11(1), pp. 69–94, doi:10.1023/A:1023064908962.
  28. Exequiel Rivas & Mauro Jaskelioff (2014): Notions of Computation as Monoids. Available at http://arxiv.org/abs/1406.4823. Submitted to the Journal of Functional Programming.
  29. Exequiel Rivas, Mauro Jaskelioff & Tom Schrijvers (2015): From monoids to near-semirings: the essence of MonadPlus and alternative. In: Moreno Falaschi & Elvira Albert: Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, Siena, Italy, July 14-16, 2015. ACM, pp. 196–207, doi:10.1145/2790449.2790514.
  30. Philip Wadler (1985): How to replace failure by a list of Successes: A method for exception handling, backtracking, and pattern matching in lazy functional languages. In: Jean-Pierre Jouannaud: Functional Programming Languages and Computer Architecture, FPCA 1985, Nancy, France, September 16-19, 1985, Proceedings, Lecture Notes in Computer Science 201. Springer, pp. 113–128, doi:10.1007/3-540-15975-4_33.
  31. Mitchell Wand & Dale Vaillancourt (2004): Relating Models of Backtracking. SIGPLAN Notices 39(9), pp. 54–65, doi:10.1145/1016848.1016861.
  32. Harvey Wolff (1973): Monads and monoids on symmetric monoidal closed categories. Archiv der Mathematik 24(1), pp. 113–120, doi:10.1007/BF01228184.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org