{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:03:27Z","timestamp":1743026607684,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030449131"},{"type":"electronic","value":"9783030449148"}],"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>Bernardy et al. [2018] proposed a linear type system <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\lambda ^q_\\rightarrow $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msubsup>\n                    <mml:mi>\u03bb<\/mml:mi>\n                    <mml:mo>\u2192<\/mml:mo>\n                    <mml:mi>q<\/mml:mi>\n                  <\/mml:msubsup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> as a core type system of Linear Haskell. In the system, linearity is represented by annotated arrow types <jats:inline-formula><jats:alternatives><jats:tex-math>$$A \\rightarrow _m B$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>A<\/mml:mi>\n                    <mml:msub>\n                      <mml:mo>\u2192<\/mml:mo>\n                      <mml:mi>m<\/mml:mi>\n                    <\/mml:msub>\n                    <mml:mi>B<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, where <jats:italic>m<\/jats:italic> denotes the multiplicity of the argument. Thanks to this representation, existing non-linear code typechecks as it is, and newly written linear code can be used with existing non-linear code in many cases. However, little is known about the type inference of <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\lambda ^q_\\rightarrow $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msubsup>\n                    <mml:mi>\u03bb<\/mml:mi>\n                    <mml:mo>\u2192<\/mml:mo>\n                    <mml:mi>q<\/mml:mi>\n                  <\/mml:msubsup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. Although the Linear Haskell implementation is equipped with type inference, its algorithm has not been formalized, and the implementation often fails to infer principal types, especially for higher-order functions. In this paper, based on <jats:sc>OutsideIn(X)<\/jats:sc> [Vytiniotis et al., 2011], we propose an inference system for a rank 1 qualified-typed variant of <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\lambda ^q_\\rightarrow $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msubsup>\n                    <mml:mi>\u03bb<\/mml:mi>\n                    <mml:mo>\u2192<\/mml:mo>\n                    <mml:mi>q<\/mml:mi>\n                  <\/mml:msubsup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, which infers principal types. A technical challenge in this new setting is to deal with ambiguous types inferred by naive qualified typing. We address this ambiguity issue through quantifier elimination and demonstrate the effectiveness of the approach with examples.<\/jats:p>","DOI":"10.1007\/978-3-030-44914-8_17","type":"book-chapter","created":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T10:02:53Z","timestamp":1587117773000},"page":"456-483","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Modular Inference of Linear Types for Multiplicity-Annotated Arrows"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9747-4899","authenticated-orcid":false,"given":"Kazutaka","family":"Matsuda","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,18]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Aehlig, K., Berger, U., Hofmann, M., Schwichtenberg, H.: An arithmetic for non-size-increasing polynomial-time computation. Theor. Comput. Sci. 318(1-2), 3\u201327 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2003.10.023","key":"17_CR1","DOI":"10.1016\/j.tcs.2003.10.023"},{"doi-asserted-by":"publisher","unstructured":"Altenkirch, T., Grattage, J.: A functional quantum programming language. In: 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 26-29 June 2005, Chicago, IL, USA, Proceedings. pp. 249\u2013258. IEEE Computer Society (2005). https:\/\/doi.org\/10.1109\/LICS.2005.1","key":"17_CR2","DOI":"10.1109\/LICS.2005.1"},{"doi-asserted-by":"publisher","unstructured":"Baillot, P., Hofmann, M.: Type inference in intuitionistic linear logic. In: Kutsia, T., Schreiner, W., Fern\u00e1ndez, M. (eds.) Proceedings of the 12th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 26-28, 2010, Hagenberg, Austria. pp. 219\u2013230. ACM (2010). https:\/\/doi.org\/10.1145\/1836089.1836118","key":"17_CR3","DOI":"10.1145\/1836089.1836118"},{"doi-asserted-by":"publisher","unstructured":"Baillot, P., Terui, K.: A feasible algorithm for typing in elementary affine logic. In: Urzyczyn, P. (ed.) Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005, Proceedings. Lecture Notes in Computer Science, vol. 3461, pp. 55\u201370. Springer (2005). https:\/\/doi.org\/10.1007\/11417170_6","key":"17_CR4","DOI":"10.1007\/11417170_6"},{"doi-asserted-by":"publisher","unstructured":"Baillot, P., Terui, K.: Light types for polynomial time computation in lambda calculus. Inf. Comput. 207(1), 41\u201362 (2009). https:\/\/doi.org\/10.1016\/j.ic.2008.08.005","key":"17_CR5","DOI":"10.1016\/j.ic.2008.08.005"},{"unstructured":"Bernardy, J.P., Boespflug, M., Newton, R., Jones, S.P., Spiwack, A.: Linear mini-core. GHC Developpers Wiki, https:\/\/gitlab.haskell.org\/ghc\/ghc\/wikis\/uploads\/ceaedb9ec409555c80ae5a97cc47470e\/minicore.pdf, visited Oct. 14, 2019","key":"17_CR6"},{"doi-asserted-by":"publisher","unstructured":"Bernardy, J., Boespflug, M., Newton, R.R., Peyton Jones, S., Spiwack, A.: Linear haskell: practical linearity in a higher-order polymorphic language. PACMPL 2(POPL), 5:1\u20135:29 (2018). https:\/\/doi.org\/10.1145\/3158093","key":"17_CR7","DOI":"10.1145\/3158093"},{"doi-asserted-by":"publisher","unstructured":"Davis, M., Logemann, G., Loveland, D.W.: A machine program for theorem-proving. Commun. ACM 5(7), 394\u2013397 (1962). https:\/\/doi.org\/10.1145\/368273.368557","key":"17_CR8","DOI":"10.1145\/368273.368557"},{"doi-asserted-by":"publisher","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7(3), 201\u2013215 (1960). https:\/\/doi.org\/10.1145\/321033.321034","key":"17_CR9","DOI":"10.1145\/321033.321034"},{"doi-asserted-by":"publisher","unstructured":"Dowling, W.F., Gallier, J.H.: Linear-time algorithms for testing the satisfiability of propositional horn formulae. J. Log. Program. 1(3), 267\u2013284 (1984). https:\/\/doi.org\/10.1016\/0743-1066(84)90014-1","key":"17_CR10","DOI":"10.1016\/0743-1066(84)90014-1"},{"doi-asserted-by":"publisher","unstructured":"Gan, E., Tov, J.A., Morrisett, G.: Type classes for lightweight substructural types. In: Alves, S., Cervesato, I. (eds.) Proceedings Third International Workshop on Linearity, LINEARITY 2014, Vienna, Austria, 13th July, 2014. EPTCS, vol. 176, pp. 34\u201348 (2014). https:\/\/doi.org\/10.4204\/EPTCS.176.4","key":"17_CR11","DOI":"10.4204\/EPTCS.176.4"},{"doi-asserted-by":"publisher","unstructured":"Ghica, D.R., Smith, A.I.: Bounded linear types in a resource semiring. In: Shao, Z. (ed.) Programming Languages and Systems - 23rd European Symposium on Programming, ESOP 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings. Lecture Notes in Computer Science, vol. 8410, pp. 331\u2013350. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-642-54833-8_18","key":"17_CR12","DOI":"10.1007\/978-3-642-54833-8_18"},{"doi-asserted-by":"publisher","unstructured":"Girard, J., Scedrov, A., Scott, P.J.: Bounded linear logic: A modular approach to polynomial-time computability. Theor. Comput. Sci. 97(1), 1\u201366 (1992). https:\/\/doi.org\/10.1016\/0304-3975(92)90386-T","key":"17_CR13","DOI":"10.1016\/0304-3975(92)90386-T"},{"doi-asserted-by":"publisher","unstructured":"Igarashi, A., Kobayashi, N.: Type reconstruction for linear -calculus with I\/O subtyping. Inf. Comput. 161(1), 1\u201344 (2000). https:\/\/doi.org\/10.1006\/inco.2000.2872","key":"17_CR14","DOI":"10.1006\/inco.2000.2872"},{"doi-asserted-by":"crossref","unstructured":"Jones, M.P.: Qualified Types: Theory and Practice. Cambridge University Press, New York, NY, USA (1995)","key":"17_CR15","DOI":"10.1017\/CBO9780511663086"},{"doi-asserted-by":"publisher","unstructured":"Jones, M.P.: Simplifying and improving qualified types. In: Williams, J. (ed.) Proceedings of the seventh international conference on Functional programming languages and computer architecture, FPCA 1995, La Jolla, California, USA, June 25-28, 1995. pp. 160\u2013169. ACM (1995). https:\/\/doi.org\/10.1145\/224164.224198","key":"17_CR16","DOI":"10.1145\/224164.224198"},{"doi-asserted-by":"publisher","unstructured":"Lindley, S., Morris, J.G.: A semantics for propositions as sessions. In: Vitek, J. (ed.) Programming Languages and Systems - 24th European Symposium on Programming, ESOP 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015. Proceedings. Lecture Notes in Computer Science, vol. 9032, pp. 560\u2013584. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-662-46669-8_23","key":"17_CR17","DOI":"10.1007\/978-3-662-46669-8_23"},{"doi-asserted-by":"publisher","unstructured":"Lindley, S., Morris, J.G.: Embedding session types in haskell. In: Mainland, G. (ed.) Proceedings of the 9th International Symposium on Haskell, Haskell 2016, Nara, Japan, September 22-23, 2016. pp. 133\u2013145. ACM (2016). https:\/\/doi.org\/10.1145\/2976002.2976018","key":"17_CR18","DOI":"10.1145\/2976002.2976018"},{"unstructured":"Lutz, C.: Janus: a time-reversible language. Letter to R. Landauer. (1986), available on: http:\/\/tetsuo.jp\/ref\/janus.pdf","key":"17_CR19"},{"unstructured":"Matsuda, K.: Modular inference of linear types for multiplicity-annotated arrows (2020), http:\/\/arxiv.org\/abs\/1911.00268v2","key":"17_CR20"},{"doi-asserted-by":"crossref","unstructured":"Mazurak, K., Zhao, J., Zdancewic, S.: Lightweight linear types in system fdegree. In: TLDI. pp. 77\u201388. ACM (2010)","key":"17_CR21","DOI":"10.1145\/1708016.1708027"},{"doi-asserted-by":"publisher","unstructured":"McBride, C.: I got plenty o\u2019 nuttin\u2019. In: Lindley, S., McBride, C., Trinder, P.W., Sannella, D. (eds.) A List of Successes That Can Change the World - Essays Dedicated to Philip Wadler on the Occasion of His 60th Birthday. Lecture Notes in Computer Science, vol. 9600, pp. 207\u2013233. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-30936-1_12","key":"17_CR22","DOI":"10.1007\/978-3-319-30936-1_12"},{"doi-asserted-by":"publisher","unstructured":"Mogensen, T.\u00c6.: Types for 0, 1 or many uses. In: Clack, C., Hammond, K., Davie, A.J.T. (eds.) Implementation of Functional Languages, 9th International Workshop, IFL\u201997, St. Andrews, Scotland, UK, September 10-12, 1997, Selected Papers. Lecture Notes in Computer Science, vol. 1467, pp. 112\u2013122. Springer (1997). https:\/\/doi.org\/10.1007\/BFb0055427","key":"17_CR23","DOI":"10.1007\/BFb0055427"},{"doi-asserted-by":"publisher","unstructured":"Morris, J.G.: The best of both worlds: linear functional programming without compromise. In: Garrigue, J., Keller, G., Sumii, E. (eds.) Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, ICFP 2016, Nara, Japan, September 18-22, 2016. pp. 448\u2013461. ACM (2016). https:\/\/doi.org\/10.1145\/2951913.2951925","key":"17_CR24","DOI":"10.1145\/2951913.2951925"},{"doi-asserted-by":"publisher","unstructured":"Selinger, P., Valiron, B.: A lambda calculus for quantum computation with classical control. Mathematical Structures in Computer Science 16(3), 527\u2013552 (2006). https:\/\/doi.org\/10.1017\/S0960129506005238","key":"17_CR25","DOI":"10.1017\/S0960129506005238"},{"unstructured":"Spiwack, A., Dom\u00ednguez, F., Boespflug, M., Bernardy, J.P.: Linear types. GHC Proposals, https:\/\/github.com\/tweag\/ghc-proposals\/blob\/linear-types2\/proposals\/0000-linear-types.rst, visited Sep. 11, 2019","key":"17_CR26"},{"doi-asserted-by":"publisher","unstructured":"Stuckey, P.J., Sulzmann, M.: A theory of overloading. ACM Trans. Program. Lang. Syst. 27(6), 1216\u20131269 (2005). https:\/\/doi.org\/10.1145\/1108970.1108974","key":"17_CR27","DOI":"10.1145\/1108970.1108974"},{"doi-asserted-by":"publisher","unstructured":"Tov, J.A., Pucella, R.: Practical affine types. In: Ball, T., Sagiv, M. (eds.) Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, January 26-28, 2011. pp. 447\u2013458. ACM (2011). https:\/\/doi.org\/10.1145\/1926385.1926436","key":"17_CR28","DOI":"10.1145\/1926385.1926436"},{"doi-asserted-by":"publisher","unstructured":"Turner, D.N., Wadler, P., Mossin, C.: Once upon a type. In: Williams, J. (ed.) Proceedings of the seventh international conference on Functional programming languages and computer architecture, FPCA 1995, La Jolla, California, USA, June 25-28, 1995. pp. 1\u201311. ACM (1995). https:\/\/doi.org\/10.1145\/224164.224168","key":"17_CR29","DOI":"10.1145\/224164.224168"},{"doi-asserted-by":"publisher","unstructured":"Vytiniotis, D., Peyton Jones, S.L., Schrijvers, T.: Let should not be generalized. In: Kennedy, A., Benton, N. (eds.) Proceedings of TLDI 2010: 2010 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, Madrid, Spain, January 23, 2010. pp. 39\u201350. ACM (2010). https:\/\/doi.org\/10.1145\/1708016.1708023","key":"17_CR30","DOI":"10.1145\/1708016.1708023"},{"doi-asserted-by":"publisher","unstructured":"Vytiniotis, D., Peyton Jones, S.L., Schrijvers, T., Sulzmann, M.: Outsidein(x) modular type inference with local assumptions. J. Funct. Program. 21(4-5), 333\u2013412 (2011). https:\/\/doi.org\/10.1017\/S0956796811000098","key":"17_CR31","DOI":"10.1017\/S0956796811000098"},{"unstructured":"Wadler, P.: Linear types can change the world! In: Broy, M. (ed.) Programming concepts and methods: Proceedings of the IFIP Working Group 2.2, 2.3 Working Conference on Programming Concepts and Methods, Sea of Galilee, Israel, 2-5 April, 1990. p. 561. North-Holland (1990)","key":"17_CR32"},{"doi-asserted-by":"publisher","unstructured":"Wadler, P.: A taste of linear logic. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) Mathematical Foundations of Computer Science 1993, 18th International Symposium, MFCS\u201993, Gdansk, Poland, August 30 - September 3, 1993, Proceedings. Lecture Notes in Computer Science, vol. 711, pp. 185\u2013210. Springer (1993). https:\/\/doi.org\/10.1007\/3-540-57182-5_12","key":"17_CR33","DOI":"10.1007\/3-540-57182-5_12"},{"doi-asserted-by":"publisher","unstructured":"Wansbrough, K., Peyton Jones, S.L.: Once upon a polymorphic type. In: Appel, A.W., Aiken, A. (eds.) POPL \u201999, Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Antonio, TX, USA, January 20-22, 1999. pp. 15\u201328. ACM (1999). https:\/\/doi.org\/10.1145\/292540.292545","key":"17_CR34","DOI":"10.1145\/292540.292545"},{"doi-asserted-by":"publisher","unstructured":"Yokoyama, T., Axelsen, H.B., Gl\u00fcck, R.: Towards a reversible functional language. In: Vos, A.D., Wille, R. (eds.) RC. Lecture Notes in Computer Science, vol. 7165, pp. 14\u201329. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-29517-1_2","key":"17_CR35","DOI":"10.1007\/978-3-642-29517-1_2"}],"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_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T17:11:17Z","timestamp":1656609077000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-44914-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030449131","9783030449148"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-44914-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}