{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:54:03Z","timestamp":1776891243931,"version":"3.51.2"},"reference-count":12,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","issue":"4","license":[{"start":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T00:00:00Z","timestamp":1226016000000},"content-version":"unspecified","delay-in-days":4786,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[1995,10]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    We present purely functional implementations of queues and double-ended queues (deques) requiring only\n                    <jats:italic>O<\/jats:italic>\n                    (1) time per operation in the worst case. Our algorithms are considerably simpler than previous designs with the same bounds. The inspiration for our approach is the incremental behaviour of certain functions on lazy lists.\n                  <\/jats:p>","DOI":"10.1017\/s0956796800001489","type":"journal-article","created":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T11:11:23Z","timestamp":1226056283000},"page":"583-592","source":"Crossref","is-referenced-by-count":47,"title":["Simple and efficient purely functional queues and deques"],"prefix":"10.46298","volume":"5","author":[{"given":"Chris","family":"Okasaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2008,11,7]]},"reference":[{"key":"S0956796800001489_ref010","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322246"},{"key":"S0956796800001489_ref009","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800000526"},{"key":"S0956796800001489_ref006","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5983-1"},{"key":"S0956796800001489_ref008","unstructured":"Hood R. (1982) The efficient implementation of very-high-level programming language constructs. PhD thesis, Department of Computer Science, Cornell University."},{"key":"S0956796800001489_ref011","unstructured":"Sarnak N. (1986) Persistent Data Structures. PhD thesis, Department of Computer Sciences, New York University."},{"key":"S0956796800001489_ref001","volume-title":"Structure and Interpretation of Computer Programs","author":"Abelson","year":"1985"},{"key":"S0956796800001489_ref003","unstructured":"Chuang T.-R. and Goldberg B. (1993) Real-time deques, multihead Turing machines, and purely functional programming. In: Proceedings of the Conference on Functional Programming and Computer Architecture, Copenhagen, pp. 289\u2013298."},{"key":"S0956796800001489_ref012","doi-asserted-by":"publisher","DOI":"10.1007\/BF02238815"},{"key":"S0956796800001489_ref005","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(86)90028-1"},{"key":"S0956796800001489_ref007","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90030-2"},{"key":"S0956796800001489_ref002","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90015-1"},{"key":"S0956796800001489_ref004","doi-asserted-by":"publisher","DOI":"10.1145\/321724.321726"}],"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796800001489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:18:07Z","timestamp":1776889087000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796800001489\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["S0956796800001489"],"URL":"https:\/\/doi.org\/10.1017\/s0956796800001489","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}