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