{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:37:12Z","timestamp":1743061032027,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031389375"},{"type":"electronic","value":"9783031389382"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-38938-2_3","type":"book-chapter","created":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T11:01:49Z","timestamp":1693134109000},"page":"36-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Faster, Simpler Red-Black Trees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4384-6351","authenticated-orcid":false,"given":"Cameron","family":"Moy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,28]]},"reference":[{"key":"3_CR1","unstructured":"Appel, A.: Efficient verified red-black trees (2011). https:\/\/www.cs.princeton.edu\/~appel\/papers\/redblack.pdf"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Ashley, J.M., Dybvig, R.K.: An efficient implementation of multiple return values in scheme. In: LISP and Functional Programming (LFP) (1994). https:\/\/doi.org\/10.1145\/182590.156784","DOI":"10.1145\/182590.156784"},{"key":"3_CR3","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. MIT Press (2009)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-540-24725-8_26","volume-title":"Programming Languages and Systems","author":"J-C Filli\u00e2tre","year":"2004","unstructured":"Filli\u00e2tre, J.-C., Letouzey, P.: Functors for proofs and programs. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 370\u2013384. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24725-8_26"},{"key":"3_CR5","unstructured":"Flatt, M., PLT: reference: racket. Technical report. PLT-TR-2010-1, PLT Design Inc. (2010). https:\/\/racket-lang.org\/tr1\/"},{"key":"3_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796814000227","author":"K Germane","year":"2014","unstructured":"Germane, K., Might, M.: Deletion: the curse of the red-black tree. J. Funct. Program. (JFP) (2014). https:\/\/doi.org\/10.1017\/S0956796814000227","journal-title":"J. Funct. Program. (JFP)"},{"key":"3_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796818000217","author":"B Greenman","year":"2019","unstructured":"Greenman, B., et al.: How to evaluate the performance of gradual typing systems. J. Funct. Program. (JFP) (2019). https:\/\/doi.org\/10.1017\/S0956796818000217","journal-title":"J. Funct. Program. (JFP)"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Guibas, L., Sedgewick, R.: A dichromatic framework for balanced trees. In: IEEE Symposium on Foundations of Computer Science (1978). https:\/\/doi.org\/10.1109\/SFCS.1978.3","DOI":"10.1109\/SFCS.1978.3"},{"key":"3_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796801004026","author":"S Kahrs","year":"2001","unstructured":"Kahrs, S.: Red-black trees with types. J. Funct. Program. (JFP) (2001). https:\/\/doi.org\/10.1017\/S0956796801004026","journal-title":"J. Funct. Program. (JFP)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Okasaki, C.: Purely Functional Data Structures. Cambridge University Press (1999)","DOI":"10.1017\/CBO9780511530104"},{"key":"3_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796899003494","author":"C Okasaki","year":"1999","unstructured":"Okasaki, C.: Red-black trees in a functional setting. J. Funct. Program. (JFP) (1999). https:\/\/doi.org\/10.1017\/S0956796899003494","journal-title":"J. Funct. Program. (JFP)"},{"key":"3_CR12","unstructured":"Peyton Jones, S.: Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press (2003)"},{"key":"3_CR13","unstructured":"Weirich, S.: Red black trees (redux) (2021). https:\/\/www.seas.upenn.edu\/~cis5520\/21fa\/lectures\/stub\/06-GADTs\/RedBlackGADT0.html"}],"container-title":["Lecture Notes in Computer Science","Trends in Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38938-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T11:02:20Z","timestamp":1693134140000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38938-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031389375","9783031389382"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38938-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TFP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Trends in Functional Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Boston, MA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tfp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/trendsfp.github.io\/index.html","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":"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":"6","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":"43% - 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":"2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}