{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T22:56:30Z","timestamp":1776552990060,"version":"3.51.2"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031169113","type":"print"},{"value":"9783031169120","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16912-0_9","type":"book-chapter","created":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T07:04:02Z","timestamp":1663743842000},"page":"222-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Fantastic Morphisms and\u00a0Where to\u00a0Find Them"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5573-3357","authenticated-orcid":false,"given":"Zhixuan","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4161-985X","authenticated-orcid":false,"given":"Nicolas","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,22]]},"reference":[{"issue":"1\u20132","key":"9_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.10.017","volume":"333","author":"A Abel","year":"2005","unstructured":"Abel, A., Matthes, R., Uustalu, T.: Iteration and coiteration schemes for higher-order and nested datatypes. Theoret. Comput. Sci. 333(1\u20132), 3\u201366 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2004.10.017","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000, pp. 39\u201348, September 2000. https:\/\/doi.org\/10.1109\/SPIRE.2000.878178","DOI":"10.1109\/SPIRE.2000.878178"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Bird, R.: Pearls of Functional Algorithm Design. Cambridge University Press, Cambridge (2010)","DOI":"10.1017\/CBO9780511763199"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Bird, R., de Moor, O.: Algebra of Programming, London (1997)","DOI":"10.1007\/978-3-642-61455-2_12"},{"key":"9_CR5","unstructured":"Bird, R., Gibbons, J.: Algorithm Design with Haskell. Cambridge University Press, Cambridge (2020). http:\/\/www.cs.ox.ac.uk\/publications\/books\/adwh\/"},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/s001650050047","volume":"11","author":"R Bird","year":"1999","unstructured":"Bird, R., Paterson, R.: Generalised folds for nested datatypes. Formal Aspects Comput. 11(2), 200\u2013222 (1999). https:\/\/doi.org\/10.1007\/s001650050047","journal-title":"Formal Aspects Comput."},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0054285","volume-title":"Mathematics of Program Construction","author":"R Bird","year":"1998","unstructured":"Bird, R., Meertens, L.: Nested datatypes. In: Jeuring, J. (ed.) MPC 1998. LNCS, vol. 1422, pp. 52\u201367. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054285"},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1017\/S0956796899003366","volume":"9","author":"RS Bird","year":"1999","unstructured":"Bird, R.S., Paterson, R.: de Bruijn notation as a nested datatype. J. Funct. Program. 9(1), 77\u201391 (1999). https:\/\/doi.org\/10.1017\/S0956796899003366","journal-title":"J. Funct. Program."},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.ic.2005.08.005","volume":"204","author":"V Capretta","year":"2006","unstructured":"Capretta, V., Uustalu, T., Vene, V.: Recursive coalgebras from comonads. Inf. Comput. 204(4), 437\u2013468 (2006). https:\/\/doi.org\/10.1016\/j.ic.2005.08.005","journal-title":"Inf. Comput."},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Coutts, D., Leshchinskiy, R., Stewart, D.: Stream fusion: from lists to streams to nothing at all. In: Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming. ICFP 2007, pp. 315\u2013326. Association for Computing Machinery, New York (2007). https:\/\/doi.org\/10.1145\/1291151.1291199","DOI":"10.1145\/1291151.1291199"},{"key":"9_CR11","unstructured":"Felleisen, M., Findler, R.B., Flatt, M., Krishnamurthi, S.: How to Design Programs: An Introduction to Programming and Computing. The MIT Press, Cambridge (2018)"},{"key":"9_CR12","unstructured":"Fokkinga, M.: Law and order in algorithmics. Ph.D. thesis, University of Twente, 7500 AE Enschede, Netherlands, February 1992"},{"key":"9_CR13","unstructured":"Fokkinga, M.: Monadic maps and folds for arbitrary datatypes. Memoranda Informatica 94\u201328, Department of Computer Science, University of Twente, June 1994. http:\/\/doc.utwente.nl\/66622\/"},{"issue":"4","key":"9_CR14","first-page":"81","volume":"1","author":"MM Fokkinga","year":"1990","unstructured":"Fokkinga, M.M.: Tupling and mutumorphisms. Squiggolist 1(4), 81\u201382 (1990)","journal-title":"Squiggolist"},{"issue":"1\u20133","key":"9_CR15","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0167-6423(99)00022-2","volume":"37","author":"J Gibbons","year":"2000","unstructured":"Gibbons, J.: Generic downwards accumulations. Sci. Comput. Program. 37(1\u20133), 37\u201365 (2000). https:\/\/doi.org\/10.1016\/S0167-6423(99)00022-2","journal-title":"Sci. Comput. Program."},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.scico.2006.01.006","volume":"65","author":"J Gibbons","year":"2007","unstructured":"Gibbons, J.: Metamorphisms: streaming representation-changers. Sci. Comput. Program. 65(2), 108\u2013139 (2007). https:\/\/doi.org\/10.1016\/j.scico.2006.01.006","journal-title":"Sci. Comput. Program."},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-030-33636-3_16","volume-title":"Mathematics of Program Construction","author":"J Gibbons","year":"2019","unstructured":"Gibbons, J.: Coding with asymmetric numeral systems. In: Hutton, G. (ed.) MPC 2019. LNCS, vol. 11825, pp. 444\u2013465. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-33636-3_16"},{"key":"9_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796821000113","volume":"31","author":"J Gibbons","year":"2021","unstructured":"Gibbons, J.: How to design co-programs. J. Funct. Program. 31, e15 (2021). https:\/\/doi.org\/10.1017\/S0956796821000113","journal-title":"J. Funct. Program."},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Gibbons, J., Wu, N.: Folding domain-specific languages: deep and shallow embeddings (functional pearl). In: Proceedings of the 19th ACM SIGPLAN International Conference on Functional Programming, Gothenburg, Sweden, 1\u20133 September 2014, pp. 339\u2013347. ACM (2014). https:\/\/doi.org\/10.1145\/2628136.2628138","DOI":"10.1145\/2628136.2628138"},{"key":"9_CR20","unstructured":"Hagino, T.: Category theoretic approach to data types. Ph.D. thesis, University of Edinburgh (1987)"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Hinze, R.: Fun with phantom types. The fun of programming, pp. 245\u2013262 (2003)","DOI":"10.1007\/978-1-349-91518-7_12"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-642-32202-0_2","volume-title":"Generic and Indexed Programming","author":"R Hinze","year":"2012","unstructured":"Hinze, R.: Generic programming with adjunctions. In: Gibbons, J. (ed.) Generic and Indexed Programming. LNCS, vol. 7470, pp. 47\u2013129. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32202-0_2"},{"issue":"11","key":"9_CR23","doi-asserted-by":"publisher","first-page":"2108","DOI":"10.1016\/j.scico.2012.07.011","volume":"78","author":"R Hinze","year":"2013","unstructured":"Hinze, R.: Adjoint folds and unfolds\u2013an extended study. Sci. Comput. Program. 78(11), 2108\u20132159 (2013). https:\/\/doi.org\/10.1016\/j.scico.2012.07.011","journal-title":"Sci. Comput. Program."},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Hinze, R., James, D.W.H., Harper, T., Wu, N., Magalh\u00e3es, J.P.: Sorting with bialgebras and distributive laws. In: L\u00f6h, A., Garcia, R. (eds.) Proceedings of the 8th ACM SIGPLAN workshop on Generic programming, WGP@ICFP 2012, Copenhagen, Denmark, 9\u201315 September 2012, pp. 69\u201380. ACM (2012). https:\/\/doi.org\/10.1145\/2364394.2364405","DOI":"10.1145\/2364394.2364405"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-642-40355-2_11","volume-title":"The Beauty of Functional Code","author":"R Hinze","year":"2013","unstructured":"Hinze, R., Magalh\u00e3es, J.P., Wu, N.: A duality of sorts. In: Achten, P., Koopman, P. (eds.) The Beauty of Functional Code. LNCS, vol. 8106, pp. 151\u2013167. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40355-2_11"},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Hinze, R., Wu, N.: Histo- and dynamorphisms revisited. In: Proceedings of the 9th ACM SIGPLAN Workshop on Generic Programming. WGP 2013, New York, NY, USA, pp. 1\u201312 (2013). https:\/\/doi.org\/10.1145\/2502488.2502496","DOI":"10.1145\/2502488.2502496"},{"key":"9_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796815000258","volume":"26","author":"R Hinze","year":"2016","unstructured":"Hinze, R., Wu, N.: Unifying structured recursion schemes: an extended study. J. Funct. Program. 26, e1 (2016). https:\/\/doi.org\/10.1017\/S0956796815000258","journal-title":"J. Funct. Program."},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Hinze, R., Wu, N., Gibbons, J.: Unifying structured recursion schemes. In: Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming, ICFP 2013. New York, NY, USA, pp. 209\u2013220 (2013). https:\/\/doi.org\/10.1145\/2500365.2500578","DOI":"10.1145\/2500365.2500578"},{"key":"9_CR29","doi-asserted-by":"publisher","unstructured":"Hinze, R., Wu, N., Gibbons, J.: Conjugate hylomorphisms - or: the mother of all structured recursion schemes. In: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, pp. 527\u2013538. ACM, New York (2015). https:\/\/doi.org\/10.1145\/2676726.2676989","DOI":"10.1145\/2676726.2676989"},{"key":"9_CR30","unstructured":"Hoare, C.A.R.: Chapter II: Notes on Data Structuring, pp. 83\u2013174. Academic Press Ltd., GBR (1972)"},{"issue":"2","key":"9_CR31","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF03037434","volume":"17","author":"Z Hu","year":"1999","unstructured":"Hu, Z., Iwasaki, H., Takeichi, M.: Calculating accumulations. N. Gener. Comput. 17(2), 153\u2013173 (1999)","journal-title":"N. Gener. Comput."},{"key":"9_CR32","doi-asserted-by":"publisher","unstructured":"Hu, Z., Iwasaki, H., Takeichi, M.: Deriving structural hylomorphisms from recursive definitions. ACM SIGPLAN Not. 31 (1999). https:\/\/doi.org\/10.1145\/232629.232637","DOI":"10.1145\/232629.232637"},{"key":"9_CR33","doi-asserted-by":"publisher","unstructured":"Hutton, G.: Fold and unfold for program semantics. In: Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming. ICFP 1998, pp. 280\u2013288. Association for Computing Machinery, New York (1998). https:\/\/doi.org\/10.1145\/289423.289457","DOI":"10.1145\/289423.289457"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-73228-0_16","volume-title":"Typed Lambda Calculi and Applications","author":"P Johann","year":"2007","unstructured":"Johann, P., Ghani, N.: Initial algebra semantics is enough! In: Della Rocca, S.R. (ed.) TLCA 2007. LNCS, vol. 4583, pp. 207\u2013222. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73228-0_16"},{"issue":"1","key":"9_CR35","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1145\/1328897.1328475","volume":"43","author":"P Johann","year":"2008","unstructured":"Johann, P., Ghani, N.: Foundations for structured programming with GADTs. SIGPLAN Not. 43(1), 297\u2013308 (2008). https:\/\/doi.org\/10.1145\/1328897.1328475","journal-title":"SIGPLAN Not."},{"issue":"2","key":"9_CR36","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10990-009-9047-7","volume":"22","author":"P Johann","year":"2009","unstructured":"Johann, P., Ghani, N.: A principled approach to programming with nested types in Haskell. High.-Order Symb. Comput. 22(2), 155\u2013189 (2009). https:\/\/doi.org\/10.1007\/s10990-009-9047-7","journal-title":"High.-Order Symb. Comput."},{"key":"9_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/11783596_15","volume-title":"Mathematics of Program Construction","author":"J Kabanov","year":"2006","unstructured":"Kabanov, J., Vene, V.: Recursion schemes for dynamic programming. In: Uustalu, T. (ed.) MPC 2006. LNCS, vol. 4014, pp. 235\u2013252. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11783596_15"},{"key":"9_CR38","unstructured":"Kmett, E.: Time for chronomorphisms. http:\/\/comonad.com\/reader\/2008\/time-for-chronomorphisms\/ (2008), accessed: 2020-06-15"},{"key":"9_CR39","unstructured":"Kmett, E.: Recursion-schemes: representing common recursion patterns as higher-order functions (2011). https:\/\/hackage.haskell.org\/package\/recursion-schemes"},{"key":"9_CR40","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF01110627","volume":"103","author":"J Lambek","year":"1968","unstructured":"Lambek, J.: A fixpoint theorem for complete categories. Math. Z. 103, 151\u2013161 (1968)","journal-title":"Math. Z."},{"key":"9_CR41","unstructured":"Malcolm, G.: Algebraic data types and program transformation. Ph.D. thesis, University of Groningen (1990)"},{"issue":"2\u20133","key":"9_CR42","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0167-6423(90)90023-7","volume":"14","author":"G Malcolm","year":"1990","unstructured":"Malcolm, G.: Data structures and program transformation. Sci. Comput. Program. 14(2\u20133), 255\u2013280 (1990). https:\/\/doi.org\/10.1016\/0167-6423(90)90023-7","journal-title":"Sci. Comput. Program."},{"key":"9_CR43","volume-title":"First Steps Towards the Theory of Rose Trees","author":"L Meertens","year":"1988","unstructured":"Meertens, L.: First Steps Towards the Theory of Rose Trees. CWI, Amsterdam (1988)"},{"issue":"5","key":"9_CR44","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01211391","volume":"4","author":"L Meertens","year":"1992","unstructured":"Meertens, L.: Paramorphisms. Formal Aspects Comput. 4(5), 413\u2013424 (1992)","journal-title":"Formal Aspects Comput."},{"key":"9_CR45","doi-asserted-by":"publisher","unstructured":"Meijer, E., Fokkinga, M., Paterson, R.: Functional programming with bananas, lenses, envelopes and barbed wire. In: Hughes, J. (ed.) 5th ACM Conference on Functional Programming Languages and Computer Architecture. FPCA 1991, vol. 523, pp. 124\u2013144 (1991). https:\/\/doi.org\/10.1007\/3540543961_7","DOI":"10.1007\/3540543961_7"},{"key":"9_CR46","doi-asserted-by":"publisher","unstructured":"Okasaki, C.: Purely functional random-access lists. In: Proceedings of the Seventh International Conference on Functional Programming Languages and Computer Architecture. FPCA 1995, pp. 86\u201395. Association for Computing Machinery, New York (1995). https:\/\/doi.org\/10.1145\/224164.224187","DOI":"10.1145\/224164.224187"},{"key":"9_CR47","doi-asserted-by":"publisher","unstructured":"Pardo, A.: Monadic corecursion -definition, fusion laws, and applications-. Electron. Notes Theor. Comput. Sci. 11(C), 105\u2013139 (1998). https:\/\/doi.org\/10.1016\/S1571-0661(04)00055-6","DOI":"10.1016\/S1571-0661(04)00055-6"},{"key":"9_CR48","doi-asserted-by":"publisher","unstructured":"Pardo, A.: Generic accumulations. In: Gibbons, J., Jeuring, J. (eds.) Generic Programming: IFIP TC2\/WG2.1 Working Conference on Generic Programming. International Federation for Information Processing, vol. 115, pp. 49\u201378. Kluwer Academic Publishers (2002). https:\/\/doi.org\/10.1007\/978-0-387-35672-3_3","DOI":"10.1007\/978-0-387-35672-3_3"},{"key":"9_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/11546382_4","volume-title":"Advanced Functional Programming","author":"A Pardo","year":"2005","unstructured":"Pardo, A.: Combining datatypes and effects. In: Vene, V., Uustalu, T. (eds.) AFP 2004. LNCS, vol. 3622, pp. 171\u2013209. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11546382_4"},{"issue":"1","key":"9_CR50","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3233\/INF-1999-10102","volume":"10","author":"T Uustalu","year":"1999","unstructured":"Uustalu, T., Vene, V.: Primitive (co)recursion and course-of-value (co)iteration, categorically. Informatica 10(1), 5\u201326 (1999). https:\/\/doi.org\/10.3233\/INF-1999-10102","journal-title":"Informatica"},{"key":"9_CR51","doi-asserted-by":"publisher","unstructured":"Uustalu, T., Vene, V.: Comonadic notions of computation, 203(5), 263\u2013284 (2008). https:\/\/doi.org\/10.1016\/j.entcs.2008.05.029","DOI":"10.1016\/j.entcs.2008.05.029"},{"key":"9_CR52","unstructured":"Uustalu, T., Vene, V., Pardo, A.: Recursion schemes from comonads. Nordic J. Comput. 8(3), 366\u2013390 (2001)"},{"issue":"3","key":"9_CR53","doi-asserted-by":"crossref","first-page":"147","DOI":"10.3176\/phys.math.1998.3.01","volume":"47","author":"V Vene","year":"1998","unstructured":"Vene, V., Uustalu, T.: Functional programming with apomorphisms (corecursion). Proc. Estonian Acad. Sci. Phys. Math. 47(3), 147\u2013161 (1998)","journal-title":"Proc. Estonian Acad. Sci. Phys. Math."}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16912-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T19:17:54Z","timestamp":1676834274000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16912-0_9"}},"subtitle":["A Guide to Recursion Schemes"],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031169113","9783031169120"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16912-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"22 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MPC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematics of Program Construction","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tblilisi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mpc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.macs.hw.ac.uk\/mpc22\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"14","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":"9","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":"64% - 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":"4","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":"3 invited talks (given as abstracts in preface)","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)"}}]}}