{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T23:24:28Z","timestamp":1648682668430},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"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":10790,"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":[[1984]]},"DOI":"10.1016\/0304-3975(84)90123-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"31-40","source":"Crossref","is-referenced-by-count":3,"title":["On combinatory algebras and their expansions"],"prefix":"10.1016","volume":"31","author":[{"given":"Kim","family":"Bruce","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Longo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(84)90123-3_BIB1","doi-asserted-by":"crossref","DOI":"10.1016\/S0049-237X(08)71252-7","article-title":"Frege structures and the notion of proposition, truth, and set","author":"Aczel","year":"1980"},{"key":"10.1016\/0304-3975(84)90123-3_BIB2","series-title":"The Lambda Calculus: Its Syntax and Semantics","author":"Barendregt","year":"1981"},{"key":"10.1016\/0304-3975(84)90123-3_BIB3","unstructured":"H. Barendregt, Lambda calculus and its models, in: Lolli, Longo and Marcja, eds. Logic Colloquim '82 (North-Holland, Amsterdam) to appear."},{"key":"10.1016\/0304-3975(84)90123-3_BIB4","article-title":"Recursion theoretic operators and morphisms on numbered sets","author":"Barendregt","year":"1981","journal-title":"Fund. Math"},{"key":"10.1016\/0304-3975(84)90123-3_BIB5","series-title":"On the definition of lambda-calculus models","author":"Berry","year":"1981"},{"key":"10.1016\/0304-3975(84)90123-3_BIB6","first-page":"289","article-title":"Algebras and combinators","author":"Engeler","year":"1981","journal-title":"Algebra Universalis"},{"issue":"4","key":"10.1016\/0304-3975(84)90123-3_BIB7","doi-asserted-by":"crossref","DOI":"10.1007\/BF02218570","article-title":"The theory of A-spaces","volume":"12","author":"Ershov","year":"1973","journal-title":"Algebra and Logic"},{"key":"10.1016\/0304-3975(84)90123-3_BIB8","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/malq.19800261902","article-title":"Lambda calculus models and extensionality","volume":"26","author":"Hindley","year":"1980","journal-title":"Zeit. Math. Logik. Grund. Math."},{"key":"10.1016\/0304-3975(84)90123-3_BIB9","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/S0019-9958(82)90796-3","article-title":"Models of the \u03bb-calculus","volume":"52","author":"Koymans","year":"1982","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(84)90123-3_BIB10","article-title":"Set theoretical models of \u03bb-calculus: Theories, expansions, isomorphisms","author":"Longo","year":"1983","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/0304-3975(84)90123-3_BIB11","series-title":"Nota Scientifica S-83-12","article-title":"Computability in higher types and the universal domain P\u03c9","author":"Longo","year":"1983"},{"key":"10.1016\/0304-3975(84)90123-3_BIB12","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0019-9958(82)80087-9","article-title":"What is a model of the lambda calculus?","volume":"12","author":"Meyer","year":"1982","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(84)90123-3_BIB13","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","article-title":"Data types as Lattices","volume":"5","author":"Scott","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(84)90123-3_BIB14","series-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Languages Theory","author":"Stoy","year":"1977"},{"key":"10.1016\/0304-3975(84)90123-3_BIB15","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584901233?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584901233?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:51:07Z","timestamp":1555127467000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397584901233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1984]]}},"alternative-id":["0304397584901233"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(84)90123-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}