{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:13:48Z","timestamp":1775873628314,"version":"3.50.1"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030449131","type":"print"},{"value":"9783030449148","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T00:00:00Z","timestamp":1587168000000},"content-version":"vor","delay-in-days":108,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Session types describe patterns of interaction on communicating channels. Traditional session types include a form of choice whereby servers offer a collection of options, of which each client picks exactly one. This sort of choice constitutes a particular case of separated choice: offering on one side, selecting on the other. We introduce mixed choices in the context of session types and argue that they increase the flexibility of program development at the same time that they reduce the number of synchronisation primitives to exactly one. We present a type system incorporating subtyping and prove preservation and absence of runtime errors for well-typed processes. We further show that classical (conventional) sessions can be faithfully and tightly embedded in mixed choices. Finally, we discuss algorithmic type checking and a runtime system built on top of a conventional (choice-less) message-passing architecture.<\/jats:p>","DOI":"10.1007\/978-3-030-44914-8_26","type":"book-chapter","created":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T10:02:53Z","timestamp":1587117773000},"page":"715-742","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Mixed Sessions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9539-8861","authenticated-orcid":false,"given":"Vasco T.","family":"Vasconcelos","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1406-9183","authenticated-orcid":false,"given":"Filipe","family":"Casal","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5398-6529","authenticated-orcid":false,"given":"Bernardo","family":"Almeida","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1547-0692","authenticated-orcid":false,"given":"Andreia","family":"Mordido","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,18]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Almeida, B., Mordido, A., Vasconcelos, V.T.: Checking the equivalence of context-free session types. In: Tools and Algorithms for the Construction and Analysis of Systems - 26th International Conference, TACAS 2020. Lecture Notes in Computer Science, Springer (2020)","DOI":"10.1007\/978-3-030-45237-7_3"},{"key":"26_CR2","unstructured":"Barendregt, H.P.: The lambda calculus - its syntax and semantics, Studies in logic and the foundations of mathematics, vol. 103. North-Holland (1985)"},{"key":"26_CR3","doi-asserted-by":"publisher","unstructured":"Bergstra, J.A., Klop, J.W.: Process theory based on bisimulation semantics. In: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. Lecture Notes in Computer Science, vol. 354, pp. 50\u2013122. Springer (1988). https:\/\/doi.org\/10.1007\/BFb0013021","DOI":"10.1007\/BFb0013021"},{"key":"26_CR4","doi-asserted-by":"publisher","unstructured":"Bernardi, G., Dardha, O., Gay, S.J., Kouzapas, D.: On duality relations for session types. In: Trustworthy Global Computing. Lecture Notes in Computer Science, vol. 8902, pp. 51\u201366. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-662-45917-1_4","DOI":"10.1007\/978-3-662-45917-1_4"},{"key":"26_CR5","doi-asserted-by":"publisher","unstructured":"Bernardi, G., Hennessy, M.: Using higher-order contracts to model session types. Logical Methods in Computer Science 12(2) (2016). https:\/\/doi.org\/10.2168\/LMCS-12(2:10)2016","DOI":"10.2168\/LMCS-12(2:10)2016"},{"key":"26_CR6","doi-asserted-by":"publisher","unstructured":"Bono, V., Messa, C., Padovani, L.: Typing copyless message passing. In: Programming Languages and Systems. Lecture Notes in Computer Science, vol. 6602, pp. 57\u201376. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-19718-5_4","DOI":"10.1007\/978-3-642-19718-5_4"},{"key":"26_CR7","doi-asserted-by":"publisher","unstructured":"Bono, V., Padovani, L.: Typing copyless message passing. Logical Methods in Computer Science 8(1) (2012). https:\/\/doi.org\/10.2168\/LMCS-8(1:17)2012","DOI":"10.2168\/LMCS-8(1:17)2012"},{"key":"26_CR8","doi-asserted-by":"publisher","unstructured":"Caires, L., Pfenning, F., Toninho, B.: Linear logic propositions as session types. Mathematical Structures in Computer Science 26(3), 367\u2013423 (2016). https:\/\/doi.org\/10.1017\/S0960129514000218","DOI":"10.1017\/S0960129514000218"},{"key":"26_CR9","doi-asserted-by":"publisher","unstructured":"Demangeon, R., Honda, K.: Full abstraction in a subtyped pi-calculus with linear types. In: CONCUR 2011 - Concurrency Theory. Lecture Notes in Computer Science, vol. 6901, pp. 280\u2013296. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-23217-6_19","DOI":"10.1007\/978-3-642-23217-6_19"},{"key":"26_CR10","doi-asserted-by":"publisher","unstructured":"F\u00e4hndrich, M., Aiken, M., Hawblitzel, C., Hodson, O., Hunt, G.C., Larus, J.R., Levi, S.: Language support for fast and reliable message-based communication in singularity OS. In: Proceedings of the 2006 EuroSys Conference. pp. 177\u2013190. ACM (2006). https:\/\/doi.org\/10.1145\/1217935.1217953","DOI":"10.1145\/1217935.1217953"},{"key":"26_CR11","doi-asserted-by":"publisher","unstructured":"Fowler, S., Lindley, S., Morris, J.G., Decova, S.: Exceptional asynchronous session types: session types without tiers. PACMPL 3(POPL), 28:1\u201328:29 (2019). https:\/\/doi.org\/10.1145\/3290341","DOI":"10.1145\/3290341"},{"key":"26_CR12","doi-asserted-by":"publisher","unstructured":"Franco, J., Vasconcelos, V.T.: A concurrent programming language with refined session types. In: Software Engineering and Formal Methods. Lecture Notes in Computer Science, vol. 8368, pp. 15\u201328. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-319-05032-4_2","DOI":"10.1007\/978-3-319-05032-4_2"},{"key":"26_CR13","doi-asserted-by":"publisher","unstructured":"Garrigue, J., Keller, G., Sumii, E. (eds.): Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, ICFP 2016, Nara, Japan, September 18\u201322, 2016. ACM (2016). https:\/\/doi.org\/10.1145\/2951913","DOI":"10.1145\/2951913"},{"key":"26_CR14","doi-asserted-by":"publisher","unstructured":"Gastin, P., Laroussinie, F. (eds.): CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings, Lecture Notes in Computer Science, vol. 6269. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-15375-4","DOI":"10.1007\/978-3-642-15375-4"},{"key":"26_CR15","doi-asserted-by":"publisher","unstructured":"Gay, S.J., Hole, M.: Subtyping for session types in the pi calculus. Acta Inf. 42(2\u20133), 191\u2013225 (2005). https:\/\/doi.org\/10.1007\/s00236-005-0177-z","DOI":"10.1007\/s00236-005-0177-z"},{"key":"26_CR16","doi-asserted-by":"publisher","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","DOI":"10.1017\/S0956796809990268"},{"key":"26_CR17","doi-asserted-by":"publisher","unstructured":"Gorla, D.: Towards a unified approach to encodability and separation results for process calculi. Inf. Comput. 208(9), 1031\u20131053 (2010). https:\/\/doi.org\/10.1016\/j.ic.2010.05.002","DOI":"10.1016\/j.ic.2010.05.002"},{"key":"26_CR18","doi-asserted-by":"publisher","unstructured":"Honda, K.: Types for dyadic interaction. In: CONCUR \u201993, 4th International Conference on Concurrency Theory. Lecture Notes in Computer Science, vol. 715, pp. 509\u2013523. Springer (1993). https:\/\/doi.org\/10.1007\/3-540-57208-2_35","DOI":"10.1007\/3-540-57208-2_35"},{"key":"26_CR19","doi-asserted-by":"publisher","unstructured":"Honda, K., Vasconcelos, V.T., Kubo, M.: Language primitives and type discipline for structured communication-based programming. In: Programming Languages and Systems. Lecture Notes in Computer Science, vol. 1381, pp. 122\u2013138. Springer (1998). https:\/\/doi.org\/10.1007\/BFb0053567","DOI":"10.1007\/BFb0053567"},{"key":"26_CR20","doi-asserted-by":"publisher","unstructured":"Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. In: Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. pp. 273\u2013284. ACM (2008). https:\/\/doi.org\/10.1145\/1328438.1328472","DOI":"10.1145\/1328438.1328472"},{"key":"26_CR21","doi-asserted-by":"publisher","unstructured":"Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. J. ACM 63(1), 9:1\u20139:67 (2016). https:\/\/doi.org\/10.1145\/2827695","DOI":"10.1145\/2827695"},{"key":"26_CR22","doi-asserted-by":"publisher","unstructured":"Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the pi-calculus. In: Conference Record of POPL\u201996. pp. 358\u2013371. ACM Press (1996). https:\/\/doi.org\/10.1145\/237721.237804","DOI":"10.1145\/237721.237804"},{"key":"26_CR23","doi-asserted-by":"publisher","unstructured":"Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the pi-calculus. ACM Trans. Program. Lang. Syst. 21(5), 914\u2013947 (1999). https:\/\/doi.org\/10.1145\/330249.330251","DOI":"10.1145\/330249.330251"},{"key":"26_CR24","unstructured":"Kouzapas, D., Yoshida, N.: Mixed-choice multiparty session types (2020), unpublished"},{"key":"26_CR25","doi-asserted-by":"publisher","unstructured":"Lindley, S., Morris, J.G.: Talking bananas: structural recursion for session types. In: Garrigue et al. [13], pp. 434\u2013447. https:\/\/doi.org\/10.1145\/2951913.2951921","DOI":"10.1145\/2951913.2951921"},{"key":"26_CR26","doi-asserted-by":"publisher","unstructured":"Milner, R.: A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol. 92. Springer (1980). https:\/\/doi.org\/10.1007\/3-540-10235-3","DOI":"10.1007\/3-540-10235-3"},{"key":"26_CR27","doi-asserted-by":"publisher","unstructured":"Milner, R.: Functions as processes. In: Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 443, pp. 167\u2013180. Springer (1990). https:\/\/doi.org\/10.1007\/BFb0032030","DOI":"10.1007\/BFb0032030"},{"key":"26_CR28","unstructured":"Milner, R.: The polyadic pi-calculus: A tutorial. ECS-LFCS 91\u2013180, Lab oratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh (1991), this report was published in F. L. Hamer, W. Brauer and H. Schwichtenberg, editors, Logic and Algebra of Specification. Springer-Verlag, 1993"},{"key":"26_CR29","doi-asserted-by":"publisher","unstructured":"Milner, R.: Functions as processes. Mathematical Structures in Computer Science 2(2), 119\u2013141 (1992). https:\/\/doi.org\/10.1017\/S0960129500001407","DOI":"10.1017\/S0960129500001407"},{"key":"26_CR30","doi-asserted-by":"publisher","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. I. Inf. Comput. 100(1), 1\u201340 (1992). https:\/\/doi.org\/10.1016\/0890-5401(92)90008-4","DOI":"10.1016\/0890-5401(92)90008-4"},{"key":"26_CR31","doi-asserted-by":"publisher","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. II. Inf. Comput. 100(1), 41\u201377 (1992). https:\/\/doi.org\/10.1016\/0890-5401(92)90009-5","DOI":"10.1016\/0890-5401(92)90009-5"},{"key":"26_CR32","doi-asserted-by":"publisher","unstructured":"Palamidessi, C.: Comparing the expressive power of the synchronous and asynchronous pi-calculi. Mathematical Structures in Computer Science 13(5), 685\u2013719 (2003). https:\/\/doi.org\/10.1017\/S0960129503004043","DOI":"10.1017\/S0960129503004043"},{"key":"26_CR33","doi-asserted-by":"publisher","unstructured":"Peters, K., Nestmann, U.: Breaking symmetries. Mathematical Structures in Computer Science 26(6), 1054\u20131106 (2016). https:\/\/doi.org\/10.1017\/S0960129514000346","DOI":"10.1017\/S0960129514000346"},{"key":"26_CR34","doi-asserted-by":"publisher","unstructured":"Peters, K., Schicke, J., Nestmann, U.: Synchrony vs causality in the asynchronous pi-calculus. In: Proceedings 18th International Workshop on Expressiveness in Concurrency. EPTCS, vol. 64, pp. 89\u2013103 (2011). https:\/\/doi.org\/10.4204\/EPTCS.64.7","DOI":"10.4204\/EPTCS.64.7"},{"key":"26_CR35","doi-asserted-by":"publisher","unstructured":"Peters, K., Schicke-Uffmann, J., Goltz, U., Nestmann, U.: Synchrony versus causality in distributed systems. Mathematical Structures in Computer Science 26(8), 1459\u20131498 (2016). https:\/\/doi.org\/10.1017\/S0960129514000644","DOI":"10.1017\/S0960129514000644"},{"key":"26_CR36","doi-asserted-by":"crossref","unstructured":"Pierce, B.C., Turner, D.N.: Pict: a programming language based on the pi-calculus. In: Proof, Language, and Interaction, Essays in Honour of Robin Milner. pp. 455\u2013494. The MIT Press (2000)","DOI":"10.7551\/mitpress\/5641.003.0022"},{"key":"26_CR37","doi-asserted-by":"publisher","unstructured":"Sangiorgi, D.: An interpretation of typed objects into typed pi-calculus. Inf. Comput. 143(1), 34\u201373 (1998). https:\/\/doi.org\/10.1006\/inco.1998.2711","DOI":"10.1006\/inco.1998.2711"},{"key":"26_CR38","unstructured":"Sangiorgi, D., Walker, D.: The Pi-Calculus - a theory of mobile processes. Cambridge University Press (2001)"},{"key":"26_CR39","doi-asserted-by":"publisher","unstructured":"Stengel, Z., Bultan, T.: Analyzing singularity channel contracts. In: Proceedings of the Eighteenth International Symposium on Software Testing and Analysis. pp. 13\u201324. ACM (2009). https:\/\/doi.org\/10.1145\/1572272.1572275","DOI":"10.1145\/1572272.1572275"},{"key":"26_CR40","doi-asserted-by":"publisher","unstructured":"Strom, R.E., Yemini, S.: Typestate: A programming language concept for enhancing software reliability. IEEE Trans. Software Eng. 12(1), 157\u2013171 (1986). https:\/\/doi.org\/10.1109\/TSE.1986.6312929","DOI":"10.1109\/TSE.1986.6312929"},{"key":"26_CR41","doi-asserted-by":"publisher","unstructured":"Takeuchi, K., Honda, K., Kubo, M.: An interaction-based language and its typing system. In: PARLE \u201994: Parallel Architectures and Languages Europe. Lecture Notes in Computer Science, vol. 817, pp. 398\u2013413. Springer (1994). https:\/\/doi.org\/10.1007\/3-540-58184-7_118","DOI":"10.1007\/3-540-58184-7_118"},{"key":"26_CR42","doi-asserted-by":"publisher","unstructured":"Thiemann, P., Vasconcelos, V.T.: Context-free session types. In: Garrigue et al. [13], pp. 462\u2013475. https:\/\/doi.org\/10.1145\/2951913.2951926","DOI":"10.1145\/2951913.2951926"},{"key":"26_CR43","doi-asserted-by":"publisher","unstructured":"Vasconcelos, V.T.: Fundamentals of session types. Inf. Comput. 217, 52\u201370 (2012). https:\/\/doi.org\/10.1016\/j.ic.2012.05.002","DOI":"10.1016\/j.ic.2012.05.002"},{"key":"26_CR44","doi-asserted-by":"publisher","unstructured":"Vasconcelos, V.T.: Typed concurrent objects. In: Object-Oriented Programming. Lecture Notes in Computer Science, vol. 821, pp. 100\u2013117. Springer (1994). https:\/\/doi.org\/10.1007\/BFb0052178","DOI":"10.1007\/BFb0052178"},{"key":"26_CR45","doi-asserted-by":"publisher","unstructured":"Vasconcelos, V.T.: Fundamentals of session types. In: Formal Methods for Web Services. Lecture Notes in Computer Science, vol. 5569, pp. 158\u2013186. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-01918-0_4","DOI":"10.1007\/978-3-642-01918-0_4"},{"key":"26_CR46","doi-asserted-by":"publisher","unstructured":"Wadler, P.: Propositions as sessions. In: ACM SIGPLAN International Conference on Functional Programming. pp. 273\u2013286. ACM (2012). https:\/\/doi.org\/10.1145\/2364527.2364568","DOI":"10.1145\/2364527.2364568"},{"key":"26_CR47","doi-asserted-by":"publisher","unstructured":"Wadler, P.: Propositions as sessions. J. Funct. Program. 24(2\u20133), 384\u2013418 (2014). https:\/\/doi.org\/10.1017\/S095679681400001X","DOI":"10.1017\/S095679681400001X"},{"key":"26_CR48","unstructured":"Waker, D.: Advanced Topics in Types and Programming Languages, chap. The MIT Press, Substructural Type Systems (2005)"},{"key":"26_CR49","doi-asserted-by":"publisher","unstructured":"Yoshida, N., Vasconcelos, V.T.: Language primitives and type discipline for structured communication-based programming revisited: Two systems for higher-order session communication. Electr. Notes Theor. Comput. Sci. 171(4), 73\u201393 (2007). https:\/\/doi.org\/10.1016\/j.entcs.2007.02.056","DOI":"10.1016\/j.entcs.2007.02.056"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-44914-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,4]],"date-time":"2024-08-04T05:58:09Z","timestamp":1722751089000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-44914-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030449131","9783030449148"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-44914-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 April 2020","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":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esop2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2020\/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 (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":"87","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":"27","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":"0","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":"31% - 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,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":"11-12","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":"The conference could not take place due to the COVID-19 pandemic. There was an online event on July 2, 2020.","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)"}}]}}