{"id":"https://openalex.org/W4399872417","doi":"https://doi.org/10.1145/3656398","title":"The Functional Essence of Imperative Binary Search Trees","display_name":"The Functional Essence of Imperative Binary Search Trees","publication_year":2024,"publication_date":"2024-06-20","ids":{"openalex":"https://openalex.org/W4399872417","doi":"https://doi.org/10.1145/3656398"},"language":"en","primary_location":{"id":"doi:10.1145/3656398","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3656398","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1145/3656398","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017738891","display_name":"Anton Lorenzen","orcid":"https://orcid.org/0000-0003-3538-9688"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Anton Lorenzen","raw_affiliation_strings":["University of Edinburgh, Edinburgh, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0003-3538-9688","affiliations":[{"raw_affiliation_string":"University of Edinburgh, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086447301","display_name":"Daan Leijen","orcid":"https://orcid.org/0000-0003-1027-5430"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daan Leijen","raw_affiliation_strings":["Microsoft Research, Redmond, USA"],"raw_orcid":"https://orcid.org/0000-0003-1027-5430","affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019085361","display_name":"Wouter Swierstra","orcid":"https://orcid.org/0000-0002-0295-7944"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Wouter Swierstra","raw_affiliation_strings":["Utrecht University, Utrecht, Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-0295-7944","affiliations":[{"raw_affiliation_string":"Utrecht University, Utrecht, Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061903791","display_name":"Sam Lindley","orcid":"https://orcid.org/0000-0002-1360-4714"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Sam Lindley","raw_affiliation_strings":["University of Edinburgh, Edinburgh, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0002-1360-4714","affiliations":[{"raw_affiliation_string":"University of Edinburgh, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3797,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.83403871,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"8","issue":"PLDI","first_page":"518","last_page":"542"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.5658779740333557},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.5343771576881409},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41720330715179443},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.2665250301361084},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13226038217544556},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.04639482498168945}],"concepts":[{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.5658779740333557},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.5343771576881409},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41720330715179443},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2665250301361084},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13226038217544556},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.04639482498168945},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3656398","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3656398","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/5a6b88ce-a0b8-4eff-91ed-fae78893e86a","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/5a6b88ce-a0b8-4eff-91ed-fae78893e86a","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lorenzen, A, Leijen, D, Swierstra, W & Lindley, S 2024, 'The functional essence of imperative binary search trees', Proceedings of the ACM on Programming Languages, vol. 8, no. PLDI, 168, pp. 518-542. https://doi.org/10.1145/3656398","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:dspace.library.uu.nl:1874/471973","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/471973","pdf_url":null,"source":{"id":"https://openalex.org/S4306401649","display_name":"Utrecht University Repository (Utrecht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193662353","host_organization_name":"Utrecht University","host_organization_lineage":["https://openalex.org/I193662353"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":{"id":"doi:10.1145/3656398","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3656398","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2989041308","display_name":null,"funder_award_id":"Future Leaders Fellowship MR/T043830/1 (EHOP)","funder_id":"https://openalex.org/F4320314731","funder_display_name":"UK Research and Innovation"}],"funders":[{"id":"https://openalex.org/F4320314731","display_name":"UK Research and Innovation","ror":"https://ror.org/001aqnf71"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":59,"referenced_works":["https://openalex.org/W70976082","https://openalex.org/W1267783697","https://openalex.org/W1491698270","https://openalex.org/W1574140514","https://openalex.org/W1858945639","https://openalex.org/W1905591175","https://openalex.org/W1977207904","https://openalex.org/W1980962065","https://openalex.org/W2006543828","https://openalex.org/W2021615496","https://openalex.org/W2043416466","https://openalex.org/W2070991879","https://openalex.org/W2071455557","https://openalex.org/W2078589215","https://openalex.org/W2081666277","https://openalex.org/W2097805327","https://openalex.org/W2105045857","https://openalex.org/W2109375905","https://openalex.org/W2110692415","https://openalex.org/W2130055503","https://openalex.org/W2131450750","https://openalex.org/W2137628566","https://openalex.org/W2138051462","https://openalex.org/W2138452186","https://openalex.org/W2139626883","https://openalex.org/W2142590632","https://openalex.org/W2150580621","https://openalex.org/W2166853865","https://openalex.org/W2293091464","https://openalex.org/W2493130382","https://openalex.org/W2511045822","https://openalex.org/W2605073028","https://openalex.org/W2765411061","https://openalex.org/W2901454403","https://openalex.org/W2912949875","https://openalex.org/W2931620665","https://openalex.org/W2956068069","https://openalex.org/W3038320931","https://openalex.org/W3040288220","https://openalex.org/W3043982209","https://openalex.org/W3092543431","https://openalex.org/W3112414036","https://openalex.org/W3124031623","https://openalex.org/W3139789547","https://openalex.org/W3165845273","https://openalex.org/W3174269942","https://openalex.org/W3204759753","https://openalex.org/W4233225156","https://openalex.org/W4253835178","https://openalex.org/W4281711013","https://openalex.org/W4281843089","https://openalex.org/W4289874378","https://openalex.org/W4293812882","https://openalex.org/W4315631774","https://openalex.org/W4319866876","https://openalex.org/W4379537219","https://openalex.org/W4386317020","https://openalex.org/W6892401318","https://openalex.org/W6967492087"],"related_works":["https://openalex.org/W1973074590","https://openalex.org/W4376140277","https://openalex.org/W2130055503","https://openalex.org/W4205700501","https://openalex.org/W115779656","https://openalex.org/W4367055576","https://openalex.org/W2022352965","https://openalex.org/W1536590737","https://openalex.org/W2026166434","https://openalex.org/W1984738873"],"abstract_inverted_index":{"Algorithms":[0],"on":[1,18,154,160],"restructuring":[2,66],"binary":[3,67,155],"search":[4,68,156],"trees":[5,157],"are":[6,35,71,126],"typically":[7],"presented":[8],"in":[9,29,64,134,166],"imperative":[10,33,76,124],"pseudocode.":[11],"Understandably":[12],"so,":[13],"as":[14,40,72,74],"their":[15,41,75],"performance":[16,159],"relies":[17],"in-place":[19],"execution,":[20],"rather":[21],"than":[22],"the":[23,46,79,130,135,140,163],"repeated":[24],"allocation":[25],"of":[26,81,150],"fresh":[27],"nodes":[28],"memory.":[30],"Unfortunately,":[31],"these":[32,82],"algorithms":[34,58,84,125,153],"notoriously":[36],"difficult":[37],"to":[38],"verify":[39],"loop":[42],"invariants":[43],"must":[44],"relate":[45],"unfinished":[47],"tree":[48,69],"fragments":[49],"being":[50],"rebalanced.":[51],"This":[52,143],"paper":[53,102],"presents":[54],"several":[55],"novel":[56,116],"functional":[57,83,122],"for":[59],"accessing":[60],"and":[61,98,110,123],"inserting":[62],"elements":[63],"a":[65,88,105,111,115,145],"that":[70],"fast":[73],"counterparts;":[77],"yet":[78],"correctness":[80],"is":[85],"established":[86],"using":[87,108,114,139],"simple":[89],"inductive":[90],"argument.":[91],"For":[92],"each":[93],"data":[94],"structure,":[95],"move-to-root,":[96],"splay,":[97],"zip":[99],"trees,":[100],"this":[101,133],"describes":[103],"both":[104],"bottom-up":[106],"algorithm":[107,113],"zippers":[109],"top-down":[112],"first-class":[117],"constructor":[118],"context":[119],"primitive.":[120],"The":[121],"equivalent:":[127],"we":[128],"mechanise":[129],"proofs":[131],"establishing":[132],"Coq":[136],"proof":[137],"assistant":[138],"Iris":[141],"framework.":[142],"yields":[144],"first":[146],"fully":[147],"verified":[148],"implementation":[149],"well":[151],"known":[152],"with":[158,162],"par":[161],"fastest":[164],"implementations":[165],"C.":[167]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1}],"updated_date":"2026-08-29T07:29:34.045763","created_date":"2025-10-10T00:00:00"}