{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T03:13:20Z","timestamp":1775790800242,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540657637","type":"print"},{"value":"9783540489597","type":"electronic"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999]]},"DOI":"10.1007\/3-540-48959-2_17","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T16:52:16Z","timestamp":1178211136000},"page":"228-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":45,"title":["Call-by-Push-Value: A Subsuming Paradigm"],"prefix":"10.1007","author":[{"given":"Paul Blain","family":"Levy","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"key":"17_CR1","unstructured":"S. Abramsky, K. Honda, and G. McCusker. A fully abstract game semantics for general references. Proceedings, Thirteenth Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 1998."},{"key":"17_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Computer Science Logic: 11th International Workshop Proceedings","author":"S. Abramsky","year":"1998","unstructured":"S. Abramsky and G. McCusker. Call-by-value games. In M. Nielsen and W. Thomas, editors, Computer Science Logic: 11th International Workshop Proceedings, Lecture Notes in Computer Science. Springer-Verlag, 1998."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"N. Benton and P. Wadler. Linear logic, monads and the lambda calculus. In Proceedings, 11 th Annual IEEE Symposium on Logic in Computer Science, pages 420\u2013431, New Brunswick, 1996. IEEE Computer Society Press.","DOI":"10.1109\/LICS.1996.561458"},{"key":"17_CR4","volume-title":"Controlling Effects","author":"A. Filinski","year":"1996","unstructured":"A. Filinski. Controlling Effects. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, 1996."},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1\u2013102, 1987.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"17_CR6","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1017\/S0956796897002748","volume":"7","author":"J. Hatcliff","year":"1997","unstructured":"J. Hatcliff and O. Danvy. Thunks and the \u03bb-calculus. Journal of Functional Programming, 7(3):303\u2013319, May 1997.","journal-title":"Journal of Functional Programming"},{"key":"17_CR7","unstructured":"M. Hyland and L. Ong. On full abstraction for PCF. submitted, 1994."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"S. Peyton Jones, J. Launchbury, M. Shields, and A. Tolmach. Bridging the gulf: A common intermediate language for ML and Haskell. In Proc. 25th ACM Symposium on Principles of Programming Languages, San Diego, 1998.","DOI":"10.1145\/268946.268951"},{"issue":"2","key":"17_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1017\/S0956796800000319","volume":"2","author":"S. L. Peyton Jones","year":"1992","unstructured":"S. L. Peyton Jones. Implementing lazy functional languages on stock hardware: the spineless tagless G-machine. Journal of Functional Programming, 2(2):127\u2013202, July 1992.","journal-title":"Journal of Functional Programming"},{"key":"17_CR10","unstructured":"P. B. Levy. Categorical aspects of call-by-push-value. draft, available at http:\/\/www.dcs.qmw.ac.uk\/pbl\/papers.html , 1998."},{"key":"17_CR11","unstructured":"M. Marz. A fully abstract model for sequential computation. draft, 1998."},{"key":"17_CR12","unstructured":"A. Meyer and S. Cosmodakis. Semantical Paradigms. In Proc. Third Annual Symposium on Logic in Computer Science. Computer Society Press, 1988."},{"key":"17_CR13","unstructured":"G. McCusker. Games and Full Abstraction for a Functional Metalanguage with Recursive Types. PhD thesis, University of London, 1996."},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"E. Moggi. Notions of computation and monads. Information and Computation, 93:55\u201392, 1991.","journal-title":"Information and Computation"},{"key":"17_CR15","unstructured":"P. W. O\u2019Hearn. Opaque types in algol-like languages. manuscript, 1993."},{"issue":"1","key":"17_CR16","first-page":"125","volume":"1","author":"G. D. Plotkin","year":"1976","unstructured":"G. D. Plotkin. Call-by-name, call-by-value and the \u03bb-calculus. Theoretical Computer Science, 1(1):125\u2013159, 1976.","journal-title":"Theoretical Computer Science"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"G. D. Plotkin. LCF as a programming language. Theoretical Computer Science, 5, 1977.","DOI":"10.1016\/0304-3975(77)90044-5"},{"key":"17_CR18","unstructured":"G. D. Plotkin. Lectures on predomains and partial functions. Course notes, Center for the Study of Language and Information, Stanford, 1985."},{"issue":"5","key":"17_CR19","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1017\/S0960129597002375","volume":"7","author":"A. J. Power","year":"1997","unstructured":"A. J. Power and E. P. Robinson. Premonoidal categories and notions of computation. Math. Struct. in Comp. Sci., 7(5):453\u2013468, October 1997.","journal-title":"Math. Struct. in Comp. Sci."},{"key":"17_CR20","unstructured":"J. Reynolds. Where theory and practice meet: POPL past and future. Invited Lecture, 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, California, January 19\u201421, 1998."},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"M. Shields and S. Peyton Jones. Bridging the gulf better. Draft, 1998.","DOI":"10.1145\/268946.268951"},{"key":"17_CR22","unstructured":"Th. Streicher and B. Reus. Continuation semantics, abstract machines and control operators. submitted to Journal of Functional Programming, 1996."}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48959-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T00:45:29Z","timestamp":1736988329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48959-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540657637","9783540489597"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-48959-2_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"27 May 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}