{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:49Z","timestamp":1725664009754},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540555117"},{"type":"electronic","value":"9783540471943"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55511-0_2","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:09:02Z","timestamp":1330250942000},"page":"41-53","source":"Crossref","is-referenced-by-count":0,"title":["Call-by-value combinatory logic and the lambda-value calculus"],"prefix":"10.1007","author":[{"given":"John","family":"Gateley","sequence":"first","affiliation":[]},{"given":"Bruce F.","family":"Duba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"2_CR1","volume-title":"Studies in Logic and the Foundations of Mathematics 103","author":"H. Barendregt","year":"1984","unstructured":"H. Barendregt. The Lambda Calculus: Its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics 103. North-Holland, Amsterdam, revised edition, 1984.","edition":"revised edition"},{"key":"2_CR2","volume-title":"Recursive Programming Techniques","author":"W. Burge","year":"1975","unstructured":"W. Burge. Recursive Programming Techniques. Addison-Wesley, Reading, Mass., 1975."},{"key":"2_CR3","volume-title":"The Calculi of Lambda-Conversion","author":"A. Church","year":"1941","unstructured":"A. Church. The Calculi of Lambda-Conversion. Princeton University Press, Princeton, 1941."},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"509","DOI":"10.2307\/2370619","volume":"52","author":"H. B. Curry","year":"1930","unstructured":"H. B. Curry. Grundlagen der kombinatorischen Logik. Amer. J. Math, 52:509\u2013536; 789\u2013834, 1930.","journal-title":"Amer. J. Math"},{"unstructured":"H. B. Curry and R. Feys. Combinatory Logic, volume 1. North Holland, 1958.","key":"2_CR5"},{"doi-asserted-by":"crossref","unstructured":"N. D. Goodman. A simplification of combinatory logic. Journal of Symbolic Logic, 37(2), 1972.","key":"2_CR6","DOI":"10.2307\/2272970"},{"doi-asserted-by":"crossref","unstructured":"P. Hudak and B. Goldberg. Serial Combinators: \u201cOptimal\u201d Grains of Parallelism. In Proc of Conf. on Functional Prog. Langs. and Comp. Arch., 1985.","key":"2_CR7","DOI":"10.1007\/3-540-15975-4_49"},{"doi-asserted-by":"crossref","unstructured":"R. Hughes. Super-combinators: A new implementation method for applicative languages. In Sym. on Lisp and Functional Prog., pages 1\u201310. ACM, Aug 1982.","key":"2_CR8","DOI":"10.1145\/800068.802129"},{"issue":"4","key":"2_CR9","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1145\/48022.48026","volume":"10","author":"R. Kennaway","year":"1988","unstructured":"Kennaway, R. and R. Sleep. Director strings as combinators. ACM Trans. Prog. Lang. Syst., 10(4):602\u2013626, 1988.","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF01448013","volume":"92","author":"M. Sch\u00f6nfinkel","year":"1924","unstructured":"M. Sch\u00f6nfinkel. \u00fcber die Bausteine der Mathematischen Logik. Math. Annalen, 92:305\u2013316, 1924.","journal-title":"Math. Annalen"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0019-9958(82)80087-9","volume":"52","author":"A. Meyer","year":"1982","unstructured":"A. Meyer. What is a model of the lambda calculus? Information and Control, 52:87\u2013122, 1982.","journal-title":"Information and Control"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G. Plotkin","year":"1975","unstructured":"G. Plotkin. Call-by-name, call-by-value, and the \u03bb-calculus. Theoretical Computer Science, 1:125\u2013159, 1975.","journal-title":"Theoretical Computer Science"},{"key":"2_CR13","volume-title":"To Mock a Mockingbird and Other Logic Puzzles","author":"R. Smullyan","year":"1985","unstructured":"R. Smullyan. To Mock a Mockingbird and Other Logic Puzzles. Alfred A. Knopf, Inc., New York, 1985."},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"D. A. Turner","year":"1979","unstructured":"D. A. Turner. A new implementation technique for applicative languages. Software\u2014Practice and Experience, 9:31\u201349, 1979.","journal-title":"Software\u2014Practice and Experience"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Programming Semantics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55511-0_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:59:18Z","timestamp":1605646758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55511-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540555117","9783540471943"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-55511-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}