{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T06:17:56Z","timestamp":1648880276440},"reference-count":5,"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)90088-b","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"169-178","source":"Crossref","is-referenced-by-count":0,"title":["General recursive functions in a very simply interpretable typed \u03bb-calculus"],"prefix":"10.1016","volume":"121","author":[{"given":"G.","family":"Jacopini","sequence":"first","affiliation":[]},{"given":"G.","family":"Sontacchi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90088-B_BIB1","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0304-3975(79)90014-8","article-title":"A discrimination algorithm inside \u03bb\u03b2-calculus","volume":"8","author":"B\u00f6hm","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90088-B_BIB2","series-title":"Introduction to Combinators and \u03bb-Calculus","author":"Hindley","year":"1986"},{"key":"10.1016\/0304-3975(93)90088-B_BIB3","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","article-title":"LCF as a programming language","volume":"5","author":"Plotkin","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90088-B_BIB4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(78)90006-5","article-title":"T\u03c9 as a universal domain","volume":"17","author":"Plotkin","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90088-B_BIB5","series-title":"Logic, Methodology and Philos. Sci.","first-page":"1","article-title":"Models for various type-free calculi","author":"Scott","year":"1973"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390088B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390088B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:25:18Z","timestamp":1555129518000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390088B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":5,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["030439759390088B"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90088-b","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}