{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:20:01Z","timestamp":1754486401077},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442400"},{"type":"electronic","value":"9783540457930"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45793-3_16","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T12:03:26Z","timestamp":1187265806000},"page":"232-246","source":"Crossref","is-referenced-by-count":18,"title":["Possible World Semantics for General Storage in Call-By-Value"],"prefix":"10.1007","author":[{"given":"Paul Blain","family":"Levy","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, A., Appel, A., Virga, R.: A stratified semantics of general references embeddable in higher-order logic. In: Proceedings of IEEE Symposium on Logic in Computer Science, Copehagen, 2002. (2002) to appear","DOI":"10.1109\/LICS.2002.1029818"},{"key":"16_CR2","unstructured":"Kelsey, R., Clinger, W., (Editors), J.R.: Revised5 report on the algorithmic language Scheme. ACM SIGPLAN Notices 33 (1998) 26\u201376"},{"key":"16_CR3","unstructured":"Moggi, E.: An abstract view of programming languages. Technical Report ECS-LFCS-90-113, Dept. of Computer Science, Edinburgh Univ. (90)"},{"key":"16_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of Foundations of Software Science and Computation Structures, Grenoble, France (FoSSaCS\u2019 02)","author":"G.D. Plotkin","year":"2002","unstructured":"Plotkin, G.D., Power, A. J.: Notions of computation determine monads. In: Proceedings of Foundations of Software Science and Computation Structures, Grenoble, France (FoSSaCS\u2019 02). LNCS (2002) to appear"},{"key":"16_CR5","unstructured":"Stark, I. D.B.: Names and Higher-Order Functions. PhD thesis, University of Cambridge (1994)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Honda, K., McCusker, G.: A fully abstract game semantics for general references. Proceedings, Thirteenth Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press (1998)","DOI":"10.1109\/LICS.1998.705669"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Information and Computation 93 (1991) 55\u201392","journal-title":"Information and Computation"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/inco.1996.0052","volume":"127","author":"A. M. Pitts","year":"1996","unstructured":"Pitts, A. M.: Relational properties of domains. Information and Computation 127 (1996) 66\u201390 (A preliminary version of this work appeared as Cambridge Univ. Computer Laboratory Tech. Rept. No. 321, December 1993.)","journal-title":"Information and Computation"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Smyth, M., Plotkin, G.D.: The category-theoretic solution of recursive domain equations. SIAM J. Computing 11 (1982)","DOI":"10.1137\/0211062"},{"key":"16_CR10","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Theoretical Aspects of Computer Software. International Symposium TACS\u201994","author":"S. Abramsky","year":"1994","unstructured":"Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF (extended abstract). In Hagiya, M., Mitchell, J. C., eds.: Theoretical Aspects of Computer Software. International Symposium TACS\u201994. Volume 789 of LNCS., Sendai, Japan, Springer-Verlag (1994) 1\u201315"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Stark, I.: A fully abstract domain model for the \u03c0-calculus. In: Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press (1996) 36\u201342","DOI":"10.1109\/LICS.1996.561301"},{"key":"16_CR12","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BFb0084215","volume-title":"Proc. 1990 Como Category Theory Conference","author":"P. J. Freyd","year":"1991","unstructured":"Freyd, P. J.: Algebraically complete categories. In Carboni, A., et al., eds.: Proc. 1990 Como Category Theory Conference, Berlin, Springer-Verlag (1991) 95\u2013104 Lecture Notes in Mathematics Vol. 1488"},{"key":"16_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1007\/3-540-48523-6_59","volume-title":"Proc. ICALP\u2019 99","author":"A. J. Power","year":"1999","unstructured":"Power, A. J., Thielecke, H.: Closed Freyd-and kappa-categories. In: Proc. ICALP\u2019 99. Volume 1644 of LNCS., Springer-Verlag, Berlin (1999) 625\u2013634"},{"key":"16_CR14","unstructured":"Jung, A.: Colimits in DCPO. 3-page manuscript, available by fax (1990)"},{"key":"16_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-48959-2_17","volume-title":"Typed Lambda-Calculi and Applications","author":"P.B. Levy","year":"1999","unstructured":"Levy, P.B.: Call-by-push-value: a subsuming paradigm (extended abstract). In Girard, J.Y., ed.: Typed Lambda-Calculi and Applications. Volume 1581 of LNCS., Springer (1999) 228\u2013242"},{"key":"16_CR16","volume-title":"PhD thesis","author":"P. B. Levy","year":"2001","unstructured":"Levy, P. B.: Call-by-push-value. PhD thesis, Queen Mary, University of London (2001)"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1145\/174675.175187","volume-title":"Proceedings of 21st Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL)","author":"M. Odersky","year":"1994","unstructured":"Odersky, M.: A functional theory of local names. In ACM, ed.: Proceedings of 21st Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL), New York, NY, USA, ACM Press (1994) 48\u201359"},{"key":"16_CR18","unstructured":"O\u2019Hearn, P. W., Tennent, R. D.: Semantics of local variables. In Fourman, M. P., Johnstone, P. T., Pitts, A.M., eds.: Applications of Categories in Computer Science. Proceedings of the LMS Symposium, Durham July 1991, Cambridge University Press (1992) 217\u2013238"},{"key":"16_CR19","unstructured":"Oles, F. J.: A Category-Theoretic Approach to the Semantics of Programming Languages. Ph. D. dissertation, Syracuse University (1982)"},{"key":"16_CR20","first-page":"345","volume-title":"Algorithmic Languages","author":"J. C. Reynolds","year":"1981","unstructured":"Reynolds, J. C.: The essence of Algol. In de Bakker, J. W., van Vliet, J. C., eds.: Algorithmic Languages, Amsterdam, North-Holland (1981) 345\u2013372"},{"key":"16_CR21","volume-title":"Master\u2019s thesis","author":"D.R. Ghica","year":"1997","unstructured":"Ghica, D.R.: Semantics of dynamic variables in algol-like languages. Master\u2019s thesis, Queens\u2019 University, Kingston,Ontario (1997)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45793-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T03:55:17Z","timestamp":1550807717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45793-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442400","9783540457930"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45793-3_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}