References

  1. Alexandru Baltag & Sonja Smets (2004): The Logic of Quantum Programs. In: QPL 2004, pp. 39–56.
  2. Alexandru Baltag & Sonja Smets (2005): Complete Axiomatizations for Quantum Actions. International Journal of Theoretical Physics 44, doi:10.1007/s10773-005-8022-2.
  3. Alexandru Baltag & Sonja Smets (2005): LQP: The Dynamic Logic of Quantum Information. Mathematical Structures in Computer Science, doi:10.1017/s0960129506005299.
  4. Alexandru Baltag & Sonja Smets (2011): Quantum Logic as a Dynamic Logic. Synthese 179, pp. 285–306, doi:10.1007/s11229-010-9783-6.
  5. Alexandru Baltag & Sonja Smets (2012): The Dynamic Turn in Quantum Logic. Synthese 186, pp. 753–773, doi:10.1007/s11229-011-9915-7.
  6. Nick Benton, Gavin Bierman, Valeria De Paiva & Martin Hyland (1993): A Term Calculus for Intuitionistic Linear Logic. In: TLCA, Lecture Notes in Computer Science 664. Springer-Verlag, pp. 75–90, doi:10.1007/BFb0037099.
  7. P. N. Benton (1995): A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models (Extended Abstract). In: Selected Papers from the 8th International Workshop on Computer Science Logic, CSL '94. Springer-Verlag, London, UK, UK, pp. 121–135, doi:10.1007/bfb0022251.
  8. Vincent Danos, Elham Kashefi, Prakash Panangaden & Simon Perdrix (2009): Extended Measurement Calculus. In: Semantic Techniques for Quantum Computation, chapter 5. Cambridge University Press, doi:10.1017/CBO9781139193313.008.
  9. Ellie d'Hondt & Prakash Panangaden (2006): Quantum Weakest Preconditions. Math Struct in Comp Science 16, pp. 429–451, doi:10.1017/S0960129506005251.
  10. A. Dvurečenskij & S. Pulmannov á (2000): New Trends in Quantum Structures. Kluwer Academic Publishers, Dordrecht, doi:10.1007/978-94-017-2422-7.
  11. Bart Jacobs (2010): Convexity, duality, and effects. In: C. S. Clade & V. Sassone: IFIP Theoretical Computer Science2010, IFIP Adv. in Inf. and Comm. Techn. 82 (1). Springer, Boston, pp. 1–19, doi:10.1007/978-3-642-15240-5_1.
  12. Bart Jacobs (2011): Probabilities, Distribution Monads, and Convex Categories. Theor. Comput. Sci. 412(28), pp. 3323–3336, doi:10.1016/j.tcs.2011.04.005.
  13. Bart Jacobs (2014): New Directions in Categorical Logic, for Classical, Probabilistic and Quantum Logic. To appear in Logical Methods in Computer Science. Available at http://arxiv.org/abs/1205.3940.
  14. Bart Jacobs & Jorik Mandemaker (2013): Relating Operator Spaces via Adjunctions. In: J. Chubb Reimann, V. Harizanov & A. Eskandarian: Logic and Algebraic Structures in Quantum Computing and Information, Lect. Notes in Logic. Camb.
  15. Anders Kock (1972): Strong functors and monoidal monads. Archiv der Mathematik 23(1), pp. 113–120, doi:10.1007/BF01304852.
  16. Peter Selinger (2004): Towards a Quantum Programming Language. Math Struct in Comp Science 14(4), pp. 527–586, doi:10.1017/S0960129504004256.
  17. P. Sellinger & B. Valiron (2010): Quantum Lambda Calculus. In: S. Gay & I Mackie: Semantical Techniques in Quantum Computation. Cambridge University Press, pp. 135–172, doi:10.1017/cbo9781139193313.005.
  18. Mingsheng Ying (2011): Floyd-Hoare logic for quantum programs. ACM Trans. Program. Lang. Syst. 33(6), pp. 19, doi:10.1145/2049706.2049708.

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