References

  1. Samson Abramsky (1993): Computational Interpretations of Linear Logic. Theor. Comput. Sci. 111(1&2), pp. 3–57, doi:10.1016/0304-3975(93)90181-R.
  2. Samson Abramsky (1994): Proofs as Processes. Theor. Comput. Sci. 135(1), pp. 5–9, doi:10.1016/0304-3975(94)00103-0.
  3. Jean-Marc Andreoli (1992): Logic Programming with Focusing Proofs in Linear Logic. J. Log. Comput. 2(3), pp. 297–347, doi:10.1093/logcom/2.3.297.
  4. P. N. Benton, Gavin M. Bierman, Valeria de Paiva & Martin Hyland (1993): A Term Calculus for Intuitionistic Linear Logic. In: TLCA, Lecture Notes in Computer Science 664. Springer, pp. 75–90, doi:10.1007/BFb0037099.
  5. Michele Boreale (1998): On the Expressiveness of Internal Mobility in Name-Passing Calculi. Theor. Comput. Sci. 195(2), pp. 205–226, doi:10.1016/S0304-3975(97)00220-X.
  6. Luís Caires & Jorge A. Pérez (2017): Linearity, Control Effects, and Behavioral Types. In: ESOP, Lecture Notes in Computer Science 10201. Springer, pp. 229–259, doi:10.1007/978-3-662-54434-1_9.
  7. Luís Caires, Jorge A. Pérez, Frank Pfenning & Bernardo Toninho (2019): Domain-Aware Session Types. In: CONCUR, LIPIcs 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 39:1–39:17, doi:10.4230/LIPIcs.CONCUR.2019.39.
  8. Luís Caires & Frank Pfenning (2010): Session Types as Intuitionistic Linear Propositions. In: Paul Gastin & François Laroussinie: CONCUR 2010, LNCS 6269. Springer, pp. 222–236, doi:10.1007/978-3-642-15375-4_16.
  9. Luís Caires, Frank Pfenning & Bernardo Toninho (2016): Linear logic propositions as session types. Math. Struct. Comput. Sci. 26(3), pp. 367–423, doi:10.1017/S0960129514000218.
  10. Sara Capecchi, Ilaria Castellani & Mariangiola Dezani-Ciancaglini (2016): Information flow safety in multiparty sessions. Math. Struct. Comput. Sci. 26(8), pp. 1352–1394, doi:10.1017/S0960129514000619.
  11. Kaustuv Chaudhuri, Joëlle Despeyroux, Carlos Olarte & Elaine Pimentel (2019): Hybrid linear logic, revisited. Math. Struct. Comput. Sci. 29(8), pp. 1151–1176, doi:10.1017/S0960129518000439.
  12. Mario Coppo, Mariangiola Dezani-Ciancaglini, Luca Padovani & Nobuko Yoshida (2015): A Gentle Introduction to Multiparty Asynchronous Session Types. In: SFM, LNCS 9104. Springer, pp. 146–178, doi:10.1007/978-3-319-18941-3_4.
  13. Vincent Danos, Jean-Baptiste Joinet & Harold Schellinx (1993): The Structure of Exponentials: Uncovering the Dynamics of Linear Logic Proofs. In: Kurt Gödel Colloquium, Lecture Notes in Computer Science 713. Springer, pp. 159–171, doi:10.1007/BFb0022564.
  14. Rowan Davies & Frank Pfenning (2001): A modal analysis of staged computation. J. ACM 48(3), pp. 555–604, doi:10.1145/382780.382785.
  15. Joëlle Despeyroux & Kaustuv Chaudhuri (2013): A Hybrid Linear Logic for Constrained Transition Systems. In: TYPES, LIPIcs 26. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 150–168, doi:10.4230/LIPIcs.TYPES.2013.150.
  16. Henry DeYoung, Luís Caires, Frank Pfenning & Bernardo Toninho (2012): Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication. In: CSL, LIPIcs 16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 228–242, doi:10.4230/LIPIcs.CSL.2012.228.
  17. Mariangiola Dezani-Ciancaglini & Ugo de'Liguoro (2009): Sessions and Session Types: An Overview. In: WS-FM, Lecture Notes in Computer Science 6194. Springer, pp. 1–28, doi:10.1007/978-3-642-14458-5_1.
  18. Jean-Yves Girard (1987): Linear Logic. Theoretical Computer Science 50, pp. 1–102, doi:10.1016/0304-3975(87)90045-4.
  19. Timothy Griffin (1990): A Formulae-as-Types Notion of Control. In: POPL. ACM Press, pp. 47–58, doi:10.1145/96709.96714.
  20. Kohei Honda, Vasco Thudichum Vasconcelos & Makoto Kubo (1998): Language Primitives and Type Discipline for Structured Communication-Based Programming. In: ESOP, Lecture Notes in Computer Science 1381. Springer, pp. 122–138, doi:10.1007/BFb0053567.
  21. Hans Hüttel, Ivan Lanese, Vasco T. Vasconcelos, Luís Caires, Marco Carbone, Pierre-Malo Deniélou, Dimitris Mostrous, Luca Padovani, António Ravara, Emilio Tuosto, Hugo Torres Vieira & Gianluigi Zavattaro (2016): Foundations of Session Types and Behavioural Contracts. ACM Comput. Surv. 49(1), pp. 3:1–3:36, doi:10.1145/2873052.
  22. Delia Kesner & Pierre Vial (2020): Non-idempotent types for classical calculi in natural deduction style. Log. Methods Comput. Sci. 16(1), doi:10.23638/LMCS-16(1:3)2020.
  23. Björn Lellmann, Carlos Olarte & Elaine Pimentel (2017): A uniform framework for substructural logics with modalities. In: LPAR, EPiC Series in Computing 46. EasyChair, pp. 435–455, doi:10.29007/93qg.
  24. Dale Miller, Gopalan Nadathur & Andre Scedrov (1987): Hereditary Harrop Formulas and Uniform Proof Systems. In: LICS. IEEE Computer Society, pp. 98–105.
  25. Robin Milner, Joachim Parrow & David Walker (1992): A Calculus of Mobile Processes, I. Inf. Comput. 100(1), pp. 1–40, doi:10.1016/0890-5401(92)90008-4.
  26. Aleksandar Nanevski, Frank Pfenning & Brigitte Pientka (2008): Contextual modal type theory. ACM Trans. Comput. Log. 9(3), pp. 23:1–23:49, doi:10.1145/1352582.1352591.
  27. Daniele Nantes & Jorge A. Pérez (2018): Relating Process Languages for Security and Communication Correctness (Extended Abstract). In: FORTE, Lecture Notes in Computer Science 10854. Springer, pp. 79–100, doi:10.1007/978-3-319-92612-4_5.
  28. Vivek Nigam & Dale Miller (2009): Algorithmic specifications in linear logic with subexponentials. In: PPDP. ACM, pp. 129–140, doi:10.1145/1599410.1599427.
  29. Vivek Nigam, Carlos Olarte & Elaine Pimentel (2017): On subexponentials, focusing and modalities in concurrent systems. Theor. Comput. Sci. 693, pp. 35–58, doi:10.1016/j.tcs.2017.06.009.
  30. Carlos Olarte, Elaine Pimentel & Vivek Nigam (2015): Subexponential concurrent constraint programming. Theor. Comput. Sci. 606, pp. 98–120, doi:10.1016/j.tcs.2015.06.031.
  31. Michel Parigot (1992): Lambda-Mu-Calculus: An Algorithmic Interpretation of Classical Natural Deduction. In: LPAR, Lecture Notes in Computer Science 624. Springer, pp. 190–201, doi:10.1007/BFb0013061.
  32. Elaine Pimentel, Carlos Olarte & Vivek Nigam (2014): A Proof Theoretic Study of Soft Concurrent Constraint Programming. Theory Pract. Log. Program. 14(4-5), pp. 649–663, doi:10.1017/S147106841400026X.
  33. Davide Sangiorgi (1996): pi-Calculus, Internal Mobility, and Agent-Passing Calculi. Theor. Comput. Sci. 167(1&2), pp. 235–274, doi:10.1016/0304-3975(96)00075-8.
  34. Morten Heine B. SÃŗensen & Pawel Urzyczyn (2006): Lectures on the Curry-Howard Isomorphism. Studies in Logic and the Foundations of Mathematics 149. Elsevier Science.
  35. Kaku Takeuchi, Kohei Honda & Makoto Kubo (1994): An Interaction-based Language and its Typing System. In: PARLE, LNCS 817. Springer, pp. 398–413, doi:10.1007/3-540-58184-7_118.
  36. Bernardo Toninho, Luís Caires & Frank Pfenning (2012): Functions as Session-Typed Processes. In: Lars Birkedal: FOSSACS 2012, LNCS 7213. Springer, pp. 346–360, doi:10.1007/978-3-642-28729-9_23.
  37. Anne S. Troelstra (1992): Lectures on Linear Logic. CSLI Lecture Notes 29, Center for the Study of Language and Information, Stanford, California.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org