{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:02:06Z","timestamp":1742918526790,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031210365"},{"type":"electronic","value":"9783031210372"}],"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-21037-2_7","type":"book-chapter","created":{"date-parts":[[2022,11,25]],"date-time":"2022-11-25T00:05:14Z","timestamp":1669334714000},"page":"135-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Characterizing Functions Mappable over\u00a0GADTs"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Johann","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3990-726X","authenticated-orcid":false,"given":"Pierre","family":"Cagne","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,25]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Abbott, M., Altenkirch, T., Ghani, N.: Categories of containers. In: Foundations of Software Science and Computation Structures, pp. 23\u201338 (2003). https:\/\/doi.org\/10.1007\/3-540-36576-1_2","DOI":"10.1007\/3-540-36576-1_2"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.06.002","volume":"342","author":"M Abbott","year":"2005","unstructured":"Abbott, M., Altenkirch, T., Ghani, N.: Containers - constructing strictly positive types. Theoret. Comput. Sci. 342, 3\u201327 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2005.06.002","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Altenkirch, T., Ghani, N., Hancock, P., McBride, C., Morris, P.: Indexed containers. J. Funct. Program. 25(e5) (2015). https:\/\/doi.org\/10.1017\/S095679681500009X","DOI":"10.1017\/S095679681500009X"},{"key":"7_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4962-7","volume-title":"Algebraic Approaches to Program Semantics","author":"M Arbib","year":"1986","unstructured":"Arbib, M., Manes, E.: Algebraic Approaches to Program Semantics. Springer, New York (1986). https:\/\/doi.org\/10.1007\/978-1-4612-4962-7"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Bird, R., de Moor, O.: Algebra of Programming. Prentice-Hall, London (1997)","DOI":"10.1007\/978-3-642-61455-2_12"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Bird, R., Meertens, L.: Nested datatypes. In: Mathematics of Program Construction, pp. 52\u201367 (1998). https:\/\/doi.org\/10.1007\/BFb0054285","DOI":"10.1007\/BFb0054285"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Cagne, P., Johann, P.: Accepted Artifact (APLAS 2022) supporting \u201cCharacterizing Functions Mappable Over GADTs\u201d. https:\/\/doi.org\/10.5281\/zenodo.7004589","DOI":"10.5281\/zenodo.7004589"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0747-7171(92)90010-2","volume":"14","author":"D Dougherty","year":"1992","unstructured":"Dougherty, D., Johann, P.: An improved general E-unification method. J. Symb. Comput. 14, 303\u2013320 (1992). https:\/\/doi.org\/10.1016\/0747-7171(92)90010-2","journal-title":"J. Symb. Comput."},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Fiore, M.: Discrete generalised polynomial functors. In: Automata, Languages, and Programming, pp. 214\u2013226 (2012). https:\/\/doi.org\/10.1007\/978-3-642-31585-5_22","DOI":"10.1007\/978-3-642-31585-5_22"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Hamana, M., Fiore, M.: A foundation for GADTs and inductive families: dependent polynomial functor approach. In: Workshop on Generic Programming, pp. 59\u201370 (2011). https:\/\/doi.org\/10.1145\/2036918.2036927","DOI":"10.1145\/2036918.2036927"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Johann, P., Ghani, N.: Initial algebra semantics is enough! In: Typed Lambda Calculus and Applications, pp. 207\u2013222 (2007). https:\/\/doi.org\/10.1007\/978-3-540-73228-0_16","DOI":"10.1007\/978-3-540-73228-0_16"},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"Johann, P., Ghani, N.: Foundations for structured programming with GADTs. In: Principles of Programming Languages, pp. 297\u2013308 (2008). https:\/\/doi.org\/10.1145\/1328897.1328475","DOI":"10.1145\/1328897.1328475"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Johann, P., Polonsky, A.: Higher-kinded data types: syntax and semantics. In: Logic in Computer Science, pp. 1\u201313 (2019). https:\/\/doi.org\/10.1109\/LICS.2019.8785657","DOI":"10.1109\/LICS.2019.8785657"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Peyton Jones, S., Vytiniotis, D., Weirich, S., Washburn, G.: Simple unification-based type inference for GADTs. In: International Conference on Functional Programming, pp. 50\u201361 (2006). https:\/\/doi.org\/10.1145\/1160074.1159811","DOI":"10.1145\/1160074.1159811"},{"issue":"1","key":"7_CR15","first-page":"513","volume":"83","author":"JC Reynolds","year":"1983","unstructured":"Reynolds, J.C.: Types, abstraction, and parametric polymorphism. Inf. Process. 83(1), 513\u2013523 (1983)","journal-title":"Inf. Process."},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Sheard, T., Pasalic, E.: Meta-programming with built-in type equality. In: Workshop on Logical Frameworks and Meta-languages, pp. 49\u201365 (2008). https:\/\/doi.org\/10.1016\/j.entcs.2007.11.012","DOI":"10.1016\/j.entcs.2007.11.012"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Xi, H., Chen, C., Chen, G.: Guarded recursive datatype constructors. In: Principles of Programming Languages, pp. 224\u2013235 (2003). https:\/\/doi.org\/10.1145\/604131.604150","DOI":"10.1145\/604131.604150"}],"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-031-21037-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,25]],"date-time":"2022-11-25T00:07:09Z","timestamp":1669334829000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21037-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031210365","9783031210372"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21037-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APLAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Symposium on Programming Languages and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Auckland","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","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":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aplas2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/aplas-2022","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","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":"10","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":"45% - 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":"4","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)"}}]}}