References

  1. Richard Blute & Prakash Panangaden: Proof Nets as Formal Feynman Diagrams. Submitted..
  2. Ugo Dal Lago, Andrea Masini & Margherita Zorzi (2009): On a measurement-free quantum lambda calculus with classical control. Mathematical Structures in Computer Science 19(2), pp. 297–335, doi:10.1017/S096012950800741X.
  3. Vincent Danos & Laurent Regnier (1995): Proof nets and the Hilbert space. In: J.-Y. Girard, Y. Lafont & L. Regnier: Advances in Linear Logic. Cambridge University Press, pp. 307–328.
  4. Ross Duncan (2009): Generalised Proof-Nets for Compact Categories with Biproducts. In: S. Gay & I. Mackie: Semantics of Quantum Computation. Cambridge University Press, pp. 70–134.
  5. Jean-Yves Girard (1987): Linear Logic. Theoretical Computer Science 50(1), pp. 1–102, doi:10.1016/0304-3975(87)90045-4.
  6. Jean-Yves Girard (1987): Multiplicatives. In: Rendiconti del Seminario Matematico dell'Università e Policlinico di Torino. Special issue on Logic and Computer Science, pp. 11–33.
  7. Jean-Yves Girard (1989): Geometry of Interaction I: Interpretation of System F. In: Proceedings of the Logic Colloquium '88. North Holland, pp. 221–260.
  8. Jean-Yves Girard (2004): Between logic and quantic: a tract. In: P. Ruet T. Ehrhard, J.-Y. Girard & P. Scott: Linear Logic in Computer Science. Cambridge University Press, pp. 346–281.
  9. Jean-Yves Girard (2011): The Blind Spot: Lectures on Logic. European Mathematical Society.
  10. Georges Gonthier, Mart\'ın Abadi & Jean-Jacques Lévy (1992): The Geometry of Optimal Lambda Reduction. In: 19th Symposium on Principles of Programming Languages (POPL), Proceedings.. ACM Press, pp. 15–26, doi:10.1145/143165.143172.
  11. Ichiro Hasuo & Naohiko Hoshino (2011): Semantics of Higher-Order Quantum Computation via Geometry of Interaction. In: 26th Symposium on Logic in Computer Science (LICS), Proceedings. IEEE, pp. 237–246, doi:10.1109/LICS.2011.26.
  12. Peter Selinger & Beno^ıt Valiron (2006): A lambda calculus for quantum computation with classical control. Mathematical Structures in Computer Science 16(3), pp. 527–552, doi:10.1017/S0960129506005238.
  13. Peter Selinger & Beno^ıt Valiron (2008): On a Fully Abstract Model for a Quantum Linear Functional Language: (Extended Abstract). Electronic Notes in Theoretical Computer Science 210, pp. 123–137, doi:10.1016/j.entcs.2008.04.022.
  14. André van Tonder (2004): A Lambda Calculus for Quantum Computation. SIAM J. Comput. 33(5), pp. 1109–1135, doi:10.1137/S0097539703432165.

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