References

  1. S. Abramsky & B. Coecke (2004): A Categorical Semantics of Quantum Protocols. In: 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 14-17 July 2004, Turku, Finland, Proceedings. IEEE Computer Society, pp. 415–425, doi:10.1109/LICS.2004.1319636.
  2. M. Barr & C. Wells (2005): Toposes, Triples and Theories. Reprints in Theory and Applications of Categories 1, pp. 1–289.
  3. J. Beck (1969): Distributive Laws. In: H. Appelgate, M. Barr, J. Beck, F.W. Lawvere, F. Linton, E. Manes, M. Tierney & F. Ulmer: Seminar on Triples and Categorical Homotopy Theory, Lecture Notes in Mathematics 80. Springer, pp. 119–140, doi:10.1007/BFb0083084.
  4. F. Borceux (1994): Handbook of Categorical Algebra 2. Cambridge University Press, doi:10.1017/CBO9780511525872.
  5. B. Coecke & A. Kissinger (2016): Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning. Book in preparation.
  6. B. Coecke, M. Sadrzadeh & S. Clark (2010): Mathematical Foundations for Distributed Compositional Model of Meaning. Lambek Festschrift. Linguistic Analysis 36, pp. 345–384.
  7. S. Eilenberg & J.C. Moore (1965): Adjoint functors and triples. Illinois Journal of Mathematics 9(3), pp. 381–398.
  8. T. Fritz (2009): Convex Spaces I: Definition and Examples. arXiv preprint arXiv:0903.5522.
  9. S. Gogioso (2015): A Bestiary of Sets and Relations. In: Chris Heunen, Peter Selinger & Jamie Vicary: Proceedings of the 12th International Workshop on Quantum Physics and Logic, Oxford, U.K., July 15-17, 2015, Electronic Proceedings in Theoretical Computer Science 195. Open Publishing Association, pp. 208–227, doi:10.4204/EPTCS.195.16.
  10. C. Heunen & J. Vicary (2016): Categorical Quantum Mechanics: An Introduction. Book in preparation.
  11. B. Jacobs (1994): Semantics of Weakening and Contraction. Ann. Pure Appl. Logic 69, doi:10.1016/0168-0072(94)90020-5.
  12. B. Jacobs (2010): Convexity, Duality and Effects. In: C. S. Calude & V. Sassone: Theoretical Computer Science - 6th IFIP TC 1/WG 2.2 International Conference, TCS 2010, Held as Part of WCC 2010, Brisbane, Australia, September 20-23, 2010. Proceedings, IFIP Advances in Information and Communication Technology 323. Springer, pp. 1–19, doi:10.1007/978-3-642-15240-5_1.
  13. B. Jacobs (2011): Coalgebraic Walks, in Quantum and Turing Computation. In: M. Hofmann: Foundations of Software Science and Computational Structures - 14th International Conference, FOSSACS 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26-April 3, 2011. Proceedings, Lecture Notes in Computer Science 6604. Springer, pp. 12–26, doi:10.1007/978-3-642-19805-2_2.
  14. B. Jacobs (2012): Introduction to Coalgebra, Towards Mathematics of States and Observation. Book in preparation.
  15. B. Jacobs, J. Mandemaker & R. Furber (2016): The expectation monad in quantum foundations. Information and Computation, doi:10.1016/j.ic.2016.02.009.
  16. D. Kartsaklis (2014): Compositional Distributional Semantics with Compact Closed Categories and Frobenius Algebras. University of Oxford.
  17. G.M. Kelly (2005): Basic Concepts of Enriched Category Theory. Reprints in the Theory and Applications of Category Theory.
  18. A. Kock (1971): Bilinearity and cartesian closed monads. Math. Scand. 29, pp. 161–174.
  19. A. Kock (1972): Strong functors and monoidal monads. Archiv der Mathematik 23(1), pp. 113–120, doi:10.1007/BF01304852.
  20. J. Lambek (1997): Type grammar revisited. In: Logical aspects of computational linguistics. Springer, pp. 1–27.
  21. H. Lindner (1979): Affine parts of monads. Archiv der Mathematik 33(1), pp. 437–443, doi:10.1007/BF01222782.
  22. S. MacLane (1978): Categories for the Working Mathematician, 2 edition, Graduate Texts in Mathematics 5. Springer, doi:10.1007/978-1-4757-4721-8.
  23. E.G. Manes (1976): Algebraic Theories. Graduate Texts in Mathematics 26. Springer, doi:10.1007/978-1-4612-9860-1_2.
  24. D. Marsden (2015): A Graph Theoretic Perspective on CPM(Rel). In: Chris Heunen, Peter Selinger & Jamie Vicary: Proceedings of the 12th International Workshop on Quantum Physics and Logic, Oxford, U.K., July 15-17, 2015, Electronic Proceedings in Theoretical Computer Science 195. Open Publishing Association, pp. 273–284, doi:10.4204/EPTCS.195.20.
  25. E. Moggi (1991): Notions of computation and monads. Information and Computation 93(1), pp. 55–92, doi:10.1016/0890-5401(91)90052-4.
  26. R. Piedeleu (2014): Ambiguity in Categorical Models of Meaning. University of Oxford.
  27. R. Piedeleu, D. Kartsaklis, B. Coecke & M. Sadrzadeh (2015): Open System Categorical Quantum Semantics in Natural Language Processing. In: L. S. Moss & P. Sobocinski: 6th Conference on Algebra and Coalgebra in Computer Science, CALCO 2015, June 24-26, 2015, Nijmegen, The Netherlands, LIPIcs 35. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 270–289, doi:10.4230/LIPIcs.CALCO.2015.270.
  28. G. D. Plotkin & J. Power (2002): Notions of Computation Determine Monads. In: M. Nielsen & U. Engberg: Foundations of Software Science and Computation Structures, 5th International Conference, FOSSACS 2002. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002 Grenoble, France, April 8-12, 2002, Proceedings, Lecture Notes in Computer Science 2303. Springer, pp. 342–356, doi:10.1007/3-540-45931-6_24.
  29. P. Selinger (2007): Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract). Electronic Notes Theoretical Computer Science 170, pp. 139–163, doi:10.1016/j.entcs.2006.12.018.
  30. C.C. Shan (2001): Monads for Natural Language Semantics. In: K. Streignitz: Proceedings of the ESSLLI-2001 Student Session. Institute for Logic, Language and Computation, University of Amsterdam, pp. 285–298.
  31. P. Wadler (1995): Monads for Functional Programming. In: J. Jeuring & E. 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. 24–52, doi:10.1007/3-540-59451-5_2.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org