{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T23:05:13Z","timestamp":1779836713732,"version":"3.53.1"},"reference-count":4,"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                    <jats:italic>List terminators<\/jats:italic>\n                    are discussed as a new form of qualifier in list comprehensions for early termination of a list. The semantics of list terminators is expressed in terms of an optimal translation of list comprehensions (cf. Wadler, 1987) because it makes direct use of a continuation list.\n                  <\/jats:p>","DOI":"10.1017\/s095679680000071x","type":"journal-article","created":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T11:13:50Z","timestamp":1226056430000},"page":"247-250","source":"Crossref","is-referenced-by-count":0,"title":["Terminating comprehensions"],"prefix":"10.1017","volume":"3","author":[{"given":"Chris","family":"Reade","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2008,11,7]]},"reference":[{"key":"S095679680000071X_ref004","volume-title":"Proceedings ACM Conference on Lisp and Functional Programming","author":"Wadler","year":"1990"},{"key":"S095679680000071X_ref003","volume-title":"The Implementation of Functional Programming Languages","author":"Wadler","year":"1987"},{"key":"S095679680000071X_ref001","doi-asserted-by":"publisher","DOI":"10.1145\/130697.130699"},{"key":"S095679680000071X_ref002","volume-title":"Elements of Functional Programming","author":"Reade","year":"1989"}],"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S095679680000071X","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\/S095679680000071X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["S095679680000071X"],"URL":"https:\/\/doi.org\/10.1017\/s095679680000071x","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}