{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T20:26:13Z","timestamp":1648585573673},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,10,1]],"date-time":"1996-10-01T00:00:00Z","timestamp":844128000000},"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":["Journal of Systems and Software"],"published-print":{"date-parts":[[1996,10]]},"DOI":"10.1016\/0164-1212(95)00095-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:26:53Z","timestamp":1027636013000},"page":"29-41","source":"Crossref","is-referenced-by-count":2,"title":["Space-efficient memo-functions"],"prefix":"10.1016","volume":"35","author":[{"given":"Hessam","family":"Khoshnevisan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamad","family":"Afshar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/0164-1212(95)00095-X_BIB1","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","article-title":"Can Programming Be Liberated from the Von Neumann Style?","volume":"21","author":"Backus","year":"1978","journal-title":"Communications of the ACM"},{"key":"10.1016\/0164-1212(95)00095-X_BIB2","first-page":"1","volume":"vol. 107","author":"Backus","year":"1981"},{"issue":"1","key":"10.1016\/0164-1212(95)00095-X_BIB3","doi-asserted-by":"crossref","DOI":"10.1145\/321992.321996","article-title":"A Transformation System for Developing Recursive Programs","volume":"24","author":"Burstall","year":"1977","journal-title":"Journal of the ACM"},{"key":"10.1016\/0164-1212(95)00095-X_BIB4","article-title":"Efficient implementation of functional programs","author":"Bailey","year":"1986"},{"issue":"4","key":"10.1016\/0164-1212(95)00095-X_BIB5","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":"ACM Computing Surveys"},{"issue":"1","key":"10.1016\/0164-1212(95)00095-X_BIB6","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1145\/359863.359889","article-title":"Improving Programs by the Introduction of Recursion","volume":"20","author":"Bird","year":"1977","journal-title":"Communications of the ACM"},{"key":"10.1016\/0164-1212(95)00095-X_BIB7","series-title":"Proceedings of the 1st International LISP Conference","first-page":"136","article-title":"Hope: an Experimental Applicative Language","author":"Burstall","year":"1980"},{"key":"10.1016\/0164-1212(95)00095-X_BIB8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1145\/2166.2167","article-title":"Eliminating Redundant Recursive Calls","volume":"5","author":"Cohen","year":"1983","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"10.1016\/0164-1212(95)00095-X_BIB9","doi-asserted-by":"crossref","DOI":"10.1007\/BF00264597","article-title":"A Synthesis of Several Sorting Programs","volume":"11","author":"Darlington","year":"1978","journal-title":"Acta Informatica"},{"issue":"2","key":"10.1016\/0164-1212(95)00095-X_BIB10","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1093\/comjnl\/35.2.138","article-title":"The mechanical transformation of data types","volume":"35","author":"Harrison","year":"1992","journal-title":"The Computer Journal"},{"key":"10.1016\/0164-1212(95)00095-X_BIB11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0304-3975(92)90213-Y","article-title":"A new approach to recursion removal","volume":"93","author":"Harrison","year":"1992","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0164-1212(95)00095-X_BIB12","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01185679","article-title":"On the synthesis of function inverses","volume":"29","author":"Harrison","year":"1992","journal-title":"Acta Informatica"},{"key":"10.1016\/0164-1212(95)00095-X_BIB13","series-title":"An introduction to performance modelling","author":"Harrison","year":"1992"},{"key":"10.1016\/0164-1212(95)00095-X_BIB14","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02983374","article-title":"Efficient Memo-Table Management Strategies","volume":"28","author":"Khoshnevisan","year":"1990","journal-title":"Acta Informatica"},{"key":"10.1016\/0164-1212(95)00095-X_BIB15","series-title":"Proceedings: Conference on Concurrent Systems and Parallel Computation","first-page":"119","article-title":"Comparative Schematology, Record of Project Mac","author":"Paterson","year":"1970"}],"container-title":["Journal of Systems and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016412129500095X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016412129500095X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T05:52:45Z","timestamp":1555653165000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016412129500095X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["016412129500095X"],"URL":"https:\/\/doi.org\/10.1016\/0164-1212(95)00095-x","relation":{},"ISSN":["0164-1212"],"issn-type":[{"value":"0164-1212","type":"print"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}