{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:12:48Z","timestamp":1762459968762,"version":"3.41.0"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030780883"},{"type":"electronic","value":"9783030780890"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-78089-0_6","type":"book-chapter","created":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T14:26:35Z","timestamp":1623248795000},"page":"100-119","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Prioritise the Best Variation"],"prefix":"10.1007","author":[{"given":"Wen","family":"Kokke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ornela","family":"Dardha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,8]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(94)00103-0","volume":"135","author":"S Abramsky","year":"1994","unstructured":"Abramsky, S.: Proofs as processes. Theor. Comput. Sci. 135(1), 5\u20139 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)00103-0","journal-title":"Theor. Comput. Sci."},{"issue":"ICFP","key":"6_CR2","doi-asserted-by":"publisher","first-page":"37:1","DOI":"10.1145\/3110281","volume":"1","author":"S Balzer","year":"2017","unstructured":"Balzer, S., Pfenning, F.: Manifest sharing with session types. Proc. ACM Program. Lang. 1(ICFP), 37:1\u201337:29 (2017). https:\/\/doi.org\/10.1145\/3110281","journal-title":"Proc. ACM Program. Lang."},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-030-17184-1_22","volume-title":"Programming Languages and Systems","author":"S Balzer","year":"2019","unstructured":"Balzer, S., Toninho, B., Pfenning, F.: Manifest deadlock-freedom for shared session types. In: Caires, L. (ed.) ESOP 2019. LNCS, vol. 11423, pp. 611\u2013639. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17184-1_22"},{"key":"6_CR4","unstructured":"Barber, A.: Dual intuitionistic linear logic (1996). https:\/\/www.lfcs.inf.ed.ac.uk\/reports\/96\/ECS-LFCS-96-347\/ECS-LFCS-96-347.pdf"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0304-3975(94)00104-9","volume":"135","author":"G Bellin","year":"1994","unstructured":"Bellin, G., Scott, P.J.: On the $$\\pi $$-calculus and linear logic. Theor. Comput. Sci. 135(1), 11\u201365 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)00104-9","journal-title":"Theor. Comput. Sci."},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Bernardy, J.P., Boespflug, M., Newton, R.R., Jones, S.P., Spiwack, A.: Linear Haskell: practical linearity in a higher-order polymorphic language. In: Proceedings of POPL, vol. 2, pp. 1\u201329 (2018). https:\/\/doi.org\/10.1145\/3158093","DOI":"10.1145\/3158093"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-540-85361-9_33","volume-title":"CONCUR 2008 - Concurrency Theory","author":"L Bettini","year":"2008","unstructured":"Bettini, L., Coppo, M., D\u2019Antoni, L., De Luca, M., Dezani-Ciancaglini, M., Yoshida, N.: Global progress in dynamically interleaved multiparty sessions. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 418\u2013433. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85361-9_33"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-319-39570-8_6","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"L Caires","year":"2016","unstructured":"Caires, L., P\u00e9rez, J.A.: Multiparty session types within a canonical binary theory, and beyond. In: Albert, E., Lanese, I. (eds.) FORTE 2016. LNCS, vol. 9688, pp. 74\u201395. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39570-8_6"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-15375-4_16","volume-title":"CONCUR 2010 - Concurrency Theory","author":"L Caires","year":"2010","unstructured":"Caires, L., Pfenning, F.: Session types as intuitionistic linear propositions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 222\u2013236. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15375-4_16"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-662-43376-8_4","volume-title":"Coordination Models and Languages","author":"M Carbone","year":"2014","unstructured":"Carbone, M., Dardha, O., Montesi, F.: Progress as compositional lock-freedom. In: K\u00fchn, E., Pugliese, R. (eds.) COORDINATION 2014. LNCS, vol. 8459, pp. 49\u201364. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43376-8_4"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Carbone, M., Debois, S.: A graphical approach to progress for structured communication in web services. In: Proceedings of ICE. Electronic Proceedings in Theoretical Computer Science, vol. 38, pp. 13\u201327 (2010). https:\/\/doi.org\/10.4204\/EPTCS.38.4","DOI":"10.4204\/EPTCS.38.4"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Carbone, M., Lindley, S., Montesi, F., Sch\u00fcrmann, C., Wadler, P.: Coherence generalises duality: a logical explanation of multiparty session types. In: Proceedings of of CONCUR. LIPIcs, vol. 59, pp. 33:1\u201333:15. Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2016.33","DOI":"10.4230\/LIPIcs.CONCUR.2016.33"},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Carbone, M., Montesi, F.: Deadlock-freedom-by-design: multiparty asynchronous global programming. In: Proceedings of POPL, pp. 263\u2013274 (2013). https:\/\/doi.org\/10.1145\/2480359.2429101","DOI":"10.1145\/2480359.2429101"},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-662-44584-6_5","volume":"31","author":"M Carbone","year":"2018","unstructured":"Carbone, M., Montesi, F., Sch\u00fcrmann, C.: Choreographies, logically. Distrib. Comput. 31(1), 51\u201367 (2018). https:\/\/doi.org\/10.1007\/978-3-662-44584-6_5","journal-title":"Distrib. Comput."},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Carbone, M., Montesi, F., Sch\u00fcrmann, C., Yoshida, N.: Multiparty session types as coherence proofs. In: Proceedings of CONCUR. LIPIcs, vol.\u00a042, pp. 412\u2013426. Leibniz-Zentrum f\u00fcr Informatik (2015). https:\/\/doi.org\/10.1007\/s00236-016-0285-y","DOI":"10.1007\/s00236-016-0285-y"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.tcs.2019.09.027","volume":"807","author":"I Castellani","year":"2020","unstructured":"Castellani, I., Dezani-Ciancaglini, M., Giannini, P., Horne, R.: Global types with internal delegation. Theor. Comput. Sci. 807, 128\u2013153 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2019.09.027","journal-title":"Theor. Comput. Sci."},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-319-41579-6_8","volume-title":"Perspectives of System Informatics","author":"G Ciobanu","year":"2016","unstructured":"Ciobanu, G., Horne, R.: Behavioural analysis of sessions using the calculus of structures. In: Mazzara, M., Voronkov, A. (eds.) PSI 2015. LNCS, vol. 9609, pp. 91\u2013106. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41579-6_8"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Dardha, O.: Recursive session types revisited. In: Proceedings of BEAT. Electronic Proceedings in Theoretical Computer Science, vol. 162, pp. 27\u201334 (2014). https:\/\/doi.org\/10.4204\/EPTCS.162.4","DOI":"10.4204\/EPTCS.162.4"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-319-89366-2_5","volume-title":"Foundations of Software Science and Computation Structures","author":"O Dardha","year":"2018","unstructured":"Dardha, O., Gay, S.J.: A new linear logic for deadlock-free session-typed processes. In: Baier, C., Dal Lago, U. (eds.) FoSSaCS 2018. LNCS, vol. 10803, pp. 91\u2013109. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89366-2_5"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Dardha, O., Gay, S.J.: A new linear logic for deadlock-free session typed processes. In: Proceedings of FoSSaCS (2018). http:\/\/www.dcs.gla.ac.uk\/~ornela\/publications\/DG18-Extended.pdf","DOI":"10.1007\/978-3-319-89366-2_5"},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Dardha, O., Giachino, E., Sangiorgi, D.: Session types revisited. In: Proceedings of PPDP, pp. 139\u2013150. ACM (2012). https:\/\/doi.org\/10.1145\/2370776.2370794","DOI":"10.1145\/2370776.2370794"},{"key":"6_CR22","unstructured":"Dardha, O., P\u00e9rez, J.A.: Comparing type systems for deadlock-freedom (2018). https:\/\/arxiv.org\/abs\/1810.00635"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-39212-2_18","volume-title":"Automata, Languages, and Programming","author":"P-M Deni\u00e9lou","year":"2013","unstructured":"Deni\u00e9lou, P.-M., Yoshida, N.: Multiparty compatibility in communicating automata: characterisation and synthesis of global session types. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7966, pp. 174\u2013186. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39212-2_18"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-540-78663-4_18","volume-title":"Trustworthy Global Computing","author":"M Dezani-Ciancaglini","year":"2008","unstructured":"Dezani-Ciancaglini, M., de\u2019Liguoro, U., Yoshida, N.: On progress for structured communications. In: Barthe, G., Fournet, C. (eds.) TGC 2007. LNCS, vol. 4912, pp. 257\u2013275. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78663-4_18"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/11785477_20","volume-title":"ECOOP 2006 \u2013 Object-Oriented Programming","author":"M Dezani-Ciancaglini","year":"2006","unstructured":"Dezani-Ciancaglini, M., Mostrous, D., Yoshida, N., Drossopoulou, S.: Session types for object-oriented languages. In: Thomas, D. (ed.) ECOOP 2006. LNCS, vol. 4067, pp. 328\u2013352. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11785477_20"},{"issue":"1","key":"6_CR26","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1017\/S0956796809990268","volume":"20","author":"SJ Gay","year":"2010","unstructured":"Gay, S.J., Vasconcelos, V.T.: Linear type theory for asynchronous session types. J. Funct. Program. 20(1), 19\u201350 (2010). https:\/\/doi.org\/10.1017\/S0956796809990268","journal-title":"J. Funct. Program."},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"JY Girard","year":"1987","unstructured":"Girard, J.Y.: Linear logic. Theor. Comput. Sci. 50, 1\u2013102 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90045-4","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"6_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1182613.1182614","volume":"8","author":"A Guglielmi","year":"2007","unstructured":"Guglielmi, A.: A system of interaction and structure. ACM Trans. Comput. Log. 8(1), 1 (2007). https:\/\/doi.org\/10.1145\/1182613.1182614","journal-title":"ACM Trans. Comput. Log."},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/3-540-57208-2_35","volume-title":"CONCUR\u201993","author":"K Honda","year":"1993","unstructured":"Honda, K.: Types for dyadic interaction. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 509\u2013523. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57208-2_35"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/BFb0053567","volume-title":"Programming Languages and Systems","author":"K Honda","year":"1998","unstructured":"Honda, K., Vasconcelos, V.T., Kubo, M.: Language primitives and type discipline for structured communication-based programming. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol. 1381, pp. 122\u2013138. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0053567"},{"key":"6_CR31","doi-asserted-by":"publisher","unstructured":"Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. In: Proceedings of POPL, vol. 43, no. 1, pp. 273\u2013284. ACM (2008). https:\/\/doi.org\/10.1145\/2827695","DOI":"10.1145\/2827695"},{"key":"6_CR32","doi-asserted-by":"publisher","unstructured":"Horne, R.: Session subtyping and multiparty compatibility using circular sequents. In: Proceedings of CONCUR. LIPIcs, vol. 171, pp. 12:1\u201312:22. Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2020.12","DOI":"10.4230\/LIPIcs.CONCUR.2020.12"},{"issue":"2","key":"6_CR33","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1145\/276393.278524","volume":"20","author":"N Kobayashi","year":"1998","unstructured":"Kobayashi, N.: A partially deadlock-free typed process calculus. ACM Trans. Program. Lang. Syst. 20(2), 436\u2013482 (1998). https:\/\/doi.org\/10.1145\/276393.278524","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/11817949_16","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"N Kobayashi","year":"2006","unstructured":"Kobayashi, N.: A new type system for deadlock-free processes. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 233\u2013247. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817949_16"},{"key":"6_CR35","unstructured":"Kobayashi, N.: Type systems for concurrent programs (2007)"},{"key":"6_CR36","doi-asserted-by":"crossref","unstructured":"Kokke, W., Dardha, O.: Deadlock-free session types in Linear Haskell (2021). https:\/\/arxiv.org\/abs\/2103.14481","DOI":"10.1145\/3471874.3472979"},{"key":"6_CR37","doi-asserted-by":"publisher","unstructured":"Kokke, W., Montesi, F., Peressotti, M.: Better late than never: a fully-abstract semantics for classical processes. Proc. ACM Program. Lang. 3(POPL) (2019). https:\/\/doi.org\/10.1145\/3290337","DOI":"10.1145\/3290337"},{"key":"6_CR38","doi-asserted-by":"publisher","unstructured":"Kokke, W., Montesi, F., Peressotti, M.: Taking linear logic apart. In: Proceedings of Linearity & TLLA. Electronic Proceedings in Theoretical Computer Science, vol. 292, pp. 90\u2013103. Open Publishing Association (2019). https:\/\/doi.org\/10.4204\/EPTCS.292.5","DOI":"10.4204\/EPTCS.292.5"},{"key":"6_CR39","doi-asserted-by":"publisher","unstructured":"Lindley, S., Morris, J.G.: A semantics for propositions as sessions. In: Proceedings of ESOP, pp. 560\u2013584 (2015). https:\/\/doi.org\/10.1007\/978-3-662-46669-8_23","DOI":"10.1007\/978-3-662-46669-8_23"},{"key":"6_CR40","doi-asserted-by":"publisher","unstructured":"Lindley, S., Morris, J.G.: Talking bananas: structural recursion for session types. In: Proceedings of ICFP. ACM (2016). https:\/\/doi.org\/10.1145\/2951913.2951921","DOI":"10.1145\/2951913.2951921"},{"key":"6_CR41","unstructured":"Montesi, F., Peressotti, M.: Classical transitions (2018). https:\/\/arxiv.org\/abs\/1803.01049"},{"key":"6_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24836-1_5","volume-title":"Practical Aspects of Declarative Languages","author":"M Neubauer","year":"2004","unstructured":"Neubauer, M., Thiemann, P.: An implementation of session types. In: Jayaraman, B. (ed.) PADL 2004. LNCS, vol. 3057, pp. 56\u201370. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24836-1_5"},{"key":"6_CR43","doi-asserted-by":"publisher","unstructured":"Padovani, L.: From lock freedom to progress using session types. In: Proceedings of PLACES. vol. 137, pp. 3\u201319. Electronic Proceedings in Theoretical Computer Science (2013). https:\/\/doi.org\/10.4204\/EPTCS.137.2","DOI":"10.4204\/EPTCS.137.2"},{"key":"6_CR44","doi-asserted-by":"publisher","unstructured":"Padovani, L.: Deadlock and lock freedom in the linear $$\\pi $$-calculus. In: Proceedings of CSL-LICS, pp. 72:1\u201372:10. ACM (2014). https:\/\/doi.org\/10.1145\/2603088.2603116","DOI":"10.1145\/2603088.2603116"},{"key":"6_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-19195-9_1","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"L Padovani","year":"2015","unstructured":"Padovani, L., Novara, L.: Types for deadlock-free higher-order programs. In: Graf, S., Viswanathan, M. (eds.) FORTE 2015. LNCS, vol. 9039, pp. 3\u201318. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19195-9_1"},{"key":"6_CR46","doi-asserted-by":"publisher","unstructured":"Scalas, A., Yoshida, N.: Less is more: multiparty session types revisited. Proc. ACM Program. Lang. 3(POPL) (2019). https:\/\/doi.org\/10.1145\/3290343","DOI":"10.1145\/3290343"},{"key":"6_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-58184-7_118","volume-title":"PARLE\u201994 Parallel Architectures and Languages Europe","author":"K Takeuchi","year":"1994","unstructured":"Takeuchi, K., Honda, K., Kubo, M.: An interaction-based language and its typing system. In: Halatsis, C., Maritsas, D., Philokyprou, G., Theodoridis, S. (eds.) PARLE 1994. LNCS, vol. 817, pp. 398\u2013413. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58184-7_118"},{"key":"6_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-642-28729-9_23","volume-title":"Foundations of Software Science and Computational Structures","author":"B Toninho","year":"2012","unstructured":"Toninho, B., Caires, L., Pfenning, F.: Functions as session-typed processes. In: Birkedal, L. (ed.) FoSSaCS 2012. LNCS, vol. 7213, pp. 346\u2013360. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28729-9_23"},{"key":"6_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-540-28644-8_32","volume-title":"CONCUR 2004 - Concurrency Theory","author":"V Vasconcelos","year":"2004","unstructured":"Vasconcelos, V., Ravara, A., Gay, S.: Session types for functional multithreading. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 497\u2013511. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28644-8_32"},{"issue":"1\u20132","key":"6_CR50","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.tcs.2006.06.028","volume":"368","author":"VT Vasconcelos","year":"2006","unstructured":"Vasconcelos, V.T., Gay, S.J., Ravara, A.: Type checking a multithreaded functional language with session types. Theor. Comput. Sci. 368(1\u20132), 64\u201387 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2006.06.028","journal-title":"Theor. Comput. Sci."},{"key":"6_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-642-38493-6_17","volume-title":"Coordination Models and Languages","author":"H Torres Vieira","year":"2013","unstructured":"Torres Vieira, H., Thudichum Vasconcelos, V.: Typing progress in communication-centred systems. In: De Nicola, R., Julien, C. (eds.) COORDINATION 2013. LNCS, vol. 7890, pp. 236\u2013250. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38493-6_17"},{"key":"6_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-030-34968-4_24","volume-title":"Integrated Formal Methods","author":"AL Voinea","year":"2019","unstructured":"Voinea, A.L., Dardha, O., Gay, S.J.: Resource sharing via capability-based multiparty session types. In: Ahrendt, W., Tapia Tarifa, S.L. (eds.) IFM 2019. LNCS, vol. 11918, pp. 437\u2013455. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34968-4_24"},{"issue":"2\u20133","key":"6_CR53","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1017\/S095679681400001X","volume":"24","author":"P Wadler","year":"2014","unstructured":"Wadler, P.: Propositions as sessions. J. Funct. Program. 24(2\u20133), 384\u2013418 (2014). https:\/\/doi.org\/10.1017\/S095679681400001X","journal-title":"J. Funct. Program."},{"issue":"12","key":"6_CR54","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/2699407","volume":"58","author":"P Wadler","year":"2015","unstructured":"Wadler, P.: Propositions as types. Commun. ACM 58(12), 75\u201384 (2015). https:\/\/doi.org\/10.1145\/2699407","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78089-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,8]],"date-time":"2025-06-08T22:03:11Z","timestamp":1749420191000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78089-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030780883","9783030780890"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78089-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"8 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Techniques for Distributed Objects, Components, and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Valletta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malta","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"forte2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2021\/forte","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}