References

  1. Marcelo Aguiar & Swapneel Mahajan (2010): Monoidal Functors, Species and Hopf Algebras. CRM monograph series. American Mathematical Society, doi:10.1090/crmm/029.
  2. Thorsten Altenkirch, James Chapman & Tarmo Uustalu (2015): Monads need not be endofunctors. Logical Methods in Computer Science Volume 11, Issue 1, doi:10.2168/LMCS-11(1:3)2015.
  3. Robert Atkey (2011): What is a Categorical Model of Arrows?. Electronic Notes in Theoretical Computer Science 229(5), pp. 19 – 37, doi:10.1016/j.entcs.2011.02.014. Proceedings of the Second Workshop on Mathematically Structured Functional Programming (MSFP 2008).
  4. Geraldine Brady & Todd H. Trimble (2000): A categorical interpretation of C.S. Peirce's propositional logic Alpha. Journal of Pure and Applied Algebra 149(3), pp. 213 – 239, doi:10.1016/S0022-4049(98)00179-0.
  5. Marcelo Fiore & Philip Saville (2017): List Objects with Algebraic Structure. In: Dale Miller: 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017), Leibniz International Proceedings in Informatics (LIPIcs) 84. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pp. 16:1–16:18, doi:10.4230/LIPIcs.FSCD.2017.16.
  6. P. Gabriel & M. Zisman (1967): Calculus of fractions and homotopy theory. Ergebnisse der Mathematik und ihrer Grenzgebiete. Springer-Verlag, doi:10.1007/978-3-642-85844-4.
  7. John Hughes (2000): Generalising monads to arrows. Science of Computer Programming 37(1), pp. 67 – 111, doi:10.1016/S0167-6423(99)00023-4.
  8. Bart Jacobs, Chris Heunen & Ichiro Hasuo (2009): Categorical Semantics for Arrows. J. Funct. Program. 19(3-4), pp. 403–438, doi:10.1017/S0956796809007308.
  9. G. M. Kelly (1974): Doctrinal adjunction. In: Gregory M. Kelly: Category Seminar. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 257–280, doi:10.1007/BFb0063105.
  10. Paul Blain Levy, John Power & Hayo Thielecke (2003): Modelling environments in call-by-value programming languages. Information and Computation 185(2), pp. 182 – 210, doi:10.1016/S0890-5401(03)00088-9.
  11. Sam Lindley, Philip Wadler & Jeremy Yallop (2011): Idioms Are Oblivious, Arrows Are Meticulous, Monads Are Promiscuous. Electronic Notes Theoretical Computer Science 229(5), pp. 97–117, doi:10.1016/j.entcs.2011.02.018.
  12. F. Loregian (2015): This is the (co)end, my only (co)friend. ArXiv e-prints. Available at https://arxiv.org/abs/1501.02503.
  13. Saunders Mac Lane (1971): Categories for the Working Mathematician. Graduate Texts in Mathematics 5. Springer-Verlag, doi:10.1007/978-1-4612-9839-7. Second edition, 1998.
  14. Conor McBride & Ross Paterson (2008): Applicative Programming with Effects. J. Funct. Program. 18(1), pp. 1–13, doi:10.1017/S0956796807006326.
  15. I. Moerdijk (2002): Monads on tensor categories. Journal of Pure and Applied Algebra 168(2), pp. 189 – 208, doi:10.1016/S0022-4049(01)00096-2. Category Theory 1999: selected papers, conference held in Coimbra in honour of the 90th birthday of Saunders Mac Lane.
  16. Craig Pastro & Ross Street (2008): Doubles for monoidal categories. Theory and Applications of Categories 21, pp. 61–75. Available at http://www.tac.mta.ca/tac/volumes/21/4/21-04abs.html.
  17. Ruben P. Pieters, Tom Schrijvers & Exequiel Rivas (2017): Handlers for Non-Monadic Computations (Extended Version). Technical Report. Available at http://www.cs.kuleuven.be/publicaties/rapporten/cw/CW713.abs.html. Presented at IFL2017.
  18. Hans-E. Porst & Ross Street (2016): Generalizations of the Sweedler Dual. Applied Categorical Structures 24(5), pp. 619–647, doi:10.1007/s10485-016-9450-2.
  19. Exequiel Rivas & Mauro Jaskelioff (2017): Notions of computation as monoids. Journal of Functional Programming 27, pp. e21, doi:10.1017/S0956796817000132.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org