{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T11:04:47Z","timestamp":1649156687580},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1007\/bf01995103","type":"journal-article","created":{"date-parts":[[2005,8,10]],"date-time":"2005-08-10T10:40:23Z","timestamp":1123670423000},"page":"5-9","source":"Crossref","is-referenced-by-count":3,"title":["On list primitive recursion and the complexity of computinginf"],"prefix":"10.1007","volume":"32","author":[{"given":"Lo\u00efc","family":"Colson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01995103_CR1","unstructured":"S. C. Kleene,Introduction to Meta-mathematics. North Holland (1952)."},{"key":"BF01995103_CR2","first-page":"194","volume":"372","author":"L. Colson","year":"1989","unstructured":"L. Colson,About Primitive Recursive Algorithms Proceedings of the sixteenth International Colloquium on Automata, Languages and Programming, Eds. G. Ausiello, M. Dezani-Ciancaglini, S. Ronchi Della Rocca, Springer-Verlag LNCS 372, (1989) 194\u2013206.","journal-title":"LNCS"},{"key":"BF01995103_CR3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(85)90135-5","volume":"39","author":"C. B\u00f6hm","year":"1985","unstructured":"C. B\u00f6hm, A. Berarducci,Automatic synthesis of typed \u039b-programs on term algebras, Theoretical Computer Science 39 (1985) 135\u2013154.","journal-title":"Theoretical Computer Science"},{"key":"BF01995103_CR4","unstructured":"C. B\u00f6hm,Reducing Recursion to Iteration by Algebraic Extension, ESOP 86. Springer-Verlag LNCS 213."},{"key":"BF01995103_CR5","unstructured":"C. B\u00f6hm,Reducing Recursion to Iteration by Mean of Pairs and Tuples; Foundations of logic and functional programming. Springer-Verlag LNCS 306."}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01995103.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01995103\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01995103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T17:56:34Z","timestamp":1557770194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01995103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["BF01995103"],"URL":"https:\/\/doi.org\/10.1007\/bf01995103","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}