{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:15:14Z","timestamp":1742933714322,"version":"3.40.3"},"publisher-location":"Cham","reference-count":65,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030452308"},{"type":"electronic","value":"9783030452315"}],"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"}],"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>The glueing construction, defined as a certain comma category, is an important tool for reasoning about type theories, logics, and programming languages. Here we extend the construction to accommodate \u20182-dimensional theories\u2019 of types, terms between types, and rewrites between terms. Taking bicategories as the semantic framework for such systems, we define the glueing bicategory and establish a bicategorical version of the well-known construction of cartesian closed structure on a glueing category. As an application, we show that free finite-product bicategories are fully complete relative to free cartesian closed bicategories, thereby establishing that the higher-order equational theory of rewriting in the simply-typed lambda calculus is a conservative extension of the algebraic equational theory of rewriting in the fragment with finite products only.<\/jats:p>","DOI":"10.1007\/978-3-030-45231-5_15","type":"book-chapter","created":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T10:02:53Z","timestamp":1587117773000},"page":"277-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Relative Full Completeness for Bicategorical Cartesian Closed Structure"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8558-3492","authenticated-orcid":false,"given":"Marcelo","family":"Fiore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8320-0280","authenticated-orcid":false,"given":"Philip","family":"Saville","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,17]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Abbott, M.G.: Categories of containers. Ph.D. thesis, University of Leicester (2003)","key":"15_CR1","DOI":"10.1007\/3-540-36576-1_2"},{"doi-asserted-by":"publisher","unstructured":"Abramsky, S., Jagadeesan, R.: Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic 59(2), 543\u2013574 (1994). https:\/\/doi.org\/10.2307\/2275407","key":"15_CR2","DOI":"10.2307\/2275407"},{"doi-asserted-by":"publisher","unstructured":"Alimohamed, M.: A characterization of lambda definability in categorical models of implicit polymorphism. Theoretical Computer Science 146(1-2), 5\u201323 (1995). https:\/\/doi.org\/10.1016\/0304-3975(94)00283-O","key":"15_CR3","DOI":"10.1016\/0304-3975(94)00283-O"},{"doi-asserted-by":"crossref","unstructured":"Balat, V., Di\u00a0Cosmo, R., Fiore, M.: Extensional normalisation and typed-directed partial evaluation for typed lambda calculus with sums. In: Proceedings of the 31st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. pp. 64\u201376 (2004)","key":"15_CR4","DOI":"10.1145\/982962.964007"},{"doi-asserted-by":"crossref","unstructured":"B\u00e9nabou, J.: Introduction to bicategories. In: Reports of the Midwest Category Seminar. pp. 1\u201377. Springer Berlin Heidelberg, Berlin, Heidelberg (1967)","key":"15_CR5","DOI":"10.1007\/BFb0074299"},{"doi-asserted-by":"publisher","unstructured":"Bloom, S.L., \u00c9sik, Z., Labella, A., Manes, E.G.: Iteration 2-theories. Applied Categorical Structures 9(2), 173\u2013216 (2001). https:\/\/doi.org\/10.1023\/a:1008708924144","key":"15_CR6","DOI":"10.1023\/a:1008708924144"},{"doi-asserted-by":"publisher","unstructured":"Borceux, F.: Bicategories and distributors, Encyclopedia of Mathematics and its Applications, vol.\u00a01, pp. 281\u2013324. Cambridge University Press (1994). https:\/\/doi.org\/10.1017\/CBO9780511525858.009","key":"15_CR7","DOI":"10.1017\/CBO9780511525858.009"},{"unstructured":"Carboni, A., Kelly, G.M., Walters, R.F.C., Wood, R.J.: Cartesian bicategories II. Theory and Applications of Categories 19(6), 93\u2013124 (2008), http:\/\/www.tac.mta.ca\/tac\/volumes\/19\/6\/19-06abs.html","key":"15_CR8"},{"doi-asserted-by":"publisher","unstructured":"Carboni, A., Lack, S., Walters, R.F.C.: Introduction to extensive and distributive categories. Journal of Pure and Applied Algebra 84(2), 145\u2013158 (1993). https:\/\/doi.org\/10.1016\/0022-4049(93)90035-r","key":"15_CR9","DOI":"10.1016\/0022-4049(93)90035-r"},{"doi-asserted-by":"publisher","unstructured":"Carboni, A., Walters, R.F.C.: Cartesian bicategories I. Journal of Pure and Applied Algebra 49(1), 11\u201332 (1987). https:\/\/doi.org\/10.1016\/0022-4049(87)90121-6","key":"15_CR10","DOI":"10.1016\/0022-4049(87)90121-6"},{"unstructured":"Castellan, S., Clairambault, P., Rideau, S., Winskel, G.: Games and strategies as event structures. Logical Methods in Computer Science 13 (2017)","key":"15_CR11"},{"doi-asserted-by":"publisher","unstructured":"Crole, R.L.: Categories for Types. Cambridge University Press (1994). https:\/\/doi.org\/10.1017\/CBO9781139172707","key":"15_CR12","DOI":"10.1017\/CBO9781139172707"},{"doi-asserted-by":"publisher","unstructured":"Dagand, P.E., McBride, C.: A categorical treatment of ornaments. In: Proceedings of the 28th Annual ACM\/IEEE Symposium on Logic in Computer Science. pp. 530\u2013539. IEEE Computer Society, Washington, DC, USA (2013). https:\/\/doi.org\/10.1109\/LICS.2013.60","key":"15_CR13","DOI":"10.1109\/LICS.2013.60"},{"doi-asserted-by":"crossref","unstructured":"Fiore, M.: Axiomatic Domain Theory in Categories of Partial Maps. Distinguished Dissertations in Computer Science, Cambridge University Press (1996)","key":"15_CR14","DOI":"10.1017\/CBO9780511526565"},{"doi-asserted-by":"publisher","unstructured":"Fiore, M.: Semantic analysis of normalisation by evaluation for typed lambda calculus. In: Proceedings of the 4th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming. pp. 26\u201337. ACM, New York, NY, USA (2002). https:\/\/doi.org\/10.1145\/571157.571161","key":"15_CR15","DOI":"10.1145\/571157.571161"},{"doi-asserted-by":"publisher","unstructured":"Fiore, M., Di\u00a0Cosmo, R., Balat, V.: Remarks on isomorphisms in typed lambda calculi with empty and sum types. In: Proceedings of the 28th Annual IEEE Symposium on Logic in Computer Science. pp. 147\u2013156. IEEE Computer Society Press (2002). https:\/\/doi.org\/10.1109\/LICS.2002.1029824","key":"15_CR16","DOI":"10.1109\/LICS.2002.1029824"},{"doi-asserted-by":"publisher","unstructured":"Fiore, M., Gambino, N., Hyland, M., Winskel, G.: The cartesian closed bicategory of generalised species of structures. Journal of the London Mathematical Society 77(1), 203\u2013220 (2007). https:\/\/doi.org\/10.1112\/jlms\/jdm096","key":"15_CR17","DOI":"10.1112\/jlms\/jdm096"},{"doi-asserted-by":"crossref","unstructured":"Fiore, M., Gambino, N., Hyland, M., Winskel, G.: Relative pseudomonads, Kleisli bicategories, and substitution monoidal structures. Selecta Mathematica New Series (2017)","key":"15_CR18","DOI":"10.1007\/s00029-017-0361-3"},{"unstructured":"Fiore, M., Joyal, A.: Theory of para-toposes. Talk at the Category Theory 2015 Conference. Departamento de Matematica, Universidade de Aveiro (Portugal)","key":"15_CR19"},{"doi-asserted-by":"publisher","unstructured":"Fiore, M., Saville, P.: A type theory for cartesian closed bicategories. In: Proceedings of the 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (2019). https:\/\/doi.org\/10.1109\/LICS.2019.8785708","key":"15_CR20","DOI":"10.1109\/LICS.2019.8785708"},{"doi-asserted-by":"crossref","unstructured":"Fiore, M., Saville, P.: Coherence and normalisation-by-evaluation for bicategorical cartesian closed structure. Preprint (2020)","key":"15_CR21","DOI":"10.1145\/3373718.3394769"},{"doi-asserted-by":"crossref","unstructured":"Fiore, M., Simpson, A.: Lambda definability with sums via Grothendieck logical relations. In: Girard, J.Y. (ed.) Typed lambda calculi and applications: 4th international conference. pp. 147\u2013161. Springer Berlin Heidelberg, Berlin, Heidelberg (1999)","key":"15_CR22","DOI":"10.1007\/3-540-48959-2_12"},{"doi-asserted-by":"publisher","unstructured":"Freyd, P.: Algebraically complete categories. In: Lecture Notes in Mathematics, pp. 95\u2013104. Springer Berlin Heidelberg (1991). https:\/\/doi.org\/10.1007\/bfb0084215","key":"15_CR23","DOI":"10.1007\/bfb0084215"},{"unstructured":"Freyd, P.J., Scedrov, A.: Categories, Allegories. Elsevier North Holland (1990)","key":"15_CR24"},{"doi-asserted-by":"crossref","unstructured":"Gambino, N., Joyal, A.: On operads, bimodules and analytic functors. Memoirs of the American Mathematical Society 249(1184), 153\u2013192 (2017)","key":"15_CR25","DOI":"10.1090\/memo\/1184"},{"doi-asserted-by":"publisher","unstructured":"Gambino, N., Kock, J.: Polynomial functors and polynomial monads. Mathematical Proceedings of the Cambridge Philosophical Society 154(1), 153\u2013192 (2013). https:\/\/doi.org\/10.1017\/S0305004112000394","key":"15_CR26","DOI":"10.1017\/S0305004112000394"},{"unstructured":"Ghani, N.: Adjoint rewriting. Ph.D. thesis, University of Edinburgh (1995)","key":"15_CR27"},{"unstructured":"Gibbons, J.: Conditionals in distributive categories. Tech. rep., University of Oxford (1997)","key":"15_CR28"},{"unstructured":"G.L. Cattani, Fiore, M., Winskel, G.: A theory of recursive domains with applications to concurrency. In: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science. pp. 214\u2013225. IEEE Computer Society (1998)","key":"15_CR29"},{"unstructured":"Gurski, N.: An Algebraic Theory of Tricategories. University of Chicago, Department of Mathematics (2006)","key":"15_CR30"},{"doi-asserted-by":"crossref","unstructured":"Hasegawa, M.: Logical predicates for intuitionistic linear type theories. In: Girard, J.Y. (ed.) Typed lambda calculi and applications: 4th international conference. pp. 198\u2013213. Springer Berlin Heidelberg, Berlin, Heidelberg (1999)","key":"15_CR31","DOI":"10.1007\/3-540-48959-2_15"},{"doi-asserted-by":"publisher","unstructured":"Hilken, B.: Towards a proof theory of rewriting: the simply typed 2$$\\lambda $$-calculus. Theoretical Computer Science 170(1), 407\u2013444 (1996). https:\/\/doi.org\/10.1016\/S0304-3975(96)80713-4","key":"15_CR32","DOI":"10.1016\/S0304-3975(96)80713-4"},{"doi-asserted-by":"crossref","unstructured":"Hirschowitz, T.: Cartesian closed 2-categories and permutation equivalence in higher-order rewriting. Logical Methods in Computer Science 9, 1\u201322 (2013)","key":"15_CR33","DOI":"10.2168\/LMCS-9(3:10)2013"},{"doi-asserted-by":"publisher","unstructured":"Jay, C.B., Ghani, N.: The virtues of eta-expansion. Journal of Functional Programming 5(2), 135\u2013154 (1995). https:\/\/doi.org\/10.1017\/S0956796800001301","key":"15_CR34","DOI":"10.1017\/S0956796800001301"},{"doi-asserted-by":"publisher","unstructured":"Johann, P., Polonsky, P.: Higher-kinded data types: Syntax and semantics. In: 34th Annual ACM\/IEEE Symposium on Logic in Computer Science. IEEE (2019). https:\/\/doi.org\/10.1109\/lics.2019.8785657","key":"15_CR35","DOI":"10.1109\/lics.2019.8785657"},{"doi-asserted-by":"crossref","unstructured":"Jung, A., Tiuryn, J.: A new characterization of lambda definability. In: Bezem, M., Groote, J.F. (eds.) Typed Lambda Calculi and Applications. pp. 245\u2013257. Springer Berlin Heidelberg, Berlin, Heidelberg (1993)","key":"15_CR36","DOI":"10.1007\/BFb0037110"},{"doi-asserted-by":"crossref","unstructured":"Lack, S.: A 2-Categories Companion, pp. 105\u2013191. Springer New York, New York, NY (2010)","key":"15_CR37","DOI":"10.1007\/978-1-4419-1524-5_4"},{"unstructured":"Lack, S., Walters, R.F.C., Wood, R.J.: Bicategories of spans as cartesian bicategories. Theory and Applications of Categories 24(1), 1\u201324(2010)","key":"15_CR38"},{"unstructured":"Lafont, Y.: Logiques, cat\u00e9gories et machines. Ph.D. thesis, Universit\u00e9Paris VII (1987)","key":"15_CR39"},{"unstructured":"Lambek, J., Scott, P.J.: Introduction to Higher Order Categorical Logic. Cambridge University Press, New York, NY, USA (1986)","key":"15_CR40"},{"unstructured":"Leinster, T.: Basic bicategories (May 1998), https:\/\/arxiv.org\/pdf\/math\/9810017.pdf","key":"15_CR41"},{"doi-asserted-by":"crossref","unstructured":"Leinster, T.: Higher operads, higher categories. No.\u00a0298 in London Mathematical Society Lecture Note Series, Cambridge University Press (2004)","key":"15_CR42","DOI":"10.1017\/CBO9780511525896"},{"doi-asserted-by":"crossref","unstructured":"Ma, Q.M., Reynolds, J.C.: Types, abstraction, and parametric polymorphism, part 2. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds.) Mathematical Foundations of Programming Semantics. pp. 1\u201340. Springer Berlin Heidelberg, Berlin, Heidelberg (1992)","key":"15_CR43","DOI":"10.1007\/3-540-55511-0_1"},{"doi-asserted-by":"publisher","unstructured":"Mac Lane, S.: Categories for the Working Mathematician, Graduate Texts in Mathematics, vol.\u00a05. Springer-Verlag New York, second edn. (1998). https:\/\/doi.org\/10.1007\/978-1-4757-4721-8","key":"15_CR44","DOI":"10.1007\/978-1-4757-4721-8"},{"doi-asserted-by":"publisher","unstructured":"Mac Lane, S., Par\u00e9, R.: Coherence for bicategories and indexed categories. Journal of Pure and Applied Algebra 37, 59\u201380 (1985). https:\/\/doi.org\/10.1016\/0022-4049(85)90087-8","key":"15_CR45","DOI":"10.1016\/0022-4049(85)90087-8"},{"unstructured":"Marmolejo, F., Wood, R.J.: Kan extensions and lax idempotent pseudomonads. Theory and Applications of Categories 26(1), 1\u201329 (2012)","key":"15_CR46"},{"doi-asserted-by":"crossref","unstructured":"Mitchell, J.C., Scedrov, A.: Notes on sconing and relators. In: B\u00f6rger, E.,J., G., Kleine\u00a0B\u00fcning, H., Martini, S., Richter, M.M. (eds.) Computer Science Logic. pp. 352\u2013378. Springer Berlin Heidelberg, Berlin, Heidelberg (1993)","key":"15_CR47","DOI":"10.1007\/3-540-56992-8_21"},{"unstructured":"Ouaknine, J.: A two-dimensional extension of Lambek\u2019s categorical proof theory. Master\u2019s thesis, McGill University (1997)","key":"15_CR48"},{"unstructured":"Paquet, H.: Probabilistic concurrent game semantics. Ph.D. thesis, University of Cambridge (2020)","key":"15_CR49"},{"unstructured":"Plotkin, G.D.: Lambda-definability and logical relations. Tech. rep., University of Edinburgh School of Artificial Intelligence (1973), memorandum SAI-RM-4","key":"15_CR50"},{"unstructured":"Power, A.J.: An abstract formulation for rewrite systems. In: Pitt, D.H., Rydeheard, D.E., Dybjer, P., Pitts, A.M., Poign\u00e9, A. (eds.) Category Theory and Computer Science. pp. 300\u2013312. Springer Berlin Heidelberg, Berlin, Heidelberg (1989)","key":"15_CR51"},{"doi-asserted-by":"crossref","unstructured":"Power, A.J.: Coherence for bicategories with finite bilimits I. In: Gray, J.W., Scedrov, A. (eds.) Categories in Computer Science and Logic: Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference, vol.\u00a092, pp. 341\u2013349. AMS (1989)","key":"15_CR52","DOI":"10.1090\/conm\/092\/1003207"},{"doi-asserted-by":"publisher","unstructured":"Power, A.J.: A general coherence result. Journal of Pure and Applied Algebra 57(2), 165\u2013173 (1989). https:\/\/doi.org\/10.1016\/0022-4049(89)90113-8","key":"15_CR53","DOI":"10.1016\/0022-4049(89)90113-8"},{"doi-asserted-by":"crossref","unstructured":"Rydeheard, D.E., Stell, J.G.: Foundations of equational deduction: A categorical treatment of equational proofs and unification algorithms. In: Pitt, D.H., Poign\u00e9, A., Rydeheard, D.E. (eds.) Category Theory and Computer Science. pp. 114\u2013139. Springer Berlin Heidelberg, Berlin, Heidelberg (1987)","key":"15_CR54","DOI":"10.1007\/3-540-18508-9_23"},{"unstructured":"Saville, P.: Cartesian closed bicategories: type theory and coherence. Ph.D. thesis, University of Cambridge (Submitted)","key":"15_CR55"},{"unstructured":"Seely, R.A.G.: Modelling computations: A 2-categorical framework. In: Gries, D.(ed.) Proceedings of the 2nd Annual IEEE Symposium on Logic in Computer Science. pp. 65\u201371. IEEE Computer Society Press (June 1987)","key":"15_CR56"},{"doi-asserted-by":"crossref","unstructured":"Statman, R.: Logical relations and the typed $$\\lambda $$-calculus. Information and Control 65, 85\u201397 (1985)","key":"15_CR57","DOI":"10.1016\/S0019-9958(85)80001-2"},{"unstructured":"Stell, J.: Modelling term rewriting systems by sesqui-categories. In: Proc. Cat\u00e9gories, Alg\u00e8bres, Esquisses et N\u00e9o-Esquisses (1994)","key":"15_CR58"},{"unstructured":"Street, R.: Fibrations in bicategories. Cahiers de Topologie et G\u00e9om\u00e9trie Diff\u00e9rentielle Cat\u00e9goriques 21(2), 111\u2013160 (1980), https:\/\/eudml.org\/doc\/91227","key":"15_CR59"},{"doi-asserted-by":"crossref","unstructured":"Street, R.: Categorical structures. In: Hazewinkel, M. (ed.) Handbook of Algebra, vol.\u00a01, chap.\u00a015, pp. 529\u2013577. Elsevier (1995)","key":"15_CR60","DOI":"10.1016\/S1570-7954(96)80019-2"},{"doi-asserted-by":"publisher","unstructured":"Tabareau, N.: Aspect oriented programming: A language for 2-categories. In: Proceedings of the 10th International Workshop on Foundations of Aspect-oriented Languages. pp. 13\u201317. ACM, New York, NY, USA (2011).https:\/\/doi.org\/10.1145\/1960510.1960514","key":"15_CR61","DOI":"10.1145\/1960510.1960514"},{"unstructured":"Taylor, P.: Practical Foundations of Mathematics, Cambridge Studies in Advanced Mathematics, vol.\u00a059. Cambridge University Press (1999)","key":"15_CR62"},{"doi-asserted-by":"crossref","unstructured":"Troelstra, A.S., Schwichtenberg, H.: Basic proof theory. No.\u00a043 in Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, second edn. (2000)","key":"15_CR63","DOI":"10.1017\/CBO9781139168717"},{"unstructured":"Verity, D.: Enriched categories, internal categories and change of base. Ph.D. thesis, University of Cambridge (1992), TAC reprint available at http:\/\/www.tac.mta.ca\/tac\/reprints\/articles\/20\/tr20abs.html","key":"15_CR64"},{"doi-asserted-by":"publisher","unstructured":"Weber, M.: Yoneda structures from 2-toposes. Applied Categorical Structures 15(3), 259\u2013323 (2007). https:\/\/doi.org\/10.1007\/s10485-007-9079-2","key":"15_CR65","DOI":"10.1007\/s10485-007-9079-2"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45231-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T15:49:25Z","timestamp":1666367365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45231-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030452308","9783030452315"],"references-count":65,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45231-5_15","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":"17 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","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":"25 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":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2020\/fossacs","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":"98","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":"31","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":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"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)"}}]}}