Stephanie Balzer & Frank Pfenning (2017):
Manifest Sharing with Session Types.
Proc. ACM Program. Lang. 1(ICFP),
pp. 37:1–37:29,
doi:10.1145/3110281.
Stephanie Balzer, Bernardo Toninho & Frank Pfenning (2019):
Manifest Deadlock-Freedom for Shared Session Types.
In: Luís Caires: Programming Languages and Systems,
Lecture Notes in Computer Science.
Springer International Publishing,
Cham,
pp. 611–639,
doi:10.1007/978-3-030-17184-1_22.
Michele Boreale (1998):
On the Expressiveness of Internal Mobility in Name-Passing Calculi.
Theoretical Computer Science 195(2),
pp. 205–226,
doi:10.1016/S0304-3975(97)00220-X.
Gérard Boudol (1992):
Asynchrony and the Pi-Calculus.
Research Report RR-1702.
INRIA.
Luís Caires (2014):
Types and Logic, Concurrency and Non-Determinism.
Technical Report MSR-TR-2014-104.
In Essays for the Luca Cardelli Fest,
Microsoft Research.
Luís Caires & Jorge A. Pérez (2017):
Linearity, Control Effects, and Behavioral Types.
In: Hongseok Yang: Programming Languages and Systems,
Lecture Notes in Computer Science.
Springer,
Berlin, Heidelberg,
pp. 229–259,
doi:10.1007/978-3-662-54434-1_9.
Luís Caires & Frank Pfenning (2010):
Session Types as Intuitionistic Linear Propositions.
In: Paul Gastin & François Laroussinie: CONCUR 2010 - Concurrency Theory,
Lecture Notes in Computer Science.
Springer,
Berlin, Heidelberg,
pp. 222–236,
doi:10.1007/978-3-642-15375-4_16.
Ornela Dardha & Simon J. Gay (2018):
A New Linear Logic for Deadlock-Free Session-Typed Processes.
In: Christel Baier & Ugo Dal Lago: Foundations of Software Science and Computation Structures,
Lecture Notes in Computer Science.
Springer International Publishing,
pp. 91–109,
doi:10.1007/978-3-319-89366-2_5.
Ornela Dardha & Jorge A. Pérez (2015):
Comparing Deadlock-Free Session Typed Processes.
Electronic Proceedings in Theoretical Computer Science 190,
pp. 1–15,
doi:10.4204/EPTCS.190.1.
Henry DeYoung, Luís Caires, Frank Pfenning & Bernardo Toninho (2012):
Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication.
In: Patrick Cégielski & Arnaud Durand: Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL,
Leibniz International Proceedings in Informatics (LIPIcs) 16.
Schloss DagstuhlLeibniz-Zentrum fuer Informatik,
Dagstuhl, Germany,
pp. 228–242,
doi:10.4230/LIPIcs.CSL.2012.228.
Simon J. Gay, Peter Thiemann & Vasco T. Vasconcelos (2020):
Duality of Session Types: The Final Cut.
Electronic Proceedings in Theoretical Computer Science 314,
pp. 23–33,
doi:10.4204/EPTCS.314.3.
Jean-Yves Girard (1987):
Linear Logic.
Theoretical Computer Science 50(1),
pp. 1–101,
doi:10.1016/0304-3975(87)90045-4.
Bas van den Heuvel & Jorge A. Pérez (2021):
A Decentralized Analysis of Multiparty Protocols.
arXiv:2101.09038 [cs].
Kohei Honda (1993):
Types for Dyadic Interaction.
In: Eike Best: CONCUR'93,
Lecture Notes in Computer Science.
Springer,
Berlin, Heidelberg,
pp. 509–523,
doi:10.1007/3-540-57208-2_35.
Kohei Honda & Mario Tokoro (1991):
An Object Calculus for Asynchronous Communication.
In: Pierre America: ECOOP'91 European Conference on Object-Oriented Programming,
Lecture Notes in Computer Science.
Springer,
Berlin, Heidelberg,
pp. 133–147,
doi:10.1007/BFb0057019.
Kohei Honda, Vasco T. Vasconcelos & Makoto Kubo (1998):
Language Primitives and Type Discipline for Structured Communication-Based Programming.
In: Chris Hankin: Programming Languages and Systems,
Lecture Notes in Computer Science.
Springer,
Berlin, Heidelberg,
pp. 122–138,
doi:10.1007/BFb0053567.
Naoki Kobayashi (2006):
A New Type System for Deadlock-Free Processes.
In: Christel Baier & Holger Hermanns: CONCUR 2006 Concurrency Theory,
Lecture Notes in Computer Science.
Springer Berlin Heidelberg,
pp. 233–247,
doi:10.1007/11817949_16.
Naoki Kobayashi & Cosimo Laneve (2017):
Deadlock Analysis of Unbounded Process Networks.
Information and Computation 252,
pp. 48–70,
doi:10.1016/j.ic.2016.03.004.
Robin Milner (1989):
Communication and Concurrency.
Prentice Hall International Series in Computer Science.
Prentice Hall,
New York, USA.
Robin Milner, Joachim Parrow & David Walker (1992):
A Calculus of Mobile Processes, I.
Information and Computation 100(1),
pp. 1–40,
doi:10.1016/0890-5401(92)90008-4.
Luca Padovani (2014):
Deadlock and Lock Freedom in the Linear π-Calculus.
In: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),
CSL-LICS '14.
ACM,
New York, NY, USA,
pp. 72:1–72:10,
doi:10.1145/2603088.2603116.
Benjamin C. Pierce (2002):
Types and Programming Languages.
MIT Press,
Cambridge, Massachusetts.
Klaas Pruiksma & Frank Pfenning (2019):
A Message-Passing Interpretation of Adjoint Logic.
In: Programming Language Approaches to Concurrency- and Communication-cEntric Software (PLACES),
Electronic Proceedings in Theoretical Computer Science 291.
Open Publishing Association,
pp. 60–79,
doi:10.4204/EPTCS.291.6.
Klaas Pruiksma & Frank Pfenning (2021):
A Message-Passing Interpretation of Adjoint Logic.
Journal of Logical and Algebraic Methods in Programming 120(100637),
doi:10.1016/j.jlamp.2020.100637.
Bernardo Toninho, Luis Caires & Frank Pfenning (2014):
Corecursion and Non-Divergence in Session-Typed Processes.
In: Matteo Maffei & Emilio Tuosto: Trustworthy Global Computing,
Lecture Notes in Computer Science.
Springer,
Berlin, Heidelberg,
pp. 159–175,
doi:10.1007/978-3-662-45917-1_11.
Bernardo Toninho & Nobuko Yoshida (2018):
Interconnectability of Session-Based Logical Processes.
ACM Transactions on Programming Languages and Systems (TOPLAS) 40(4),
pp. 17,
doi:10.1145/3242173.
Vasco T. Vasconcelos (2012):
Fundamentals of Session Types.
Information and Computation 217,
pp. 52–70,
doi:10.1016/j.ic.2012.05.002.
Philip Wadler (2012):
Propositions As Sessions.
In: Proceedings of the 17th ACM SIGPLAN International Conference on Functional Programming,
ICFP '12.
ACM,
New York, NY, USA,
pp. 273–286,
doi:10.1145/2364527.2364568.
eptcs@eptcs.org