{"id":"https://openalex.org/W2205302904","doi":"https://doi.org/10.1017/s0956796897002736","title":"FUNCTIONAL PEARL On merging and selection","display_name":"FUNCTIONAL PEARL On merging and selection","publication_year":1997,"publication_date":"1997-05-01","ids":{"openalex":"https://openalex.org/W2205302904","doi":"https://doi.org/10.1017/s0956796897002736","mag":"2205302904"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796897002736","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796897002736","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/DB0CF71E6B3D975D1F171C02336F3FA3/S0956796897002736a.pdf/div-class-title-functional-pearl-on-merging-and-selection-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/DB0CF71E6B3D975D1F171C02336F3FA3/S0956796897002736a.pdf/div-class-title-functional-pearl-on-merging-and-selection-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068829812","display_name":"Richard Bird","orcid":null},"institutions":[{"id":"https://openalex.org/I2802123492","display_name":"Oxford Research Group","ror":"https://ror.org/00z4w4f29","country_code":"GB","type":"nonprofit","lineage":["https://openalex.org/I2802123492"]},{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"RICHARD S. BIRD","raw_affiliation_strings":["Programming Research Group, Oxford University, Wolfson Building, Parks Road, Oxford OX1 3QD, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Programming Research Group, Oxford University, Wolfson Building, Parks Road, Oxford OX1 3QD, UK","institution_ids":["https://openalex.org/I2802123492","https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5068829812"],"corresponding_institution_ids":["https://openalex.org/I2802123492","https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":0.6045,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.78472823,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"7","issue":"3","first_page":"349","last_page":"354"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9890999794006348,"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/search-engine-indexing","display_name":"Search engine indexing","score":0.7532846927642822},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.715246319770813},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6461020112037659},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.6095441579818726},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.5377251505851746},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5299074649810791},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.480439156293869},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4748116731643677},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4669566750526428},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.4113852083683014},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40796923637390137},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34932202100753784},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2942868769168854},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2755236029624939},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.11473006010055542},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.11115574836730957}],"concepts":[{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.7532846927642822},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.715246319770813},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6461020112037659},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.6095441579818726},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.5377251505851746},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5299074649810791},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.480439156293869},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4748116731643677},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4669566750526428},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.4113852083683014},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40796923637390137},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34932202100753784},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2942868769168854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2755236029624939},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.11473006010055542},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.11115574836730957}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0956796897002736","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796897002736","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/DB0CF71E6B3D975D1F171C02336F3FA3/S0956796897002736a.pdf/div-class-title-functional-pearl-on-merging-and-selection-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s0956796897002736","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796897002736","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/DB0CF71E6B3D975D1F171C02336F3FA3/S0956796897002736a.pdf/div-class-title-functional-pearl-on-merging-and-selection-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2205302904.pdf","grobid_xml":"https://content.openalex.org/works/W2205302904.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2056975861","https://openalex.org/W2363556447","https://openalex.org/W2089900921","https://openalex.org/W270522628","https://openalex.org/W2539085113","https://openalex.org/W1510719821","https://openalex.org/W2011933350","https://openalex.org/W3169685561","https://openalex.org/W2501849745","https://openalex.org/W1978536651"],"abstract_inverted_index":{"Given":[0],"two":[1,22,130],"ascending":[2,23],"lists":[3],"xs":[4,49,79,95],"and":[5,25,50,80,96,150],"ys":[6,81,97],"of":[7],"combined":[8],"length":[9],"greater":[10],"than":[11,65,136],"n,":[12],"consider":[13],"the":[14,34,69,90,107,120],"computation":[15,35,108],"offormula":[16],"hereThe":[17],"standard":[18],"function":[19],"merge":[20],"merges":[21],"sequences":[24],"(!!)":[26],"denotes":[27],"list":[28],"indexing.":[29,151],"With":[30],"a":[31,63,66,75,86,145],"lazy":[32],"evaluator":[33],"takes":[36,44],"O(n)":[37],"steps;":[38],"with":[39],"an":[40],"eager":[41],"one":[42],"it":[43,57],"O(p+q)":[45],"steps,":[46],"where":[47],"p=length":[48],"q=length":[51],"ys.":[52],"Now":[53],"in":[54,134],"functional":[55],"programming":[56],"is":[58,92,118,124],"more":[59],"efficient":[60],"to":[61,112],"index":[62],"tree":[64],"list,":[67],"so":[68],"question":[70],"arises:":[71],"can":[72,109],"we":[73],"find":[74],"faster":[76],"solution":[77],"if":[78,94],"are":[82,98],"each":[83,99],"represented":[84,100],"by":[85,101],"tree?":[87],"Somewhat":[88],"surprisingly":[89],"answer":[91],"yes:":[93],"balanced":[102],"binary":[103,131],"search":[104,132],"trees,":[105],"then":[106],"be":[110],"reduced":[111],"O(log":[113],"p+log":[114],"q)":[115],"steps.":[116],"This":[117],"despite":[119],"fact":[121],"that":[122],"there":[123],"no":[125],"known":[126],"method":[127],"for":[128],"merging":[129,149],"trees":[133],"better":[135],"linear":[137],"time.":[138],"The":[139],"details,":[140],"presented":[141],"below,":[142],"depend":[143],"on":[144],"subtle":[146],"relationship":[147],"between":[148]},"counts_by_year":[],"updated_date":"2026-05-27T06:14:07.914337","created_date":"2016-06-24T00:00:00"}