{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T23:05:11Z","timestamp":1779836711071,"version":"3.53.1"},"reference-count":11,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T00:00:00Z","timestamp":1226016000000},"content-version":"unspecified","delay-in-days":5699,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[1993,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    We show how\n                    <jats:italic>improving values<\/jats:italic>\n                    (Burton, 1991) can be extended to handle both upper and lower bounds. The result is a new data type, called\n                    <jats:italic>improving intervals<\/jats:italic>\n                    . We give a simple implementation of improving intervals that uses a list of successively tighter bounds to represent a value. A program using improving intervals can be evaluated as a parallel program using speculative evaluation. The utility of improving intervals is demonstrated through two programs: parallel alpha-beta and parallel branch-and-bound\n                  <\/jats:p>","DOI":"10.1017\/s0956796800000678","type":"journal-article","created":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T11:13:50Z","timestamp":1226056430000},"page":"153-169","source":"Crossref","is-referenced-by-count":0,"title":["Improving intervals"],"prefix":"10.1017","volume":"3","author":[{"given":"W. Ken","family":"Jackson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"F. Warren","family":"Burton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2008,11,7]]},"reference":[{"key":"S0956796800000678_ref006","first-page":"1","volume-title":"IV Higher Order Workshop","author":"Burton","year":"1990"},{"key":"S0956796800000678_ref001","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1982.4767226"},{"key":"S0956796800000678_ref007","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/32.2.98"},{"key":"S0956796800000678_ref009","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/32.44360","article-title":"Computational efficiency of parallel combinatorial or-tree searches","volume":"16","author":"Li","year":"1990","journal-title":"IEEE Trans. Softw. Eng."},{"key":"S0956796800000678_ref002","volume-title":"Introduction to Functional Programming","author":"Bird","year":"1988"},{"key":"S0956796800000678_ref008","doi-asserted-by":"publisher","DOI":"10.1145\/358080.358103"},{"key":"S0956796800000678_ref004","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1985.6312218"},{"key":"S0956796800000678_ref005","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800000046"},{"key":"S0956796800000678_ref003","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90198-0"},{"key":"S0956796800000678_ref010","first-page":"42","volume-title":"Parallel Algorithms for Machine Intelligence and Vision","author":"Powley","year":"1989"},{"key":"S0956796800000678_ref011","doi-asserted-by":"publisher","DOI":"10.1145\/15042.15053"}],"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796800000678","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T22:35:10Z","timestamp":1779834910000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796800000678\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["S0956796800000678"],"URL":"https:\/\/doi.org\/10.1017\/s0956796800000678","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}