{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T23:05:15Z","timestamp":1779836715295,"version":"3.53.1"},"reference-count":6,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T00:00:00Z","timestamp":1226016000000},"content-version":"unspecified","delay-in-days":5516,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[1993,10]]},"DOI":"10.1017\/s0956796800000885","type":"journal-article","created":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T11:13:12Z","timestamp":1226056392000},"page":"553-561","source":"Crossref","is-referenced-by-count":39,"title":["<i>Functional Pearls<\/i>\n                    Efficient sets\u2014a balancing act"],"prefix":"10.1017","volume":"3","author":[{"given":"Stephen","family":"Adams","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2008,11,7]]},"reference":[{"key":"S0956796800000885_ref005","volume-title":"The Art of Computer Programming","volume":"3","author":"Knuth","year":"1973"},{"key":"S0956796800000885_ref006","doi-asserted-by":"publisher","DOI":"10.1137\/0202005"},{"key":"S0956796800000885_ref001","first-page":"92","volume-title":"An efficient functional implementatation of sets","author":"Adams","year":"1992"},{"key":"S0956796800000885_ref003","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"S0956796800000885_ref002","first-page":"263","article-title":"An algorithm for the organization of information","volume":"146","author":"Adel'son-Vel'skii","year":"1962","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"S0956796800000885_ref004","unstructured":"Crane C. A. (1972) Linear lista and priotity queues as balanced binary trees. PhD Thesis, Stanford University."}],"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796800000885","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T22:35:13Z","timestamp":1779834913000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796800000885\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["S0956796800000885"],"URL":"https:\/\/doi.org\/10.1017\/s0956796800000885","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}