{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T23:05:04Z","timestamp":1779836704514,"version":"3.53.1"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[1997,9]]},"abstract":"<jats:p>\n                    Nicholas Pippenger has recently given a problem that, \n\nunder two simple restrictions, can be \n\nsolved in linear time by an impure Lisp program, but requires \n\n\u03a9(\n                    <jats:italic>n<\/jats:italic>\n                    log\n                    <jats:italic>n<\/jats:italic>\n                    ) steps to be solved \n\nby any eager pure Lisp program. By showing how to solve the \n\nproblem in linear time with a \n\nlazy functional program, we demonstrate that \u2013 for \n\nsome problems at least \u2013 lazy evaluators \n\nare strictly more powerful than eager ones.\n                  <\/jats:p>","DOI":"10.1017\/s0956796897002827","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T09:26:15Z","timestamp":1027761975000},"page":"541-547","source":"Crossref","is-referenced-by-count":10,"title":["More haste, less speed: lazy versus eager evaluation"],"prefix":"10.1017","volume":"7","author":[{"given":"RICHARD","family":"BIRD","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"GERAINT","family":"JONES","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"OEGE","family":"DE MOOR","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[1997,9,1]]},"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796897002827","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T22:34:49Z","timestamp":1779834889000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796897002827\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":0,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["S0956796897002827"],"URL":"https:\/\/doi.org\/10.1017\/s0956796897002827","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}