{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T05:42:12Z","timestamp":1772084532713,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1974,12,1]],"date-time":"1974-12-01T00:00:00Z","timestamp":155088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":14108,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1974,12]]},"DOI":"10.1016\/s0022-0000(74)80048-6","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T09:46:40Z","timestamp":1289382400000},"page":"332-354","source":"Crossref","is-referenced-by-count":71,"title":["Correct and optimal implementations of recursion in a simple programming language"],"prefix":"10.1016","volume":"9","author":[{"given":"Jean","family":"Vuillemin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(74)80048-6_bib1","doi-asserted-by":"crossref","DOI":"10.1145\/800235.807072","article-title":"Recursive definitions of partial functions and their computations","author":"Cadiou","year":"1972"},{"key":"10.1016\/S0022-0000(74)80048-6_bib2","article-title":"A preliminary theory of parallel programs","author":"Kahn","year":"1973","journal-title":"Rapport LABORIA, IRIA, 78-Rocquencourt, France"},{"key":"10.1016\/S0022-0000(74)80048-6_bib3","first-page":"28","article-title":"Design of the B5000 system","volume":"7","author":"Lonergan","year":"1961","journal-title":"Datamation"},{"key":"10.1016\/S0022-0000(74)80048-6_bib4","article-title":"Lambda-Calculus Models of Programming Languages","author":"Morris","year":"1968"},{"key":"10.1016\/S0022-0000(74)80048-6_bib5","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/321738.321750","article-title":"Tree-manipulating systems and Church-Rosser theorems","volume":"20","author":"Rosen","year":"1973","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(74)80048-6_bib6","article-title":"Outline of a Mathematical Theory of Computation","author":"Scott","year":"1970"},{"key":"10.1016\/S0022-0000(74)80048-6_bib7","article-title":"Syntaxe, S\u00e9mantique et Axiomatique d'un langage de Programmation Simple","author":"Vuillemin","year":"1974","journal-title":"Th\u00e8se d'\u00c9tat, Rapport LABORIA IRIA, 78150 Rocquencourt, France"},{"key":"10.1016\/S0022-0000(74)80048-6_bib8","author":"Wadsworth","year":"1971"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800486?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800486?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T05:11:51Z","timestamp":1559797911000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000074800486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,12]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1974,12]]}},"alternative-id":["S0022000074800486"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(74)80048-6","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1974,12]]}}}