{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:15Z","timestamp":1725663555064},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540543459"},{"type":"electronic","value":"9783540475798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54345-7_59","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:41:57Z","timestamp":1330191717000},"page":"161-169","source":"Crossref","is-referenced-by-count":1,"title":["The lazy call-by-value \u03bb-calculus"],"prefix":"10.1007","author":[{"given":"Lavinia","family":"Egidi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Furio","family":"Honsell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simona","family":"Ronchi della Rocca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"16_CR1","unstructured":"Abramsky S. The lazy lambda calculus, in: D. Turner (ed.) Declarative programming, Addison-Wesley, 1988."},{"issue":"4","key":"16_CR2","doi-asserted-by":"crossref","first-page":"931","DOI":"10.2307\/2273659","volume":"48","author":"H. Barendregt","year":"1983","unstructured":"Barendregt H., Coppo M., Dezani M. A filter lambda model and the completeness of type assignment, The J. of Symbolic Logic, 48, no. 4, 1983, 931\u2013940.","journal-title":"The J. of Symbolic Logic"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Honsell F., Ronchi Della Rocca S. An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus, J. of Computer and System Sciences, to appear.","DOI":"10.1016\/0022-0000(92)90040-P"},{"issue":"2","key":"16_CR4","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1112\/jlms\/s2-12.3.361","volume":"12","author":"M. Hyland","year":"1976","unstructured":"Hyland M. A syntactic characterization of the equality in some models for the lambda calculus, J. of the London Mathematical Society (2), 12, 1976, 361\u2013370.","journal-title":"J. of the London Mathematical Society"},{"issue":"4","key":"16_CR5","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"P.J. Landin","year":"1964","unstructured":"Landin P.J. The mechanical evaluation of expressions, Computer J. 6, no. 4, 1964, p. 308\u2013320.","journal-title":"Computer J."},{"key":"16_CR6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0022-0000(86)90041-3","volume":"33","author":"K. Mulmuley","year":"1986","unstructured":"Mulmuley K. Fully abstract submodels of typed lambda calculus, J. of Computer and System Sciences, 33, 1986, 2\u201346.","journal-title":"J. of Computer and System Sciences"},{"key":"16_CR7","unstructured":"Ong C.-H. L. The lazy lambda calculus: an investigation into the foundations of functional programming, Ph.D. thesis, Imperial College of Science and Technology, University of London, 1988."},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"Plotkin G.D. Call-by-name, call-by-value and the \u03bb-calculus, Theoretical Computer Science, 1, 1975, 125\u2013159.","journal-title":"Theoretical Computer Science"},{"key":"16_CR9","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G.D. Plotkin","year":"1977","unstructured":"Plotkin G.D. LCF, considered as a Programming Language, Theoretical Computer Science, 5, 1977, 223\u2013255.","journal-title":"Theoretical Computer Science"},{"key":"16_CR10","unstructured":"Plotkin G.D. Personal communication."},{"issue":"3","key":"16_CR11","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0205036","volume":"5","author":"C.P. Wadsworth","year":"1976","unstructured":"Wadsworth C.P. The relation between computational and denotational properties for Scott's D\n\u221e-models of the \u03bb-calculus, SIAM J. of Computing, 5, no.3, 1976, 488.","journal-title":"SIAM J. of Computing"},{"key":"16_CR12","unstructured":"Boudol G. Lambda-Calculi for (strict) Parallel Functions, INRIA preprint 1991."},{"key":"16_CR13","unstructured":"Pino-Perez R. A Strict partial combinatory algebra which modelizes Partial Lambda Calculus, preprint 1991."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1991"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54345-7_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:20:58Z","timestamp":1619558458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54345-7_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540543459","9783540475798"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-54345-7_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}