{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T09:39:11Z","timestamp":1648805951899},"reference-count":9,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"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":7168,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0304-3975(93)90096-c","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"441-448","source":"Crossref","is-referenced-by-count":5,"title":["Some examples of non-existent combinators"],"prefix":"10.1016","volume":"121","author":[{"given":"Rick","family":"Statman","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90096-C_BIB1","series-title":"The Lambda Calculus","author":"Barendregt","year":"1985"},{"key":"10.1016\/0304-3975(93)90096-C_BIB2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(93)90084-7","article-title":"Some new results on easy lambda-terms","volume":"121","author":"Berarducci","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90096-C_BIB3","volume":"Vol. 1","author":"Curry","year":"1958"},{"key":"10.1016\/0304-3975(93)90096-C_BIB4","series-title":"To Mock a Mockingbird","author":"Smullyan","year":"1985"},{"key":"10.1016\/0304-3975(93)90096-C_BIB5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(89)90148-5","article-title":"On sets of solutions to combinator equations","volume":"66","author":"Statman","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90096-C_BIB6","unstructured":"R. Statman, There is no hyperrecurrent S,K combinator, Carnegie Mellon Dept. of Math. Tech. Report 91-133."},{"key":"10.1016\/0304-3975(93)90096-C_BIB7","author":"Venturini-Zilli","year":"1979","journal-title":"Recurrence and head recurrence in weak combinatory logic and lambda calculus IAC Report"},{"key":"10.1016\/0304-3975(93)90096-C_BIB8","series-title":"Essays on Combinatory Logic, Lambda Calculus, and Formalism","first-page":"259","article-title":"Numerations, lambda calculus, and arithmetic","author":"Visser","year":"1980"},{"key":"10.1016\/0304-3975(93)90096-C_BIB9","article-title":"The absence and presence of fixed point combinators","author":"Wos","year":"1988","journal-title":"Preprint Math. & C. S. Argonne Nat. Labs"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390096C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390096C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:25:10Z","timestamp":1555115110000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390096C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":9,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["030439759390096C"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90096-c","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}