{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T23:55:57Z","timestamp":1698018957623},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,4,1]],"date-time":"1987-04-01T00:00:00Z","timestamp":544233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T00:00:00Z","timestamp":1376697600000},"content-version":"vor","delay-in-days":9635,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1987,4]]},"DOI":"10.1016\/0167-6423(87)90017-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:09:22Z","timestamp":1027642162000},"page":"113-137","source":"Crossref","is-referenced-by-count":3,"title":["A formal development of an efficient supercombinator compiler"],"prefix":"10.1016","volume":"8","author":[{"given":"R.S.","family":"Bird","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0167-6423(87)90017-7_BIB1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1145\/356827.356831","article-title":"Tabulation techniques for recursive programs","volume":"12","author":"Bird","year":"1980","journal-title":"Comput. Surveys"},{"key":"10.1016\/0167-6423(87)90017-7_BIB2","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF00264249","article-title":"Using circular programs to eliminate multiple traversals of data","volume":"21","author":"Bird","year":"1984","journal-title":"Acta Informat."},{"key":"10.1016\/0167-6423(87)90017-7_BIB3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0167-6423(86)90023-7","article-title":"Transformational programming and the paragraph problem","volume":"6","author":"Bird","year":"1986","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(87)90017-7_BIB4","series-title":"Report CSR-62-80","article-title":"HOPE: an experimental applicative language","author":"Burstall","year":"1980"},{"key":"10.1016\/0167-6423(87)90017-7_BIB5","first-page":"1","article-title":"Super-combinators: a new implementation method for applicative languages","author":"Hughes","year":"1982","journal-title":"Proc. ACM Symposium on Lisp and Functional Programming"},{"key":"10.1016\/0167-6423(87)90017-7_BIB6","series-title":"D. Phil Thesis","article-title":"The design and implementation of programming languages","author":"Hughes","year":"1983"},{"key":"10.1016\/0167-6423(87)90017-7_BIB7","first-page":"184","article-title":"A proposal for standard ML","author":"Milner","year":"1984","journal-title":"Proc. ACM Symposium on Lisp and Functional Programming"},{"key":"10.1016\/0167-6423(87)90017-7_BIB8","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0167-6423(85)90009-7","article-title":"Verifying the unification algorithm in LCF","volume":"5","author":"Paulson","year":"1985","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(87)90017-7_BIB9","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"},{"key":"10.1016\/0167-6423(87)90017-7_BIB10","series-title":"Functional Programming and its Applications","first-page":"1","article-title":"Recursion equations as a programming language","author":"Turner","year":"1981"},{"key":"10.1016\/0167-6423(87)90017-7_BIB11","series-title":"Programming Research Group","article-title":"An introduction to Orwell","author":"Wadler","year":"1985"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642387900177?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642387900177?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:50:48Z","timestamp":1555077048000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642387900177"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,4]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,4]]}},"alternative-id":["0167642387900177"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(87)90017-7","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1987,4]]}}}