{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:40Z","timestamp":1725663460876},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540164425"},{"type":"electronic","value":"9783540397823"}],"license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16442-1_8","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:41:23Z","timestamp":1330195283000},"page":"111-118","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Reducing recursion to iteration by algebraic extension"],"prefix":"10.1007","author":[{"given":"Corrado","family":"B\u00f6hm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"B\u00f6hm,C. and Berarducci,A., Automatic Synthesis of typed \u039b-programs on Term Algebras, Theor. Comput. Science 39 (1985).","DOI":"10.1016\/0304-3975(85)90135-5"},{"issue":"4","key":"8_CR2","doi-asserted-by":"crossref","first-page":"505","DOI":"10.2307\/2270177","volume":"32","author":"M. D. Gladstone","year":"1967","unstructured":"Gladstone, M.D., A Reduction of the Recursion Scheme, J. of Symbolic Logic, 32, 4, 505\u2013508 (1967).","journal-title":"J. of Symbolic Logic"},{"key":"8_CR3","unstructured":"Gordon, M.J.C., An investigation of lit:where lit((A\n                1\n                ..., A\n                \n                  n\n                \n                ),A\n                n+1\n                , f)=f(A\n                1\n                ,f(A\n                2\n                ,..., f(A\n                \n                  n\n                \n                ,A\n                n+1\n                )...)), Memorandum MIP-R-101, School of AI, University of Edinburgh (1973)."},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1090\/S0002-9904-1947-08911-4","volume":"53","author":"M. L. Robinson","year":"1947","unstructured":"Robinson, M.L., Primitive recursive functions, Bulletin of Am. Math. Soc., 53, 925\u2013942 (1947).","journal-title":"Bulletin of Am. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","ESOP 86"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16442-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T00:12:01Z","timestamp":1578528721000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16442-1_8"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540164425","9783540397823"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-16442-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]},"assertion":[{"value":"29 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}