{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:17:04Z","timestamp":1748405824075,"version":"3.41.0"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819789429"},{"type":"electronic","value":"9789819789436"}],"license":[{"start":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T00:00:00Z","timestamp":1730073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T00:00:00Z","timestamp":1730073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-97-8943-6_2","type":"book-chapter","created":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T08:45:29Z","timestamp":1730105129000},"page":"23-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Random-Access Lists, from\u00a0EE to\u00a0FP"],"prefix":"10.1007","author":[{"given":"Titouan","family":"Quennet","sequence":"first","affiliation":[]},{"given":"Pierre-\u00c9variste","family":"Dagand","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,28]]},"reference":[{"key":"2_CR1","unstructured":"Chris Okasaki. Purely functional data structures. Cambridge University Press, 1999. ISBN 978-0-521-66350-2"},{"key":"2_CR2","unstructured":"Conor McBride. Ornamental algebras, algebraic ornaments. Manuscript available online, 2010. URL http:\/\/personal.cis.strath.ac.uk\/~conor\/pub\/OAAO\/Ornament.pdf"},{"key":"2_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796818000011","volume":"28","author":"P\u00c9 Dagand","year":"2018","unstructured":"Dagand, P.\u00c9., Tabareau, N., Tanter, \u00c9.: Foundations of dependent interoperability. J. Funct. Program. 28, e9 (2018). https:\/\/doi.org\/10.1017\/S0956796818000011","journal-title":"J. Funct. Program."},{"issue":"5","key":"2_CR4","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1017\/S095679680100404X","volume":"11","author":"R Hinze","year":"2001","unstructured":"Hinze, R.: Manufacturing datatypes. J. Funct. Program. 11(5), 493\u2013524 (2001). https:\/\/doi.org\/10.1017\/S095679680100404X","journal-title":"J. Funct. Program."},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Richard\u00a0S. Bird and Lambert G. L.\u00a0T. Meertens. Nested datatypes. In Johan Jeuring, editor, Mathematics of Program Construction, MPC\u201998, Marstrand, Sweden, June 15-17, 1998, Proceedings, volume 1422 of Lecture Notes in Computer Science, pages 52\u201367. Springer, 1998. https:\/\/doi.org\/10.1007\/BFb0054285","DOI":"10.1007\/BFb0054285"},{"key":"2_CR6","unstructured":"Ralf Hinze. Numerical representations as higher-order nested datatypes. Technical Report IAI-TR-98-12, Institut f\u00fcr Informatik III, Universit\u00e4t Bonn, 1998. URL https:\/\/www.cs.ox.ac.uk\/ralf.hinze\/publications\/IAI-TR-98-12.ps.gz"},{"key":"2_CR7","unstructured":"Samuel Klumpers. Generic numerical representations as ornaments. Master\u2019s thesis, Utrecht University, 2023. URL https:\/\/studenttheses.uu.nl\/handle\/20.500.12932\/45670"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Mathieu Montin, Am\u00e9lie Ledein, and Catherine Dubois. Libndt: Towards a formal library on spreadable properties over linked nested datatypes. In Jeremy Gibbons and Max\u00a0S. New, editors, Proceedings Ninth Workshop on Mathematically Structured Functional Programming, MSFP@ETAPS 2022, Munich, Germany, 2nd April 2022, volume 360 of EPTCS, pages 27\u201344, 2022. https:\/\/doi.org\/10.4204\/EPTCS.360.2","DOI":"10.4204\/EPTCS.360.2"},{"key":"2_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796816000307","volume":"27","author":"H-S Ko","year":"2017","unstructured":"Ko, H.-S., Gibbons, J.: Programming with ornaments. J. Funct. Program. 27, e2 (2017). https:\/\/doi.org\/10.1017\/S0956796816000307","journal-title":"J. Funct. Program."},{"key":"2_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796820000064","volume":"30","author":"W Swierstra","year":"2020","unstructured":"Swierstra, W.: Heterogeneous binary random-access lists. J. Funct. Program. 30, e10 (2020). https:\/\/doi.org\/10.1017\/S0956796820000064","journal-title":"J. Funct. Program."},{"key":"2_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-16912-0_3","author":"R Hinze","year":"2022","unstructured":"Hinze, R., Swierstra, W.: Calculating datastructures. In Mathematics of Program Construction MPC (2022). https:\/\/doi.org\/10.1007\/978-3-031-16912-0_3","journal-title":"In Mathematics of Program Construction MPC"},{"key":"2_CR12","unstructured":"Pierre-Evariste Dagand, Pierre Letouzey, and Ellenor\u00a0Fatemeh Taghayor. Rough Pearl: Manufacturing Cons-Cells. In 35es Journ\u00e9es Francophones des Langages Applicatifs (JFLA 2024), 2024. URL https:\/\/inria.hal.science\/hal-04406422"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Conor McBride, Healfdene Goguen, and James McKinna. A few constructions on constructors. In Jean-Christophe Filli\u00e2tre, Christine Paulin-Mohring, and Benjamin Werner, editors, Types for Proofs and Programs, International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers, volume 3839 of Lecture Notes in Computer Science, pages 186\u2013200. Springer, 2004. https:\/\/doi.org\/10.1007\/11617990_12","DOI":"10.1007\/11617990_12"},{"key":"2_CR14","unstructured":"Coq standard library. Binary numbers: to_nat, 2024a. Module NArith.BinNatDef (l.367-371)"},{"key":"2_CR15","unstructured":"Coq standard library. Binary numbers, 2024b. Module Numbers.BinNums (l.21-24)"},{"key":"2_CR16","unstructured":"Agda standard library. Binary numbers, 2024. Module Data.Nat.Binary.Base (l.29-32)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Hedberg, M.: A coherence theorem for Martin-L\u00f6f\u2019s type theory. J. Funct. Program. 8(4), 413\u2013436 (1998)","DOI":"10.1017\/S0956796898003153"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Sam Lindley and Ian Stark. Reducibility and tt-lifting for computation types. In Pawel Urzyczyn, editor, Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005, Proceedings, volume 3461 of Lecture Notes in Computer Science, pages 262\u2013277. Springer, 2005. https:\/\/doi.org\/10.1007\/11417170_20","DOI":"10.1007\/11417170_20"},{"key":"2_CR19","unstructured":"Kenji Maillard. Principles of Program Verification for Arbitrary Monadic Effects. (Principes de la V\u00e9rification de Programmes \u00e0 Effets Monadiques Arbitraires). PhD thesis, \u00c9cole Normale Sup\u00e9rieure, Paris, France, 2019. URL https:\/\/tel.archives-ouvertes.fr\/tel-02416788"},{"issue":"5","key":"2_CR20","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0020-0190(83)90106-0","volume":"17","author":"EW Myers","year":"1983","unstructured":"Myers, E.W.: An applicative random-access stack. Inf. Process. Lett. 17(5), 241\u2013248 (1983). https:\/\/doi.org\/10.1016\/0020-0190(83)90106-0","journal-title":"Inf. Process. Lett."},{"key":"2_CR21","unstructured":"Texas Instruments. CMOS 4-bit magnitude comparator. 2003"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"G\u00e9rard\u00a0P. Huet. The zipper. J. Funct. Program., 7(5), 1997. https:\/\/doi.org\/10.1017\/S0956796897002864","DOI":"10.1017\/S0956796897002864"},{"key":"2_CR23","unstructured":"Conor McBride. The Derivative of a Regular Type is its Type of One-Hole Contexts. Available at http:\/\/strictlypositive.org\/diff.pdf, 2001"},{"key":"2_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796816000356","volume":"27","author":"P\u00c9 Dagand","year":"2017","unstructured":"Dagand, P.\u00c9.: The essence of ornaments. J. Funct. Program. 27, e9 (2017). https:\/\/doi.org\/10.1017\/S0956796816000356","journal-title":"J. Funct. Program."},{"issue":"2\u20133","key":"2_CR25","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1017\/S0956796814000069","volume":"24","author":"P\u00c9 Dagand","year":"2014","unstructured":"Dagand, P.\u00c9., McBride, C.: Transporting functions across ornaments. J. Funct. Program. 24(2\u20133), 316\u2013383 (2014). https:\/\/doi.org\/10.1017\/S0956796814000069","journal-title":"J. Funct. Program."},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Thomas Williams and Didier R\u00e9my. A principled approach to ornamentation in ML. Proc. ACM Program. Lang., 2(POPL):21:1\u201321:30, 2018. https:\/\/doi.org\/10.1145\/3158109","DOI":"10.1145\/3158109"},{"key":"2_CR27","doi-asserted-by":"publisher","unstructured":"Conor McBride. Clowns to the left of me, jokers to the right (pearl): dissecting data structures. In George\u00a0C. Necula and Philip Wadler, editors, Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, January 7-12, 2008, pages 287\u2013295. ACM, 2008. https:\/\/doi.org\/10.1145\/1328438.1328474","DOI":"10.1145\/1328438.1328474"}],"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-981-97-8943-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T16:52:44Z","timestamp":1748364764000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-8943-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,28]]},"ISBN":["9789819789429","9789819789436"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-8943-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,28]]},"assertion":[{"value":"28 October 2024","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":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aplas2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/aplas-2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}