Sandra Alves, Maribel Fernández & Ian Mackie (2011):
A new graphical calculus of proofs.
In: Echahed: Proceedings of TERMGRAPH 2011.
EPTCS,
pp. 69–84.
Available at http://dx.doi.org/10.4204/EPTCS.48.8.
Oana Andrei, Maribel Fernández, Hélène Kirchner, Guy Melancon, Olivier Namet & Bruno Pinaud (2011):
PORGY: Strategy-Driven Interactive Transformation of Graphs.
In: Echahed: Proceedings of TERMGRAPH 2011.
EPTCS,
pp. 54–68.
Available at http://dx.doi.org/10.4204/EPTCS.48.7.
Oana Andrei & Hélène Kirchner (2008):
A Rewriting Calculus for Multigraphs with Ports.
Electr. Notes Theor. Comput. Sci. 219,
pp. 67–82.
Available at http://dx.doi.org/10.1016/j.entcs.2008.10.035.
Andrea Asperti, Cecilia Giovannetti & Andrea Naletto (1996):
The Bologna Optimal Higher-order Machine.
Journal of Functional Programming 6(6),
pp. 763–810.
Available at http://dx.doi.org/10.1017/S0956796800001994.
Horatiu Cirstea & Claude Kirchner (2001):
The rewriting calculus — Part I and II.
Logic Journal of the Interest Group in Pure and Applied Logics 9(3),
pp. 427–498.
Available at http://dx.doi.org/10.1093/jigpal/9.3.339.
Frank Drewes, Berthold Hoffmann & Detlef Plump (2000):
Hierarchical Graph Transformation.
In: Tiuryn: Proc. Foundations of Software Science and Computation Structures (FOSSACS 2000),
Lecture Notes in Computer Science 1784,
pp. 98–113.
Available at http://dx.doi.org/10.1007/3-540-46432-8_7.
M. Fernández & L. Khalil (2003):
Interaction nets with McCarthy's amb: Properties and Applications.
Nordic Journal of Computing 10(2),
pp. 134–162.
Available at http://dx.doi.org/10.1016/S1571-0661(05)80363-9.
M. Fernández & I. Mackie (1996):
From Term Rewriting to Generalised Interaction Nets.
In: Proceedings of PLILP'96. Programming Languages: Implementations, Logics, and Programs,
Lecture Notes in Computer Science 1140.
Springer-Verlag.
Available at http://dx.doi.org/10.1007/3-540-61756-6_94.
Maribel Fernández & Ian Mackie (1998):
Interaction Nets and Term Rewriting Systems.
Theoretical Computer Science 190(1),
pp. 3–39.
Available at http://dx.doi.org/10.1016/S0304-3975(97)00082-0.
Maribel Fernández, Ian Mackie & Francois Régis Sinot (2006):
Interaction Nets vs. theıt rho-calculus: Introducing Bigraphical Nets.
Electr. Notes Theor. Comput. Sci. 154(3),
pp. 19–32.
Available at http://dx.doi.org/10.1016/j.entcs.2006.05.004.
Fabien Fleutot (2004):
Encoding an Object Calculus into Interaction Nets.
In: M. Fernandez: Proc. of the 2nd Int. Workshop on Term Graph Rewriting (TERMGRAPH 2004),
ENTCS,
Rome.
Available at http://dx.doi.org/10.1016/j.entcs.2005.03.024.
Georges Gonthier, Martín Abadi & Jean-Jacques Lévy (1992):
The Geometry of Optimal Lambda Reduction.
In: Proceedings of the 19th ACM Symposium on Principles of Programming Languages (POPL'92).
ACM Press,
pp. 15–26.
Available at http://dx.doi.org/10.1145/143165.143172.
Abubakar Hassan, Ian Mackie & Jorge Sousa Pinto (2008):
Visual Programming with Interaction Nets.
In: Gem Stapleton, John Howse & John Lee: Diagrams,
Lecture Notes in Computer Science 5223.
Springer,
pp. 165–171.
Available at http://dx.doi.org/10.1007/978-3-540-87730-1_17.
O. Jensen & R. Milner (2004):
Bigraphs and mobile processes (revised).
Technical Report 580, Computer Laboratory, University of Cambridge.
Yves Lafont (1990):
Interaction Nets.
In: Proceedings of the 17th ACM Symposium on Principles of Programming Languages (POPL'90).
ACM Press,
pp. 95–108.
Available at http://dx.doi.org/10.1145/96709.96718.
Yves Lafont (1995):
From Proof Nets to Interaction Nets.
In: J.-Y. Girard, Y. Lafont & L. Regnier: Advances in Linear Logic,
London Mathematical Society Lecture Note Series 222.
Cambridge University Press,
pp. 225–247.
Available at http://dx.doi.org/10.1017/CBO9780511629150.012.
Ian Mackie (1994):
The Geometry of Implementation.
Department of Computing, Imperial College of Science, Technology and Medicine.
Ian Mackie (2004):
Efficient λ-evaluation with interaction nets.
In: V. van Oostrom: Proc. 15th Int. Conference on Rewriting Techniques and Applications (RTA'04),
Lecture Notes in Computer Science 3091.
Springer-Verlag,
pp. 155–169.
Available at http://dx.doi.org/10.1007/978-3-540-25979-4_11.
Ian Mackie (2010):
A Visual Model of Computation.
In: Jan Kratochvíl, Angsheng Li, JiríFiala & Petr Kolman: TAMC,
Lecture Notes in Computer Science 6108.
Springer,
pp. 350–360.
Available at http://dx.doi.org/10.1007/978-3-642-13562-0_32.
Robin Milner (2001):
Bigraphical Reactive Systems.
In: Kim Guldstrand Larsen & Mogens Nielsen: CONCUR,
Lecture Notes in Computer Science 2154.
Springer,
pp. 16–35.
Available at http://dx.doi.org/10.1007/3-540-44685-0_2.
Jorge Sousa Pinto (2000):
Sequential and Concurrent Abstract Machines for Interaction Nets.
In: J. Tiuryn: Proceedings of Foundations of Software Science and Computation Structures (FOSSACS),
Lecture Notes in Computer Science 1784.
Springer-Verlag,
pp. 267–282.
Available at http://dx.doi.org/10.1007/3-540-46432-8_18.