<bibliography>
 <citation type="misc" key="Blute_proofnets">
  <author>Richard Blute</author>
  <author>Prakash Panangaden</author>
  <title>Proof Nets as Formal Feynman Diagrams</title>
  <note>Submitted.</note>
 </citation>
 <citation type="article" key="DLMZ">
  <author>Ugo Dal Lago</author>
  <author>Andrea Masini</author>
  <author>Margherita Zorzi</author>
  <year>2009</year>
  <title>On a measurement-free quantum lambda calculus with classical control</title>
  <journal>Mathematical Structures in Computer Science</journal>
  <volume>19</volume>
  <number>2</number>
  <pages>297&#8211;335</pages>
  <doi>10.1017/S096012950800741X</doi>
 </citation>
 <citation type="incollection" key="DanosRegnier:PNHil">
  <author>Vincent Danos</author>
  <author>Laurent Regnier</author>
  <year>1995</year>
  <title>Proof nets and the Hilbert space</title>
  <editor>J.-Y. Girard</editor>
  <editor>Y. Lafont</editor>
  <editor>L. Regnier</editor>
  <booktitle>Advances in Linear Logic</booktitle>
  <publisher>Cambridge University Press</publisher>
  <pages>307&#8211;328</pages>
 </citation>
 <citation type="incollection" key="Duncan">
  <author>Ross Duncan</author>
  <year>2009</year>
  <title>Generalised Proof-Nets for Compact Categories with Biproducts</title>
  <editor>S. Gay</editor>
  <editor>I. Mackie</editor>
  <booktitle>Semantics of Quantum Computation</booktitle>
  <publisher>Cambridge University Press</publisher>
  <pages>70&#8211;134</pages>
 </citation>
 <citation type="article" key="Girard:LL">
  <author>Jean-Yves Girard</author>
  <year>1987</year>
  <title>Linear Logic</title>
  <journal>Theoretical Computer Science</journal>
  <volume>50</volume>
  <number>1</number>
  <pages>1&#8211;102</pages>
  <doi>10.1016/0304-3975(87)90045-4</doi>
 </citation>
 <citation type="inproceedings" key="Girard87a">
  <author>Jean-Yves Girard</author>
  <year>1987</year>
  <title>Multiplicatives</title>
  <booktitle>Rendiconti del Seminario Matematico dell'Universit&#224; e Policlinico di Torino. Special issue on Logic and Computer Science</booktitle>
  <pages>11&#8211;33</pages>
 </citation>
 <citation type="inproceedings" key="Girard88">
  <author>Jean-Yves Girard</author>
  <year>1989</year>
  <title>Geometry of Interaction I: Interpretation of System F</title>
  <booktitle>Proceedings of the Logic Colloquium '88</booktitle>
  <publisher>North Holland</publisher>
  <pages>221&#8211;260</pages>
 </citation>
 <citation type="incollection" key="Girard:QCS">
  <author>Jean-Yves Girard</author>
  <year>2004</year>
  <title>Between logic and quantic: a tract</title>
  <editor>P. Ruet T. Ehrhard, J.-Y. Girard</editor>
  <editor>P. Scott</editor>
  <booktitle>Linear Logic in Computer Science</booktitle>
  <publisher>Cambridge University Press</publisher>
  <pages>346&#8211;281</pages>
 </citation>
 <citation type="book" key="GirardPA">
  <author>Jean-Yves Girard</author>
  <year>2011</year>
  <title>The Blind Spot: Lectures on Logic</title>
  <publisher>European Mathematical Society</publisher>
 </citation>
 <citation type="inproceedings" key="GonthierAbadiLevy">
  <author>Georges Gonthier</author>
  <author>Mart\'&#305;n Abadi</author>
  <author>Jean-Jacques L&#233;vy</author>
  <year>1992</year>
  <title>The Geometry of Optimal Lambda Reduction</title>
  <booktitle>19th Symposium on Principles of Programming Languages (POPL), Proceedings.</booktitle>
  <publisher>ACM Press</publisher>
  <pages>15&#8211;26</pages>
  <doi>10.1145/143165.143172</doi>
 </citation>
 <citation type="inproceedings" key="Hasuo11">
  <author>Ichiro Hasuo</author>
  <author>Naohiko Hoshino</author>
  <year>2011</year>
  <title>Semantics of Higher-Order Quantum Computation via Geometry of Interaction</title>
  <booktitle>26th Symposium on Logic in Computer Science (LICS), Proceedings</booktitle>
  <publisher>IEEE</publisher>
  <pages>237&#8211;246</pages>
  <doi>10.1109/LICS.2011.26</doi>
 </citation>
 <citation type="article" key="SelingerV06">
  <author>Peter Selinger</author>
  <author>Beno&#94;&#305;t Valiron</author>
  <year>2006</year>
  <title>A lambda calculus for quantum computation with classical control</title>
  <journal>Mathematical Structures in Computer Science</journal>
  <volume>16</volume>
  <number>3</number>
  <pages>527&#8211;552</pages>
  <doi>10.1017/S0960129506005238</doi>
 </citation>
 <citation type="article" key="SelingerV08">
  <author>Peter Selinger</author>
  <author>Beno&#94;&#305;t Valiron</author>
  <year>2008</year>
  <title>On a Fully Abstract Model for a Quantum Linear Functional Language: (Extended Abstract)</title>
  <journal>Electronic Notes in Theoretical Computer Science</journal>
  <volume>210</volume>
  <pages>123&#8211;137</pages>
  <doi>10.1016/j.entcs.2008.04.022</doi>
 </citation>
 <citation type="article" key="VanTonder">
  <author>Andr&#233; van Tonder</author>
  <year>2004</year>
  <title>A Lambda Calculus for Quantum Computation</title>
  <journal>SIAM J. Comput.</journal>
  <volume>33</volume>
  <number>5</number>
  <pages>1109&#8211;1135</pages>
  <doi>10.1137/S0097539703432165</doi>
 </citation>
</bibliography>
