{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T22:06:03Z","timestamp":1657577163983},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,2,1]],"date-time":"1985-02-01T00:00:00Z","timestamp":476064000000},"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":[[1985,2]]},"DOI":"10.1016\/0020-0190(85)90066-3","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"71-74","source":"Crossref","is-referenced-by-count":8,"title":["Translation of Turner Combinators in O(n log n) space"],"prefix":"10.1016","volume":"20","author":[{"given":"Kohei","family":"Noshita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0020-0190(85)90066-3_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(85)90066-3_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(85)90066-3_BIB3","series-title":"Conf. Rec. 1982 ACM Symp. on LISP and Functional Programming","first-page":"1","article-title":"Super-combinators","author":"Hughes","year":"1982"},{"key":"10.1016\/0020-0190(85)90066-3_BIB4","article-title":"The complexity of a translation of \u03bb-calculus to combinators","author":"Kennaway","year":"1982"},{"key":"10.1016\/0020-0190(85)90066-3_BIB5","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(85)90066-3_BIB6","doi-asserted-by":"crossref","first-page":"267","DOI":"10.2307\/2273733","article-title":"Another algorithm for bracket abstraction","volume":"44","author":"Turner","year":"1978","journal-title":"J. Symbolic Logic"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085900663?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085900663?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:26:20Z","timestamp":1553577980000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019085900663"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,2]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,2]]}},"alternative-id":["0020019085900663"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(85)90066-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1985,2]]}}}