{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:30:53Z","timestamp":1767929453574,"version":"3.49.0"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030171834","type":"print"},{"value":"9783030171841","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17184-1_22","type":"book-chapter","created":{"date-parts":[[2019,4,6]],"date-time":"2019-04-06T17:34:04Z","timestamp":1554572044000},"page":"611-639","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Manifest Deadlock-Freedom for Shared Session Types"],"prefix":"10.1007","author":[{"given":"Stephanie","family":"Balzer","sequence":"first","affiliation":[]},{"given":"Bernardo","family":"Toninho","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Pfenning","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-319-30936-1_2","volume-title":"A List of Successes That Can Change the World","author":"R Atkey","year":"2016","unstructured":"Atkey, R., Lindley, S., Morris, J.G.: Conflation confers concurrency. In: Lindley, S., McBride, C., Trinder, P., Sannella, D. (eds.) A List of Successes That Can Change the World. LNCS, vol. 9600, pp. 32\u201355. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30936-1_2"},{"issue":"ICEP","key":"22_CR2","first-page":"37:1","volume":"1","author":"S Balzer","year":"2017","unstructured":"Balzer, S., Pfenning, F.: Manifest sharing with session types. Proc. ACM Program. Lang. (PACMPL) 1(ICEP), 37:1\u201337:29 (2017)","journal-title":"Proc. ACM Program. Lang. (PACMPL)"},{"key":"22_CR3","unstructured":"Balzer, S., Pfenning, F., Toninho, B.: A universal session type for untyped asynchronous communication. In: 29th International Conference on Concurrency Theory (CONCUR). LIPIcs, pp. 30:1\u201330:18. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Balzer, S., Toninho, B., Pfenning, F.: Manifest deadlock-freedom for shared session types. Technical report CMU-CS-19-102, Carnegie Mellon University (2019)","DOI":"10.1007\/978-3-030-17184-1_22"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0022251","volume-title":"Computer Science Logic","author":"PN Benton","year":"1995","unstructured":"Benton, P.N.: A mixed linear and non-linear logic: proofs, terms and models. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol. 933, pp. 121\u2013135. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0022251"},{"key":"22_CR6","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., Luca, M.D., 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":"22_CR7","unstructured":"Caires, L., P\u00e9rez, J.A., Pfenning, F., Toninho, B.: Logic-based domain-aware session types, unpublished draft"},{"key":"22_CR8","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"},{"issue":"3","key":"22_CR9","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1017\/S0960129514000218","volume":"26","author":"L Caires","year":"2016","unstructured":"Caires, L., Pfenning, F., Toninho, B.: Linear logic propositions as session types. Math. Struct. Comput. Sci. 26(3), 367\u2013423 (2016)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"51\u201352","key":"22_CR10","doi-asserted-by":"publisher","first-page":"4399","DOI":"10.1016\/j.tcs.2010.09.010","volume":"411","author":"L Caires","year":"2010","unstructured":"Caires, L., Vieira, H.T.: Conversation types. Theor. Comput. Sci. 411(51\u201352), 4399\u20134440 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"POPL","key":"22_CR11","first-page":"29:1","volume":"3","author":"D Castro","year":"2019","unstructured":"Castro, D., Hu, R., Jongmans, S., Ng, N., Yoshida, N.: Distributed programming using role-parametric session types in go: statically-typed endpoint APIs for dynamically-instantiated communication structures. PACMPL 3(POPL), 29:1\u201329:30 (2019)","journal-title":"PACMPL"},{"issue":"10","key":"22_CR12","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1016\/j.ic.2008.11.006","volume":"207","author":"I Cervesato","year":"2009","unstructured":"Cervesato, I., Scedrov, A.: Relating state-based and process-based concurrency through linear logic. Inf. Comput. 207(10), 1044\u20131077 (2009)","journal-title":"Inf. Comput."},{"issue":"2","key":"22_CR13","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1017\/S0960129514000188","volume":"26","author":"M Coppo","year":"2016","unstructured":"Coppo, M., Dezani-Ciancaglini, M., Yoshida, N., Padovani, L.: Global progress for dynamically interleaved multiparty sessions. Math. Struct. Comput. Sci. 26(2), 238\u2013302 (2016)","journal-title":"Math. Struct. Comput. Sci."},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Crary, K., Harper, R., Puri, S.: What is a recursive module? In: ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pp. 50\u201363 (1999)","DOI":"10.1145\/301631.301641"},{"key":"22_CR15","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":"22_CR16","doi-asserted-by":"crossref","unstructured":"Dardha, O., P\u00e9rez, J.A.: Comparing deadlock-free session typed processes. In: EXPRESS\/SOS, pp. 1\u201315 (2015)","DOI":"10.4204\/EPTCS.190.1"},{"key":"22_CR17","unstructured":"de\u2019Liguoro, U., Padovani, L.: Mailbox types for unordered interactions. In: 32nd European Conference on Object-Oriented Programming, ECOOP 2018, pp. 15:1\u201315:28 (2018)"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Gay, S.J., Gesbert, N., Ravara, A.: Session types as generic process types. In: 21st International Workshop on Expressiveness in Concurrency and 11th Workshop on Structural Operational Semantics, EXPRESS\/SOS 2014, pp. 94\u2013110 (2014)","DOI":"10.4204\/EPTCS.160.9"},{"issue":"2\u20133","key":"22_CR19","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00236-005-0177-z","volume":"42","author":"SJ Gay","year":"2005","unstructured":"Gay, S.J., Hole, M.: Subtyping for session types in the $$\\pi $$ -calculus. Acta Informatica 42(2\u20133), 191\u2013225 (2005)","journal-title":"Acta Informatica"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Gay, S.J., Vasconcelos, V.T., Ravara, A., Gesbert, N., Caldeira, A.Z.: Modular session types for distributed object-oriented programming. In: 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp. 299\u2013312 (2010)","DOI":"10.1145\/1706299.1706335"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-662-44584-6_6","volume-title":"CONCUR 2014 \u2013 Concurrency Theory","author":"E Giachino","year":"2014","unstructured":"Giachino, E., Kobayashi, N., Laneve, C.: Deadlock analysis of unbounded process networks. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 63\u201377. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44584-6_6"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/978-3-319-89884-1_27","volume-title":"Programming Languages and Systems","author":"H Gommerstadt","year":"2018","unstructured":"Gommerstadt, H., Jia, L., Pfenning, F.: Session-typed concurrent contracts. In: Ahmed, A. (ed.) ESOP 2018. LNCS, vol. 10801, pp. 771\u2013798. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89884-1_27"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Griffith, D.: Polarized substructural session types. Ph.D. thesis, University of Illinois at Urbana-Champaign (2016)","DOI":"10.2172\/1562827"},{"key":"22_CR24","unstructured":"Griffith, D., Pfenning, F.: SILL (2015). https:\/\/github.com\/ISANobody\/sill"},{"key":"22_CR25","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":"22_CR26","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":"22_CR27","doi-asserted-by":"crossref","unstructured":"Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. In: 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp. 273\u2013284. ACM (2008)","DOI":"10.1145\/1328438.1328472"},{"key":"22_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-662-49665-7_24","volume-title":"Fundamental Approaches to Software Engineering","author":"R Hu","year":"2016","unstructured":"Hu, R., Yoshida, N.: Hybrid session verification through endpoint API generation. In: Stevens, P., W\u0105sowski, A. (eds.) FASE 2016. LNCS, vol. 9633, pp. 401\u2013418. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49665-7_24"},{"key":"22_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-662-54494-5_7","volume-title":"Fundamental Approaches to Software Engineering","author":"R Hu","year":"2017","unstructured":"Hu, R., Yoshida, N.: Explicit connection actions in multiparty session types. In: Huisman, M., Rubin, J. (eds.) FASE 2017. LNCS, vol. 10202, pp. 116\u2013133. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54494-5_7"},{"key":"22_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BFb0032742","volume-title":"Static Analysis","author":"A Igarashi","year":"1997","unstructured":"Igarashi, A., Kobayashi, N.: Type-based analysis of communication for concurrent programming languages. In: Van Hentenryck, P. (ed.) SAS 1997. LNCS, vol. 1302, pp. 187\u2013201. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0032742"},{"key":"22_CR31","doi-asserted-by":"crossref","unstructured":"Igarashi, A., Kobayashi, N.: A generic type system for the Pi-calculus. In: Conference Record of POPL 2001: The 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 128\u2013141 (2001)","DOI":"10.1145\/373243.360215"},{"issue":"1\u20133","key":"22_CR32","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0304-3975(03)00325-6","volume":"311","author":"A Igarashi","year":"2004","unstructured":"Igarashi, A., Kobayashi, N.: A generic type system for the Pi-calculus. Theor. Comput. Sci. 311(1\u20133), 121\u2013163 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR33","doi-asserted-by":"crossref","unstructured":"Jespersen, T.B.L., Munksgaard, P., Larsen, K.F.: Session types for rust. In: 11th ACM SIGPLAN Workshop on Generic Programming, WGP 2015, pp. 13\u201322 (2015)","DOI":"10.1145\/2808098.2808100"},{"key":"22_CR34","unstructured":"Kobayashi, N.: A partially deadlock-free typed process calculus. In: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, pp. 128\u2013139 (1997)"},{"issue":"2","key":"22_CR35","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/S0890-5401(02)93171-8","volume":"177","author":"N Kobayashi","year":"2002","unstructured":"Kobayashi, N.: A type system for lock-free processes. Inf. Comput. 177(2), 122\u2013159 (2002)","journal-title":"Inf. Comput."},{"issue":"4\u20135","key":"22_CR36","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s00236-005-0179-x","volume":"42","author":"N Kobayashi","year":"2005","unstructured":"Kobayashi, N.: Type-based information flow analysis for the $$\\pi $$ -calculus. Acta Inf. 42(4\u20135), 291\u2013347 (2005)","journal-title":"Acta Inf."},{"key":"22_CR37","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":"22_CR38","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.ic.2016.03.004","volume":"252","author":"N Kobayashi","year":"2017","unstructured":"Kobayashi, N., Laneve, C.: Deadlock analysis of unbounded process networks. Inf. Comput. 252, 48\u201370 (2017)","journal-title":"Inf. Comput."},{"key":"22_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/3-540-44618-4_35","volume-title":"CONCUR 2000 \u2014 Concurrency Theory","author":"N Kobayashi","year":"2000","unstructured":"Kobayashi, N., Saito, S., Sumii, E.: An implicitly-typed deadlock-free process calculus. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 489\u2013504. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44618-4_35"},{"key":"22_CR40","doi-asserted-by":"crossref","unstructured":"Lange, J., Ng, N., Toninho, B., Yoshida, N.: Fencing off go: liveness and safety for channel-based programming. In: 44th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp. 748\u2013761. ACM (2017)","DOI":"10.1145\/3093333.3009847"},{"key":"22_CR41","doi-asserted-by":"crossref","unstructured":"Lange, J., Ng, N., Toninho, B., Yoshida, N.: A static verification framework for message passing in go using behavioural types. In: Proceedings of the 40th International Conference on Software Engineering, ICSE 2018, Gothenburg, Sweden, 27 May\u201303 June 2018, pp. 1137\u20131148 (2018)","DOI":"10.1145\/3180155.3180157"},{"key":"22_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"R Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communicating Systems. LNCS, vol. 92. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10235-3"},{"key":"22_CR43","doi-asserted-by":"crossref","unstructured":"Neykova, R., Hu, R., Yoshida, N., Abdeljallal, F.: A session type provider: compile-time API generation of distributed protocols with refinements in F#. In: Proceedings of the 27th International Conference on Compiler Construction, CC 2018, pp. 128\u2013138 (2018)","DOI":"10.1145\/3178372.3179495"},{"key":"22_CR44","doi-asserted-by":"crossref","unstructured":"Padovani, L.: Deadlock and lock freedom in the linear $$\\pi $$ -calculus. In: Computer Science Logic - Logic in Computer Science (CSL-LICS), pp. 72:1\u201372:10 (2014)","DOI":"10.1145\/2603088.2603116"},{"key":"22_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-662-43376-8_10","volume-title":"Coordination Models and Languages","author":"L Padovani","year":"2014","unstructured":"Padovani, L., Vasconcelos, V.T., Vieira, H.T.: Typing liveness in multiparty communicating systems. In: K\u00fchn, E., Pugliese, R. (eds.) COORDINATION 2014. LNCS, vol. 8459, pp. 147\u2013162. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43376-8_10"},{"key":"22_CR46","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.ic.2014.08.001","volume":"239","author":"JA P\u00e9rez","year":"2014","unstructured":"P\u00e9rez, J.A., Caires, L., Pfenning, F., Toninho, B.: Linear logical relations and observational equivalences for session-based concurrency. Inf. Comput. 239, 254\u2013302 (2014)","journal-title":"Inf. Comput."},{"key":"22_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-46678-0_1","volume-title":"Foundations of Software Science and Computation Structures","author":"F Pfenning","year":"2015","unstructured":"Pfenning, F., Griffith, D.: Polarized substructural session types. In: Pitts, A. (ed.) FoSSaCS 2015. LNCS, vol. 9034, pp. 3\u201322. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46678-0_1"},{"key":"22_CR48","unstructured":"Reed, J.: A judgmental deconstruction of modal logic, January 2009. http:\/\/www.cs.cmu.edu\/~jcreed\/papers\/jdml.pdf , unpublished manuscript"},{"key":"22_CR49","unstructured":"Scalas, A., Dardha, O., Hu, R., Yoshida, N.: A linear decomposition of multiparty sessions for safe distributed programming. In: 31st European Conference on Object-Oriented Programming, ECOOP 2017, pp. 24:1\u201324:31 (2017)"},{"key":"22_CR50","unstructured":"Scalas, A., Yoshida, N.: Lightweight session programming in scala. In: 30th European Conference on Object-Oriented Programming, ECOOP 2016, pp. 21:1\u201321:28 (2016)"},{"key":"22_CR51","unstructured":"Toninho, B.: A logical foundation for session-based concurrent computation. Ph.D. thesis, Carnegie Mellon University and New University of Lisbon (2015)"},{"key":"22_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-37036-6_20","volume-title":"Programming Languages and Systems","author":"B Toninho","year":"2013","unstructured":"Toninho, B., Caires, L., Pfenning, F.: Higher-order processes, functions, and sessions: a monadic integration. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 350\u2013369. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37036-6_20"},{"key":"22_CR53","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.ic.2012.05.002","volume":"217","author":"VT Vasconcelos","year":"2012","unstructured":"Vasconcelos, V.T.: Fundamentals of session types. Inf. Comput. 217, 52\u201370 (2012)","journal-title":"Inf. Comput."},{"key":"22_CR54","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":"HT Vieira","year":"2013","unstructured":"Vieira, H.T., Vasconcelos, V.T.: 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":"22_CR55","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Propositions as sessions. In: 17th ACM SIGPLAN International Conference on Functional Programming (ICFP), pp. 273\u2013286. ACM (2012)","DOI":"10.1145\/2364527.2364568"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17184-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,23]],"date-time":"2019-11-23T01:15:58Z","timestamp":1574471758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17184-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030171834","9783030171841"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17184-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esop2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2019\/esop","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"86","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"33% - 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"}},{"value":"3,2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}