{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:18Z","timestamp":1761611298670},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540156482"},{"type":"electronic","value":"9783540395270"}],"license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":[[1985]]},"DOI":"10.1007\/3-540-15648-8_17","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:20:41Z","timestamp":1330194041000},"page":"219-224","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Continuation semantics in typed lambda-calculi"],"prefix":"10.1007","author":[{"given":"Albert R.","family":"Meyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitchell","family":"Wand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"17_CR1","volume-title":"The Structure and Interpretation of Computer Programs","author":"H. Abelson","year":"1985","unstructured":"Abelson, H., and Sussman, G.J. The Structure and Interpretation of Computer Programs, MIT Press, Cambridge, MA, 1985."},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF00289507","volume":"1","author":"C.A.R. Hoare","year":"1972","unstructured":"Hoare, C.A.R., \u201cProving Correctness of Data Representations,\u201d Acta Informatica 1 (1972), 271\u2013281.","journal-title":"Acta Informatica"},{"key":"17_CR3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0019-9958(82)80087-9","volume":"52","author":"A.R. Meyer","year":"1982","unstructured":"Meyer, A.R. \u201cWhat Is a Model of the Lambda Calculus?\u201d Information and Control 52 (1982), 87\u2013122.","journal-title":"Information and Control"},{"key":"17_CR4","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. \u201cCall-by-Name, Call-by-Value and the \u03bb-Calculus,\u201d Theoret. Comp. Sci. 1 (1975) 125\u2013159.","journal-title":"Theoret. Comp. Sci."},{"key":"17_CR5","series-title":"Springer Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/978-3-662-21545-6_10","volume-title":"On the Relation between Direct and Continuation Semantics","author":"J.C. Reynolds","year":"1974","unstructured":"Reynolds, J.C. \u201cOn the Relation between Direct and Continuation Semantics,\u201d Proc. 2nd Colloq. on Automata, Languages, and Programming (Saarbrucken, 1974) Springer Lecture Notes in Computer Science, Vol. 14 (Berlin: Springer, 1974) 141\u2013156."},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1145\/322203.322216","volume":"27","author":"R. Sethi","year":"1980","unstructured":"Sethi, R. and Tang, A. \u201cConstructing Call-by-value Continuation Semantics,\u201d J. ACM 27 (1980), 580\u2013597.","journal-title":"J. ACM"},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0304-3975(81)90037-2","volume":"13","author":"J.E. Stoy","year":"1981","unstructured":"Stoy, J.E. \u201cThe Congruence of Two Programming Language Definitions,\u201d Theoret. Comp. Sci. 13 (1981), 151\u2013174.","journal-title":"Theoret. Comp. Sci."},{"key":"17_CR8","unstructured":"Strachey, C. and Wadsworth, C.P. \u201cContinuations: A Mathematical Semantics for Handling Full Jumps,\u201d Oxford University Computing Laboratory Technical Monograph PRG-11 (January, 1974)."},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Wand, M. \u201cA Types-as-Sets Semantics for Milner-style Polymorphism,\u201d Conf. Rec. 11th ACM Symp. on Principles of Programming Languages (1984), 158\u2013164.","DOI":"10.1145\/800017.800527"}],"container-title":["Lecture Notes in Computer Science","Logics of Programs"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15648-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:15:29Z","timestamp":1578525329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15648-8_17"}},"subtitle":["Summary"],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540156482","9783540395270"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-15648-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]},"assertion":[{"value":"31 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}