References

  1. Samson Abramsky (1994): Proofs as processes. Theoretical Computer Science 135(1), pp. 5–9, doi:10.1016/0304-3975(94)00103-0. Available at http://www.sciencedirect.com/science/article/pii/0304397594001030.
  2. Steffen van Bakel, Luca Cardelli & Maria Grazia Vigliotti (2014): Classical cut-elimination in the π-calculus.
  3. Emmanuel Beffara (2006): A concurrent model for linear logic. In: 21st International Conference on Mathematical Foundations of Programming Semantics (MFPS), Electronic Notes in Theoretical Computer Science 155, pp. 147–168, doi:10.1016/j.entcs.2005.11.055.
  4. Emmanuel Beffara & François Maurel (2006): Concurrent nets: A study of prefixing in process calculi. Theoretical Computer Science 356(3), pp. 356–373, doi:10.1016/j.tcs.2006.02.009. Available at http://www.sciencedirect.com/science/article/pii/S0304397506001460.
  5. Emmanuel Beffara & Virgile Mogbil (2012): Proofs as executions. In: Jos C. M. Baeten, Tom Ball & Frank S. de Boer: Proceedings of IFIP TCS, Lecture Notes in Computer Science 7604. Springer, pp. 280–294, doi:10.1007/978-3-642-33475-7_20. Available at http://hal.archives-ouvertes.fr/hal-00586459/.
  6. Gianluigi Bellin & Philip J. Scott (1994): On the π-calculus and linear logic. Theoretical Computer Science 135(1), pp. 11–65, doi:10.1016/0304-3975(94)00104-9. Available at http://www.sciencedirect.com/science/article/pii/0304397594001049.
  7. Paola Bruscoli (2002): A purely logical account of sequentiality in proof search. In: Peter J. Stuckey: International Conference on Logic Programming (ICLP), Lecture Notes in Computer Science 2401. Springer, pp. 302–316, doi:10.1007/3-540-45619-8_21. Available at http://link.springer.com/chapter/10.1007/3-540-45619-8_21.
  8. Luís Caires & Frank Pfenning (2010): Session types as intuitionistic linear propositions. In: Paul Gastin & François Laroussinie: Proceedings of the 21st International Conference on Concurrency Theory, Lecture Notes in Computer Science 6269. Springer Berlin Heidelberg, Paris, France, pp. 222–236, doi:10.1007/978-3-642-15375-4_16. Available at http://link.springer.com/chapter/10.1007/978-3-642-15375-4_16.
  9. Vincent Danos, Jean-Baptiste Joinet & Harold Schellinx (1997): A new deconstructive logic: linear logic. The Journal of Symbolic Logic 62(3), pp. 755–807, doi:10.2307/2275572. Available at http://www.jstor.org/stable/2275572.
  10. Vincent Danos & Laurent Regnier (1989): The structure of multiplicatives. Archive for Mathematical Logic 28(3), pp. 181–203, doi:10.1007/BF01622878. Available at http://link.springer.com/article/10.1007/BF01622878.
  11. Thomas Ehrhard & Olivier Laurent (2010): Interpreting a finitary π-calculus in differential interaction nets. Information and Computation 208(6), pp. 606–633, doi:10.1016/j.ic.2009.06.005. Available at http://www.sciencedirect.com/science/article/pii/S0890540110000155.
  12. Thomas Ehrhard & Laurent Regnier (2006): Differential interaction nets. Theoretical Computer Science 364(2), pp. 166–195, doi:10.1016/j.tcs.2006.08.003. Available at http://www.sciencedirect.com/science/article/pii/S0304397506005299.
  13. Jean-Yves Girard (1987): Linear logic. Theoretical Computer Science 50(1), pp. 1–101, doi:10.1016/0304-3975(87)90045-4. Available at http://www.sciencedirect.com/science/article/pii/0304397587900454.
  14. Jean-Yves Girard (1996): Proof-nets: the parallel syntax for proof-theory. In: Paolo Aglianò & Aldo Ursini: Logic and Algebra, Lecture Notes in Pure and Applied Mathematics 180. Marcel Dekker, New York, pp. 97–124.
  15. Matthew Hennessy & Robin Milner (1985): Algebraic laws for nondeterminism and concurrency. Journal of the ACM 32(1), pp. 137–161, doi:10.1145/2455.2460.
  16. Kohei Honda & Olivier Laurent (2010): An exact correspondence between a typed π-calculus and polarised proof-nets. Theoretical Computer Science 411(2224), pp. 2223–2238, doi:10.1016/j.tcs.2010.01.028. Available at http://www.sciencedirect.com/science/article/pii/S0304397510000538.
  17. Cosimo Laneve & Björn Victor (2003): Solos in concert. Mathematical Structures in Computer Science 13(5), pp. 657–683, doi:10.1017/S0960129503004055.
  18. François Maurel (2003): Nondeterministic light logics and NP time. In: Martin Hofmann: Typed Lambda Calculi and Applications, Lecture Notes in Computer Science 2701. Springer, pp. 241–255, doi:10.1007/3-540-44904-3_17. Available at http://link.springer.com/chapter/10.1007/3-540-44904-3_17.
  19. Dale Miller (1992): The π-calculus as a theory in linear logic: Preliminary results. In: Evelina Lamma & Paola Mello: Extensions of Logic Programming, Third International Workshop (WELP'92), Lecture Notes in Computer Science 660. Springer, pp. 242–264, doi:10.1007/3-540-56454-3_13. Available at http://link.springer.com/chapter/10.1007/3-540-56454-3_13.
  20. Dale Miller & Alwen Tiu (2005): A proof theory for generic judgments. ACM Transactions on Computational Logic (TOCL) 6(4), pp. 749783, doi:10.1145/1094622.1094628.
  21. Robin Milner (1989): Communication and concurrency. Prentice-Hall, Inc., Upper Saddle River, NJ, USA.
  22. Virgile Mogbil (2010): Non-deterministic boolean proof nets. In: Marko van Eekelen & Olha Shkaravska: Foundational and Practical Aspects of Resource Analysis, Lecture Notes in Computer Science. Springer, pp. 131–145, doi:10.1007/978-3-642-15331-0_9. Available at http://link.springer.com/chapter/10.1007/978-3-642-15331-0_9.
  23. Kazushige Terui (2004): Proof nets and boolean circuits. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, LICS '04. IEEE Computer Society, Washington, DC, USA, pp. 182191, doi:10.1109/LICS.2004.34.
  24. Alwen Tiu & Dale Miller (2005): A proof search specification of the π-calculus. Electronic Notes in Theoretical Computer Science 138(1), pp. 79–101, doi:10.1016/j.entcs.2005.05.006. Available at http://www.sciencedirect.com/science/article/pii/S1571066105051121.
  25. Glynn Winskel (1987): Event structures. In: W. Brauer, W. Reisig & G. Rozenberg: Petri Nets: Applications and Relationships to Other Models of Concurrency, Lecture Notes in Computer Science 255. Springer Berlin Heidelberg, pp. 325–392, doi:10.1007/3-540-17906-2_31. Available at http://link.springer.com/chapter/10.1007/3-540-17906-2_31.
  26. Nobuko Yoshida, Martin Berger & Kohei Honda (2001): Strong normalisation in the π-calculus. In: 16th Annual IEEE Symposium on Logic in Computer Science, 2001., pp. 311–322, doi:10.1109/LICS.2001.932507.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org