{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:04:01Z","timestamp":1742918641042,"version":"3.40.3"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030171834"},{"type":"electronic","value":"9783030171841"}],"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_23","type":"book-chapter","created":{"date-parts":[[2019,4,6]],"date-time":"2019-04-06T21:34:04Z","timestamp":1554586444000},"page":"640-667","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Categorical Model of an $$\\mathbf {i\/o}$$ -typed $$\\pi $$ -calculus"],"prefix":"10.1007","author":[{"given":"Ken","family":"Sakayori","sequence":"first","affiliation":[]},{"given":"Takeshi","family":"Tsukada","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"issue":"1","key":"23_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)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Gay, S.J., Nagarajan, R.: Interaction categories and the foundations of typed concurrent programming. In: Proceedings of the NATO Advanced Study Institute on Deductive Program Design, Marktoberdorf, Germany, pp. 35\u2013113 (1996)","DOI":"10.1007\/978-3-642-61455-2_10"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Atkey, R., Lindley, S., Morris, J.G.: Conflation confers concurrency. In: A List of Successes That Can Change the World - Essays Dedicated to Philip Wadler on the Occasion of His 60th Birthday, pp. 32\u201355 (2016)","DOI":"10.1007\/978-3-319-30936-1_2"},{"issue":"ICFP","key":"23_CR4","first-page":"37:1","volume":"1","author":"S Balzer","year":"2017","unstructured":"Balzer, S., Pfenning, F.: Manifest sharing with session types. PACMPL 1(ICFP), 37:1\u201337:29 (2017)","journal-title":"PACMPL"},{"issue":"1","key":"23_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)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR6","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"},{"issue":"2","key":"23_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0304-3975(97)00220-X","volume":"195","author":"M Boreale","year":"1998","unstructured":"Boreale, M.: On the expressiveness of internal mobility in name-passing calculi. Theor. Comput. Sci. 195(2), 205\u2013226 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"23_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":"23_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."},{"key":"23_CR10","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":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/BFb0036936","volume-title":"Automata, Languages and Programming","author":"R Nicola de","year":"1983","unstructured":"de Nicola, R., Hennessy, M.C.B.: Testing equivalences for processes. In: Diaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 548\u2013560. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/BFb0036936"},{"issue":"1","key":"23_CR12","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1006\/inco.2002.2968","volume":"179","author":"MP Fiore","year":"2002","unstructured":"Fiore, M.P., Moggi, E., Sangiorgi, D.: A fully abstract model for the $$\\pi $$ -calculus. Inf. Comput. 179(1), 76\u2013117 (2002)","journal-title":"Inf. Comput."},{"issue":"1","key":"23_CR13","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)","journal-title":"J. Funct. Program."},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J Girard","year":"1987","unstructured":"Girard, J.: Linear logic. Theor. Comput. Sci. 50, 1\u2013102 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Hasegawa, M.: From linear logic to cyclic sharing. Lecture slides, Linearity (2018)","DOI":"10.4204\/EPTCS.292.3"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(85)90062-3","volume":"41","author":"S Hayashi","year":"1985","unstructured":"Hayashi, S.: Adjunction of semifunctors: categorical structures in nonextensional lambda calculus. Theor. Comput. Sci. 41, 95\u2013104 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR17","volume-title":"Communicating Sequential Processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Upper Saddle River (1985)"},{"key":"23_CR18","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"},{"issue":"22\u201324","key":"23_CR19","doi-asserted-by":"publisher","first-page":"2223","DOI":"10.1016\/j.tcs.2010.01.028","volume":"411","author":"K Honda","year":"2010","unstructured":"Honda, K., Laurent, O.: An exact correspondence between a typed pi-calculus and polarised proof-nets. Theor. Comput. Sci. 411(22\u201324), 2223\u20132238 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR20","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":"23_CR21","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0022-4049(80)90101-2","volume":"19","author":"GM Kelly","year":"1980","unstructured":"Kelly, G.M., Laplaza, M.L.: Coherence for compact closed categories. J. Pure Appl. Algebra 19, 193\u2013213 (1980)","journal-title":"J. Pure Appl. Algebra"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/11539452_8","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"J Laird","year":"2005","unstructured":"Laird, J.: A game semantics of the asynchronous $$\\pi $$ -calculus. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 51\u201365. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11539452_8"},{"key":"23_CR23","volume-title":"Introduction to Higher-Order Categorical Logic","author":"J Lambek","year":"1988","unstructured":"Lambek, J., Scott, P.J.: Introduction to Higher-Order Categorical Logic, vol. 7. Cambridge University Press, New York (1988)"},{"issue":"2","key":"23_CR24","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/S0890-5401(03)00088-9","volume":"185","author":"PB Levy","year":"2003","unstructured":"Levy, P.B., Power, J., Thielecke, H.: Modelling environments in call-by-value programming languages. Inf. Comput. 185(2), 182\u2013210 (2003)","journal-title":"Inf. Comput."},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/978-3-662-46669-8_23","volume-title":"Programming Languages and Systems","author":"S Lindley","year":"2015","unstructured":"Lindley, S., Morris, J.G.: A semantics for propositions as sessions. In: Vitek, J. (ed.) ESOP 2015. LNCS, vol. 9032, pp. 560\u2013584. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46669-8_23"},{"issue":"7","key":"23_CR26","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1017\/S0960129516000402","volume":"28","author":"D Mazza","year":"2018","unstructured":"Mazza, D.: The true concurrency of differential interaction nets. Math. Struct. Comput. Sci. 28(7), 1097\u20131125 (2018)","journal-title":"Math. Struct. Comput. Sci."},{"key":"23_CR27","first-page":"15","volume":"27","author":"PA Melli\u00e8s","year":"2009","unstructured":"Melli\u00e8s, P.A.: Categorical semantics of linear logic. Panoramas et syntheses 27, 15\u2013215 (2009)","journal-title":"Panoramas et syntheses"},{"key":"23_CR28","unstructured":"Merro, M.: Locality in the $$\\pi $$ -calculus and applications to distributed objects. Ph.D. thesis, \u00c9cole Nationale Sup\u00e9rieure des Mines de Paris (2000)"},{"issue":"2","key":"23_CR29","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1017\/S0960129500001407","volume":"2","author":"R Milner","year":"1992","unstructured":"Milner, R.: Functions as processes. Math. Struct. Comput. Sci. 2(2), 119\u2013141 (1992)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"1","key":"23_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, I. Inf. Comput. 100(1), 1\u201340 (1992)","journal-title":"Inf. Comput."},{"issue":"1","key":"23_CR31","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0890-5401(92)90009-5","volume":"100","author":"R Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, II. Inf. Comput. 100(1), 41\u201377 (1992)","journal-title":"Inf. Comput."},{"key":"23_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/3-540-55719-9_114","volume-title":"Automata, Languages and Programming","author":"R Milner","year":"1992","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 685\u2013695. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55719-9_114"},{"key":"23_CR33","unstructured":"Moggi, E.: Computational lambda-calculus and monads. In: Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS 1989), Pacific Grove, California, USA, 5\u20138 June 1989, pp. 14\u201323 (1989)"},{"key":"23_CR34","doi-asserted-by":"crossref","unstructured":"Peyton Jones, S.L., Gordon, A.D., Finne, S.: Concurrent Haskell. In: Conference Record of POPL 1996: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Papers Presented at the Symposium, St. Petersburg Beach, Florida, USA, 21\u201324 January 1996, pp. 295\u2013308 (1996)","DOI":"10.1145\/237721.237794"},{"issue":"5","key":"23_CR35","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1017\/S096012950007002X","volume":"6","author":"BC Pierce","year":"1996","unstructured":"Pierce, B.C., Sangiorgi, D.: Typing and subtyping for mobile processes. Math. Struct. Comput. Sci. 6(5), 409\u2013453 (1996)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"5","key":"23_CR36","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1017\/S0960129597002375","volume":"7","author":"J Power","year":"1997","unstructured":"Power, J., Robinson, E.: Premonoidal categories and notions of computation. Math. Struct. Comput. Sci. 7(5), 453\u2013468 (1997)","journal-title":"Math. Struct. Comput. Sci."},{"key":"23_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/3-540-48523-6_59","volume-title":"Automata, Languages and Programming","author":"J Power","year":"1999","unstructured":"Power, J., Thielecke, H.: Closed Freyd- and $$\\kappa $$ -categories. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 625\u2013634. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48523-6_59"},{"key":"23_CR38","doi-asserted-by":"crossref","unstructured":"Reppy, J.H.: CML: a higher-order concurrent language. In: Proceedings of the ACM SIGPLAN 1991 Conference on Programming Language Design and Implementation (PLDI), Toronto, Ontario, Canada, 26\u201328 June 1991, pp. 293\u2013305 (1991)","DOI":"10.1145\/113446.113470"},{"key":"23_CR39","unstructured":"Sangiorgi, D.: Expressing mobility in process algebras: first-order and higher-order paradigms. Ph.D. thesis, University of Edinburgh, UK (1993)"},{"issue":"1&2","key":"23_CR40","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(96)00075-8","volume":"167","author":"D Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: $$\\pi $$ -Calculus, internal mobility, and agent-passing calculi. Theor. Comput. Sci. 167(1&2), 235\u2013274 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"23_CR41","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1017\/S0960129599002881","volume":"9","author":"D Sangiorgi","year":"1999","unstructured":"Sangiorgi, D.: From $$\\lambda $$ to $$\\pi $$ ; or, rediscovering continuations. Math. Struct. Comput. Sci. 9(4), 367\u2013401 (1999)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"23_CR42","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0304-3975(00)00097-9","volume":"253","author":"D Sangiorgi","year":"2001","unstructured":"Sangiorgi, D.: Asynchronous process calculi: the first- and higher-order paradigms. Theor. Comput. Sci. 253(2), 311\u2013350 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR43","volume-title":"The $$\\pi $$ -calculus\u2014A Theory of Mobile Processes","author":"D Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The $$\\pi $$ -calculus\u2014A Theory of Mobile Processes. Cambridge University Press, New York (2001)"},{"key":"23_CR44","unstructured":"Stark, I.: A fully abstract domain model for the $$\\pi $$ -calculus. In: Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, USA, 27\u201330 July 1996, pp. 36\u201342 (1996)"},{"key":"23_CR45","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":"23_CR46","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":"23_CR47","unstructured":"Turner, D.N.: The polymorphic Pi-calculus: theory and implementation. Ph.D. thesis, University of Edinburgh, UK (1996)"},{"issue":"2\u20133","key":"23_CR48","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)","journal-title":"J. Funct. Program."},{"issue":"1\u20132","key":"23_CR49","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0304-3975(00)00310-8","volume":"274","author":"N Yoshida","year":"2002","unstructured":"Yoshida, N.: Minimality and separation results on asynchronous mobile processes - representability theorems by concurrent combinators. Theor. Comput. Sci. 274(1\u20132), 231\u2013276 (2002)","journal-title":"Theor. Comput. Sci."}],"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_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,15]],"date-time":"2022-09-15T11:33:00Z","timestamp":1663241580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17184-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030171834","9783030171841"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17184-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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 (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":"86","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":"28","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":"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 (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"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 (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)"}}]}}