{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:19:37Z","timestamp":1794338377407,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540133728","type":"print"},{"value":"9783540389293","type":"electronic"}],"license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/bfb0030322","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T10:19:29Z","timestamp":1138184369000},"page":"397-406","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["G\u00f6del numberings, principal morphisms, combinatory algebras"],"prefix":"10.1007","author":[{"given":"G.","family":"Longo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"E.","family":"Moggi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,21]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Barendregt H. (1983) \"Lambda-calculus and its models\" in Proceedings of Logic Colloquium 82 (Lolli, Longo, Marcja eds), North-Holland.","DOI":"10.1016\/S0049-237X(08)71818-4"},{"key":"37_CR2","unstructured":"Barendregt H. (1984) The lambda-calculus: its syntax and semantics, revised and expanded edition, North-Holland."},{"key":"37_CR3","volume-title":"Some Syntactic and Categorial Constructions of \u03bb-calculus models","author":"G. Berry","year":"1979","unstructured":"Berry G. (1979) \"Some Syntactic and Categorial Constructions of \u03bb-calculus models\" INRIA, Valbonne."},{"key":"37_CR4","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/malq.19800261902","volume":"26","author":"R. Hindley","year":"1980","unstructured":"Hindley R., Longo G. (1980) \"Lambda-calculus models and extensionality\" Zeit. Math. Logik 26 (289\u2013310).","journal-title":"Zeit. Math. Logik"},{"key":"37_CR5","unstructured":"Hindley R., Seldin J. (198?) Introductory book on lambda-calculus and CL (in preparation)."},{"key":"37_CR6","volume-title":"Hereditary Partial Effective Functionals in any finite type","author":"G. Longo","year":"1982","unstructured":"Longo G. (1982) \"Hereditary Partial Effective Functionals in any finite type\" (Preliminary note), Forschungsinst. Math. ETH, Z\u00fcrich."},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Longo, G., Moggi E. (1983) \"The Hereditary Partial Effective Functionals and Recursion Theory in Higher Types\" J. Symb. Logic (to appear).","DOI":"10.2307\/2274281"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Longo G., Moggi E. (1984) \"Carlesian Closed Categories for effective type structures\" Part I Symp. Semantics Data Types, LNCS, Springer-Verlag (to appear).","DOI":"10.1007\/3-540-13346-1_12"},{"issue":"1","key":"37_CR9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0019-9958(82)80087-9","volume":"52","author":"A. Meyer","year":"1982","unstructured":"Meyer A. (1982) \"What is a model of lambda-calculus?\" Info. Contr. 52, 1 (87\u2013122).","journal-title":"Info. Contr."},{"issue":"2","key":"37_CR10","first-page":"209","volume":"17","author":"G. Plotkin","year":"1978","unstructured":"Plotkin G. (1978) \"T\u03c9 as a universal domains\" JCSS 17, 2 (209\u2013236).","journal-title":"JCSS"},{"key":"37_CR11","unstructured":"Scott D.S. (1980) \"Relating theories of lambda-calculus\" in To H.B. Curry: essays... (Hindley, Seldin eds.), Academic Press (403\u2013450)."},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Scott D.S. (1982) \"Some ordered sets in Computer Science\" Ordered sets (Rival ed.), Reidel.","DOI":"10.1007\/978-94-009-7798-3_22"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1984"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030322","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T14:45:25Z","timestamp":1578494725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030322"}},"subtitle":["A category-theoretic characterization of functional completeness"],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133728","9783540389293"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0030322","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0030285","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984]]},"assertion":[{"value":"21 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}