{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T15:23:49Z","timestamp":1648567429454},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1987,9,1]],"date-time":"1987-09-01T00:00:00Z","timestamp":557452800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[1987,9]]},"DOI":"10.1007\/bf03037465","type":"journal-article","created":{"date-parts":[[2009,4,23]],"date-time":"2009-04-23T23:07:16Z","timestamp":1240528036000},"page":"249-257","source":"Crossref","is-referenced-by-count":0,"title":["A fast algorithm for translating combinator expressions with BC-chains"],"prefix":"10.1007","volume":"5","author":[{"given":"Kohei","family":"Noshita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao -Xun","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF03037465_CR1","unstructured":"Aho, A., Hoperoft, J. and Ullman, J.,The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974."},{"key":"BF03037465_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\u201d,Information Processing Letters, 14, pp. 201\u2013204, 1982.","journal-title":"Information Processing Letters"},{"key":"BF03037465_CR3","series-title":"Report of School of computing Studies and Accountancy","volume-title":"The Complexity of a Translation of Lambda-Calculus to Combinators","author":"I. R. Kennaway","year":"1982","unstructured":"Kennaway, I. R., \u201cThe Complexity of a Translation of Lambda-Calculus to Combinators\u201d,Report of School of computing Studies and Accountancy, University of East Anglia, Norwich, 1982."},{"key":"BF03037465_CR4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0020-0190(87)90161-X","volume":"24","author":"J. R. Kennaway","year":"1987","unstructured":"Kennaway, J. R. and Sleep, M. R., \u201cVariable Abstraction in O (n log n) Space\u201d,Information Processing Letters, 24, pp. 343\u2013349, 1987.","journal-title":"Information Processing Letters"},{"key":"BF03037465_CR5","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 in O (n log n) Space\u201d,Information Processing Letters, 20, pp. 71\u201374, 1985.","journal-title":"Information Processing Letters"},{"key":"BF03037465_CR6","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF03037065","volume":"3","author":"K. Noshita","year":"1985","unstructured":"Noshita, K. and Hikita, T., The BC-Chain Method for Representing Combinators in Linear Space\u201d,New Generation Computing, 3, pp. 131\u2013144, 1985.","journal-title":"New Generation Computing"},{"key":"BF03037465_CR7","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0304-3975(76)90053-0","volume":"3","author":"R. L. Rivest","year":"1976","unstructured":"Rivest, R. L. and Vuillemin, J., \u201cOn Recognizing Graph Properties from Adjacency Matrices\u201d,Theoretical Computer Science, 3, pp. 371\u2013384, 1976.","journal-title":"Theoretical Computer Science"},{"key":"BF03037465_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\u201d,Journal of Symbolic Logic, 44, pp. 267\u2013270, 1979.","journal-title":"Journal of Symbolic Logic"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037465.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037465\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037465","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T20:52:38Z","timestamp":1558558358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037465"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,9]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,9]]}},"alternative-id":["BF03037465"],"URL":"https:\/\/doi.org\/10.1007\/bf03037465","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,9]]}}}