{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T04:46:06Z","timestamp":1764305166699,"version":"3.37.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["NGCO"],"published-print":{"date-parts":[[1985,6]]},"DOI":"10.1007\/bf03037065","type":"journal-article","created":{"date-parts":[[2009,4,17]],"date-time":"2009-04-17T02:48:54Z","timestamp":1239936534000},"page":"131-144","source":"Crossref","is-referenced-by-count":7,"title":["The BC-chain method for representing combinators in linear space"],"prefix":"10.1007","volume":"3","author":[{"given":"Kohei","family":"Noshita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Teruo","family":"Hikita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF03037065_CR1","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1017\/S0022481200051914","volume":"41","author":"S. K. Abdali","year":"1976","unstructured":"Abdali, S. K., \u201cAn abstraction algorithm for combinatory logic,\u201dJ. Symbolic Logic, 41, pp. 222\u2013224, 1976.","journal-title":"J. Symbolic Logic"},{"key":"BF03037065_CR2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(82)90014-X","volume":"14","author":"F. W. Burton","year":"1982","unstructured":"Burton, F. W., \u201cA linear space representation of functional programs to Turner combinators,\u201dInform. Process. Lett., 14, pp. 201\u2013204, 1982.","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"BF03037065_CR3","first-page":"164","volume":"7","author":"T. Hikita","year":"1984","unstructured":"Hikita, T., \u201cOn the average size of Turner\u2019s translation to combinator programs,\u201dJ. Inform. Process., 7, 3, pp. 164\u2013169, 1984.","journal-title":"J. Inform. Process."},{"key":"BF03037065_CR4","doi-asserted-by":"crossref","unstructured":"Hughes, R. J. M., \u201cSuper-Combinators,\u201dConf. Rec. of the 1982 ACM Symp. on LISP and Functional Programming, pp. 1\u201310, 1982.","DOI":"10.1145\/800068.802129"},{"key":"BF03037065_CR5","volume-title":"The complexity of a translation of \u03bb-calculus to combinators","author":"J. R. Kennaway","year":"1982","unstructured":"Kennaway, J. R., \u201cThe complexity of a translation of \u03bb-calculus to combinators,\u201d School of Computing Studies and Accountancy, Univ. of East Anglia, Norwich, 1982."},{"key":"BF03037065_CR6","unstructured":"Kennaway, J. R. and Sleep, M. R., \u201cEfficiency of counting director strings,\u201dtypescript, 1983."},{"key":"BF03037065_CR7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0020-0190(85)90066-3","volume":"20","author":"K. Noshita","year":"1985","unstructured":"Noshita, K., \u201cTranslation of Turner combinators inO(nlogn) space,\u201dInform. Process. Lett., 20, pp. 71\u201374, 1985.","journal-title":"Inform. Process. Lett."},{"key":"BF03037065_CR8","doi-asserted-by":"crossref","first-page":"267","DOI":"10.2307\/2273733","volume":"44","author":"D. A. Turner","year":"1979","unstructured":"Turner, D. A., \u201cAnother algorithm for bracket abstraction,\u201dJ. Symbolic Logic., 44, pp. 267\u2013270, 1979.","journal-title":"J. Symbolic Logic."},{"key":"BF03037065_CR9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"D. A. Turner","year":"1979","unstructured":"Turner, D. A., \u201cA new implementation technique for applicative languages,\u201dSoftw. Pract. Exper., 9, pp. 31\u201349, 1979.","journal-title":"Softw. Pract. Exper."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037065.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037065\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037065","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T00:35:55Z","timestamp":1739061355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037065"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["BF03037065"],"URL":"https:\/\/doi.org\/10.1007\/bf03037065","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"type":"print","value":"0288-3635"},{"type":"electronic","value":"1882-7055"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}