{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T07:41:43Z","timestamp":1648539703179},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,5,1]],"date-time":"1995-05-01T00:00:00Z","timestamp":799286400000},"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":6652,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1995,5]]},"DOI":"10.1016\/0168-0072(94)00022-u","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:00:28Z","timestamp":1027648828000},"page":"3-9","source":"Crossref","is-referenced-by-count":1,"title":["Enumerators of lambda terms are reducing constructively"],"prefix":"10.1016","volume":"73","author":[{"given":"Henk","family":"Barendregt","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(94)00022-U_BIB1","series-title":"Studies in Logic and the Foundations of Mathematics","doi-asserted-by":"crossref","DOI":"10.1016\/S0049-237X(08)71818-4","article-title":"The Lambda Calculus, its Syntax and Semantics","author":"Barendregt","year":"1984"},{"issue":"2","key":"10.1016\/0168-0072(94)00022-U_BIB2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1017\/S0956796800000356","article-title":"Theoretical pearls: Enumerators of lambda terms are reducing","volume":"2","author":"Barendregt","year":"1992","journal-title":"J. Funct. Programming"},{"issue":"3","key":"10.1016\/0168-0072(94)00022-U_BIB3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1017\/S0956796800000447","article-title":"Theoretical pearls: Representing \u2018undefined\u2019 in lambda calculus","volume":"2","author":"Barendregt","year":"1992","journal-title":"J. Funct. Programming"},{"key":"10.1016\/0168-0072(94)00022-U_BIB4","series-title":"Theory of recursive functions and effective computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0168-0072(94)00022-U_BIB5","series-title":"Two recursion theoretic problems in lambda calculus","author":"Statman","year":"1987"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729400022U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729400022U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T04:58:37Z","timestamp":1555304317000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016800729400022U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,5]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,5]]}},"alternative-id":["016800729400022U"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(94)00022-u","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1995,5]]}}}