References

  1. Samson Abramsky (1994): Proofs As Processes. MFPS '92. Elsevier, pp. 5–9, doi:10.1016/0304-3975(94)00103-0.
  2. 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.
  3. Luís Caires & Frank Pfenning (2010): Session Types as Intuitionistic Linear Propositions. In: International Conference on Concurrency Theory, CONCUR '10, pp. 222–236, doi:10.1007/978-3-642-15375-4_16.
  4. Ornela Dardha, Elena Giachino & Davide Sangiorgi (2012): Session types revisited. In: PPDP, pp. 139–150, doi:10.1145/2370776.2370794.
  5. Matthias Felleisen (1991): On the Expressive Power of Programming Languages. Sci. Comput. Program. 17(1–3), pp. 35–75, doi:10.1016/0167-6423(91)90036-W.
  6. Simon J. Gay & Vasco T. Vasconcelos (2010): Linear type theory for asynchronous session types. Journal of Functional Programming 20(01), pp. 19–50, doi:10.1017/S0956796809990268.
  7. Jean-Yves Girard (1987): Linear logic. Theoretical Computer Science 50(1), pp. 1–101, doi:10.1016/0304-3975(87)90045-4.
  8. Philip Wadler (2012): Propositions As Sessions. In: Proceedings of the 17th ACM SIGPLAN International Conference on Functional Programming, ICFP '12. ACM, pp. 273–286, doi:10.1145/2364527.2364568.

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