{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T22:07:41Z","timestamp":1648591661662},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,2,1]],"date-time":"1987-02-01T00:00:00Z","timestamp":539136000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1987,2]]},"DOI":"10.1016\/0020-0190(87)90183-9","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"183-188","source":"Crossref","is-referenced-by-count":3,"title":["A set of combinators for abstraction in linear space"],"prefix":"10.1016","volume":"24","author":[{"given":"M.","family":"Castan","sequence":"first","affiliation":[]},{"given":"M.-H.","family":"Durand","sequence":"additional","affiliation":[]},{"given":"M.","family":"Lema\u00eetre","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0020-0190(87)90183-9_BIB1","doi-asserted-by":"crossref","first-page":"222","DOI":"10.2307\/2272961","article-title":"An abstraction algorithm for combinatory logic","volume":"41","author":"Abdali","year":"1976","journal-title":"J. Symbolic Logic"},{"issue":"5","key":"10.1016\/0020-0190(87)90183-9_BIB2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(82)90014-X","article-title":"A linear space translation of functional programs to Turner combinators","volume":"14","author":"Burton","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(87)90183-9_BIB3","series-title":"ICALP'85","article-title":"Categorical combinatory logic","volume":"Vol. 194","author":"Curien","year":"1985"},{"key":"10.1016\/0020-0190(87)90183-9_BIB4","volume":"Vol. 1","author":"Curry","year":"1958-1968"},{"key":"10.1016\/0020-0190(87)90183-9_BIB5_1","series-title":"Proc. ACM SIGPLAN'84 Symp. on Compiler Construction","article-title":"Efficient compilation of lazy evaluation","author":"Johnsson","year":"1984"},{"key":"10.1016\/0020-0190(87)90183-9_BIB5_2","series-title":"Proc. ACM SIGPLAN'84 Symp. on Compiler Construction","first-page":"58","article-title":"Efficient compilation of lazy evaluation","volume":"19","author":"Johnsson","year":"1984"},{"key":"10.1016\/0020-0190(87)90183-9_BIB6","article-title":"The complexity of a translation of lambda-calculus to combinators","author":"Kennaway","year":"1984"},{"key":"10.1016\/0020-0190(87)90183-9_BIB7","series-title":"Director strings","author":"Kennaway","year":"1984"},{"key":"10.1016\/0020-0190(87)90183-9_BIB8","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0020-0190(85)90066-3","article-title":"Translation of Turner combinators in O(n log n) space","volume":"20","author":"Noshita","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(87)90183-9_BIB9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF03037065","article-title":"The BC-chain method for representing combinators in linear space","volume":"3","author":"Noshita","year":"1985","journal-title":"New Generation Comput."},{"key":"10.1016\/0020-0190(87)90183-9_BIB10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","article-title":"A new implementation technique for applicative languages","volume":"9","author":"Turner","year":"1979","journal-title":"Software-Practice and Experience"},{"issue":"2","key":"10.1016\/0020-0190(87)90183-9_BIB11","doi-asserted-by":"crossref","first-page":"267","DOI":"10.2307\/2273733","article-title":"Another algorithm for bracket abstraction","volume":"44","author":"Turner","year":"1979","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0020-0190(87)90183-9_BIB12","series-title":"Proc. Internat. Workshop on High-Level Computer Architecture","first-page":"5.26","article-title":"Combinator reduction machines","author":"Turner","year":"1984"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087901839?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087901839?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T05:52:14Z","timestamp":1553579534000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087901839"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,2]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,2]]}},"alternative-id":["0020019087901839"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90183-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,2]]}}}