<bibliography>
 <citation type="inproceedings" key="AlvesS:gracp">
  <author>Sandra <surname>Alves</surname></author>
  <author>Maribel <surname>Fern&#225;ndez</surname></author>
  <author>Ian <surname>Mackie</surname></author>
  <year>2011</year>
  <title>A new graphical calculus of proofs</title>
  <editor><surname>Echahed</surname></editor>
  <booktitle>Proceedings of TERMGRAPH 2011</booktitle>
  <publisher>EPTCS</publisher>
  <pages>69&#8211;84</pages>
  <url>http://dx.doi.org/10.4204/EPTCS.48.8</url>
 </citation>
 <citation type="inproceedings" key="AndreiO:PORGY">
  <author>Oana <surname>Andrei</surname></author>
  <author>Maribel <surname>Fern&#225;ndez</surname></author>
  <author>H&#233;l&#232;ne <surname>Kirchner</surname></author>
  <author>Guy Melan<surname>con</surname></author>
  <author>Olivier <surname>Namet</surname></author>
  <author>Bruno <surname>Pinaud</surname></author>
  <year>2011</year>
  <title>PORGY: Strategy-Driven Interactive Transformation of Graphs</title>
  <editor><surname>Echahed</surname></editor>
  <booktitle>Proceedings of TERMGRAPH 2011</booktitle>
  <publisher>EPTCS</publisher>
  <pages>54&#8211;68</pages>
  <url>http://dx.doi.org/10.4204/EPTCS.48.7</url>
 </citation>
 <citation type="article" key="AndreiK08">
  <author>Oana <surname>Andrei</surname></author>
  <author>H&#233;l&#232;ne <surname>Kirchner</surname></author>
  <year>2008</year>
  <title>A Rewriting Calculus for Multigraphs with Ports</title>
  <journal>Electr. Notes Theor. Comput. Sci.</journal>
  <volume>219</volume>
  <pages>67&#8211;82</pages>
  <url>http://dx.doi.org/10.1016/j.entcs.2008.10.035</url>
 </citation>
 <citation type="article" key="AspertiA:bolhom">
  <author>Andrea <surname>Asperti</surname></author>
  <author>Cecilia <surname>Giovannetti</surname></author>
  <author>Andrea <surname>Naletto</surname></author>
  <year>1996</year>
  <title>The Bologna Optimal Higher-order Machine</title>
  <journal>Journal of Functional Programming</journal>
  <volume>6</volume>
  <number>6</number>
  <pages>763&#8211;810</pages>
  <url>http://dx.doi.org/10.1017/S0956796800001994</url>
 </citation>
 <citation type="article" key="rhoCalIGLP-I+II-2001">
  <author>Horatiu <surname>Cirstea</surname></author>
  <author>Claude <surname>Kirchner</surname></author>
  <year>2001</year>
  <title>The rewriting calculus &#8212; Part I and II</title>
  <journal>Logic Journal of the Interest Group in Pure and Applied Logics</journal>
  <volume>9</volume>
  <number>3</number>
  <pages>427&#8211;498</pages>
  <url>http://dx.doi.org/10.1093/jigpal/9.3.339</url>
 </citation>
 <citation type="inproceedings" key="Drewes-Hoffmann-Plump:00">
  <author>Frank <surname>Drewes</surname></author>
  <author>Berthold <surname>Hoffmann</surname></author>
  <author>Detlef <surname>Plump</surname></author>
  <year>2000</year>
  <title>Hierarchical Graph Transformation</title>
  <editor><surname>Tiuryn</surname></editor>
  <booktitle>Proc. Foundations of Software Science and Computation Structures (FOSSACS 2000)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>1784</volume>
  <pages>98&#8211;113</pages>
  <url>http://dx.doi.org/10.1007/3-540-46432-8_7</url>
 </citation>
 <citation type="article" key="FernandezM:inMCpa">
  <author>M. <surname>Fern&#225;ndez</surname></author>
  <author>L. <surname>Khalil</surname></author>
  <year>2003</year>
  <title>Interaction nets with McCarthy's amb: Properties and Applications</title>
  <journal>Nordic Journal of Computing</journal>
  <volume>10</volume>
  <number>2</number>
  <pages>134&#8211;162</pages>
  <url>http://dx.doi.org/10.1016/S1571-0661(05)80363-9</url>
 </citation>
 <citation type="inproceedings" key="FernandezM:terrgi">
  <author>M. <surname>Fern&#225;ndez</surname></author>
  <author>I. <surname>Mackie</surname></author>
  <year>1996</year>
  <title>From Term Rewriting to Generalised Interaction Nets</title>
  <booktitle>Proceedings of PLILP'96. Programming Languages: Implementations, Logics, and Programs</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>1140</volume>
  <publisher>Springer-Verlag</publisher>
  <url>http://dx.doi.org/10.1007/3-540-61756-6_94</url>
 </citation>
 <citation type="article" key="MackieIC:intntr">
  <author>Maribel <surname>Fern&#225;ndez</surname></author>
  <author>Ian <surname>Mackie</surname></author>
  <year>1998</year>
  <title>Interaction Nets and Term Rewriting Systems</title>
  <journal>Theoretical Computer Science</journal>
  <volume>190</volume>
  <number>1</number>
  <pages>3&#8211;39</pages>
  <url>http://dx.doi.org/10.1016/S0304-3975(97)00082-0</url>
 </citation>
 <citation type="article" key="EXPRESS">
  <author>Maribel <surname>Fern&#225;ndez</surname></author>
  <author>Ian <surname>Mackie</surname></author>
  <author>Fran<surname>cois R&#233;gis Sinot</surname></author>
  <year>2006</year>
  <title>Interaction Nets vs. the&#x0131;t rho-calculus: Introducing Bigraphical Nets</title>
  <journal>Electr. Notes Theor. Comput. Sci.</journal>
  <volume>154</volume>
  <number>3</number>
  <pages>19&#8211;32</pages>
  <url>http://dx.doi.org/10.1016/j.entcs.2006.05.004</url>
 </citation>
 <citation type="inproceedings" key="FleutotF:encoci">
  <author>Fabien <surname>Fleutot</surname></author>
  <year>2004</year>
  <title>Encoding an Object Calculus into Interaction Nets</title>
  <editor>M. <surname>Fernandez</surname></editor>
  <booktitle>Proc. of the 2nd Int. Workshop on Term Graph Rewriting (TERMGRAPH 2004)</booktitle>
  <series>ENTCS</series>
  <address>Rome</address>
  <url>http://dx.doi.org/10.1016/j.entcs.2005.03.024</url>
 </citation>
 <citation type="inproceedings" key="GonthierG:geoolr">
  <author>Georges <surname>Gonthier</surname></author>
  <author>Mart&#237;n <surname>Abadi</surname></author>
  <author>Jean-Jacques <surname>L&#233;vy</surname></author>
  <year>1992</year>
  <title>The Geometry of Optimal Lambda Reduction</title>
  <booktitle>Proceedings of the 19th ACM Symposium on Principles of Programming Languages (POPL'92)</booktitle>
  <publisher>ACM Press</publisher>
  <pages>15&#8211;26</pages>
  <url>http://dx.doi.org/10.1145/143165.143172</url>
 </citation>
 <citation type="inproceedings" key="MackieIC:diagrams">
  <author>Abubakar <surname>Hassan</surname></author>
  <author>Ian <surname>Mackie</surname></author>
  <author>Jorge Sousa <surname>Pinto</surname></author>
  <year>2008</year>
  <title>Visual Programming with Interaction Nets</title>
  <editor>Gem <surname>Stapleton</surname></editor>
  <editor>John <surname>Howse</surname></editor>
  <editor>John <surname>Lee</surname></editor>
  <booktitle>Diagrams</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>5223</volume>
  <publisher>Springer</publisher>
  <pages>165&#8211;171</pages>
  <url>http://dx.doi.org/10.1007/978-3-540-87730-1_17</url>
 </citation>
 <citation type="misc" key="jensen03bigraphs">
  <author>O. <surname>Jensen</surname></author>
  <author>R. <surname>Milner</surname></author>
  <year>2004</year>
  <title>Bigraphs and mobile processes (revised)</title>
  <howpublished>Technical Report 580, Computer Laboratory, University of Cambridge</howpublished>
 </citation>
 <citation type="inproceedings" key="LafontY:intn">
  <author>Yves <surname>Lafont</surname></author>
  <year>1990</year>
  <title>Interaction Nets</title>
  <booktitle>Proceedings of the 17th ACM Symposium on Principles of Programming Languages (POPL'90)</booktitle>
  <publisher>ACM Press</publisher>
  <pages>95&#8211;108</pages>
  <url>http://dx.doi.org/10.1145/96709.96718</url>
 </citation>
 <citation type="incollection" key="LafontY:fropni">
  <author>Yves <surname>Lafont</surname></author>
  <year>1995</year>
  <title>From Proof Nets to Interaction Nets</title>
  <editor>J.-Y. <surname>Girard</surname></editor>
  <editor>Y. <surname>Lafont</surname></editor>
  <editor>L. <surname>Regnier</surname></editor>
  <booktitle>Advances in Linear Logic</booktitle>
  <series>London Mathematical Society Lecture Note Series</series>
  <volume>222</volume>
  <publisher>Cambridge University Press</publisher>
  <pages>225&#8211;247</pages>
  <url>http://dx.doi.org/10.1017/CBO9780511629150.012</url>
 </citation>
 <citation type="phdthesis" key="MackieIC:phd">
  <author>Ian <surname>Mackie</surname></author>
  <year>1994</year>
  <title>The Geometry of Implementation</title>
  <school>Department of Computing, Imperial College of Science, Technology and Medicine</school>
 </citation>
 <citation type="inproceedings" key="MackieIC:efflei">
  <author>Ian <surname>Mackie</surname></author>
  <year>2004</year>
  <title>Efficient &#955;-evaluation with interaction nets</title>
  <editor>V. <surname>van Oostrom</surname></editor>
  <booktitle>Proc. 15th Int. Conference on Rewriting Techniques and Applications (RTA'04)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>3091</volume>
  <publisher>Springer-Verlag</publisher>
  <pages>155&#8211;169</pages>
  <url>http://dx.doi.org/10.1007/978-3-540-25979-4_11</url>
 </citation>
 <citation type="inproceedings" key="MackieIC:vcc">
  <author>Ian <surname>Mackie</surname></author>
  <year>2009</year>
  <title>A rewriting paradigm for program and algorithm animation</title>
  <booktitle>VL/HCC</booktitle>
  <publisher>IEEE</publisher>
  <pages>170&#8211;173</pages>
  <url>http://doi.ieeecomputersociety.org/10.1109/VLHCC.2009.5295272</url>
 </citation>
 <citation type="inproceedings" key="MackieIC:tamc">
  <author>Ian <surname>Mackie</surname></author>
  <year>2010</year>
  <title>A Visual Model of Computation</title>
  <editor>Jan <surname>Kratochv&#237;l</surname></editor>
  <editor>Angsheng <surname>Li</surname></editor>
  <editor>Jir&#237;<surname>Fiala</surname></editor>
  <editor>Petr <surname>Kolman</surname></editor>
  <booktitle>TAMC</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>6108</volume>
  <publisher>Springer</publisher>
  <pages>350&#8211;360</pages>
  <url>http://dx.doi.org/10.1007/978-3-642-13562-0_32</url>
 </citation>
 <citation type="inproceedings" key="Milner">
  <author>Robin <surname>Milner</surname></author>
  <year>2001</year>
  <title>Bigraphical Reactive Systems</title>
  <editor>Kim Guldstrand <surname>Larsen</surname></editor>
  <editor>Mogens <surname>Nielsen</surname></editor>
  <booktitle>CONCUR</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>2154</volume>
  <publisher>Springer</publisher>
  <pages>16&#8211;35</pages>
  <url>http://dx.doi.org/10.1007/3-540-44685-0_2</url>
 </citation>
 <citation type="inproceedings" key="PintoJS:seqcam">
  <author>Jorge Sousa <surname>Pinto</surname></author>
  <year>2000</year>
  <title>Sequential and Concurrent Abstract Machines for Interaction Nets</title>
  <editor>J. <surname>Tiuryn</surname></editor>
  <booktitle>Proceedings of Foundations of Software Science and Computation Structures (FOSSACS)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>1784</volume>
  <publisher>Springer-Verlag</publisher>
  <pages>267&#8211;282</pages>
  <url>http://dx.doi.org/10.1007/3-540-46432-8_18</url>
 </citation>
</bibliography>
