{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:13Z","timestamp":1725456013953},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354053010X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0024188","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T09:49:34Z","timestamp":1132393774000},"page":"238-254","source":"Crossref","is-referenced-by-count":2,"title":["Integrating strict and lazy evaluation: the \u03bbsl-calculus"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Asperti","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"S.Abramsky. The lazy \u03bb-calculus. Declarative Programming, D.Turner ed. Addison Wesley. 1989."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"M.Abadi, L.Cardelli, P.L.Curien, J.J.Levy. Explicit Substitutions. Proc. of the Conference on Principles of Programming Languages (POPL90). San Francisco. 1990.","DOI":"10.1145\/96709.96712"},{"key":"17_CR3","unstructured":"A.Asperti, G.Longo. Categories, Types and Structures. An introduction to category theory for the working computer scientist. M.I.T. Press. 1990."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"L.Cardelli. The Amber Machine. In Combinators and Functional Programming Languages. G.Cousineau, P.L.Curien, B.Robinet eds. LNCS 242. 1986.","DOI":"10.1007\/3-540-17184-3_39"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"G.Cousineau, P.L.Curien, M.Mauny. The Categorical Abstract Machine. Science of Computer Programming 8. 1987.","DOI":"10.1016\/0167-6423(87)90020-7"},{"key":"17_CR6","unstructured":"P.L.Curien. Categorical Combinators, Sequential Algorithms and Functional Programming. Pitman. 1986."},{"key":"17_CR7","unstructured":"P.L.Curien. The \u03bb\u03c1-calculus: an Abstract Framework for Environment Machines. Rapport de Recherche du LIENS 88-10. 1988."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"N.G.De Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation. Indag. Math. 34. 1972.","DOI":"10.1016\/1385-7258(72)90034-0"},{"key":"17_CR9","unstructured":"J.Fairbairn, S. Wray. A simple, Lazy, Abstract Machine to execute supercombinators. LNCS."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"J.Y.Girard. Linear Logic. Theoretical Computer Science, 50, 1987.","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"S. Hayashi. Adjunctions of Semifunctors: Categorical Structures in Nonextensional Lambda Calculus. Theoretical Computer Science 41. 1985.","DOI":"10.1016\/0304-3975(85)90062-3"},{"key":"17_CR12","unstructured":"M.Mauny. Compilation des Langages Foncionnels dans le Combinateurs Categoriques; Application au Langage ML. Th\u00e8se de Troisi\u00e8me Cycle, Universit\u00e9 Paris VII. 1985."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"G.Plotkin. Call-by-name, Call-by-value and the \u03bb-calculus. Theoretical Computer Science 1. 1975.","DOI":"10.1016\/0304-3975(75)90017-1"}],"container-title":["Lecture Notes in Computer Science","Programming Language Implementation and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024188.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:52:16Z","timestamp":1607550736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354053010X"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0024188","relation":{},"subject":[]}}