{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:13:29Z","timestamp":1767928409344,"version":"3.49.0"},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM SIGLOG News"],"published-print":{"date-parts":[[2022,4]]},"abstract":"<jats:p>Call-by-push-value (CBPV) is a form of typed \u03bb-calculus that plays a fundamental role in the study of computational effects. This article is intended to be an accessible introduction. I thank Mike Mislove and SIGLOG for inviting me to expound one of my favourite subjects.<\/jats:p>","DOI":"10.1145\/3537668.3537670","type":"journal-article","created":{"date-parts":[[2022,5,12]],"date-time":"2022-05-12T22:21:08Z","timestamp":1652394068000},"page":"7-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Call-by-push-value"],"prefix":"10.1145","volume":"9","author":[{"given":"Paul Blain","family":"Levy","sequence":"first","affiliation":[{"name":"University of Birmingham, UK"}]}],"member":"320","published-online":{"date-parts":[[2022,5,12]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Computer Science Logic: 11th International Workshop Proceedings (LNCS)","author":"Abramsky S.","unstructured":"S. Abramsky and G. McCusker . 1998. Call-by-Value Games . In Computer Science Logic: 11th International Workshop Proceedings (LNCS) , M. Nielsen and W. Thomas (Eds.). Springer , 1--17. S. Abramsky and G. McCusker. 1998. Call-by-Value Games. In Computer Science Logic: 11th International Workshop Proceedings (LNCS), M. Nielsen and W. Thomas (Eds.). Springer, 1--17."},{"key":"e_1_2_1_2_1","unstructured":"M. Felleisen and D. Friedman. 1986. Control operators the SECD-machine and the \u03bb-calculus. In Formal Description of Programming Concepts III M. Wirsing (Ed.). North-Holland 193--217.  M. Felleisen and D. Friedman. 1986. Control operators the SECD-machine and the \u03bb-calculus. In Formal Description of Programming Concepts III M. Wirsing (Ed.). North-Holland 193--217."},{"key":"e_1_2_1_3_1","volume-title":"School of Computer Science","author":"Filinski A.","unstructured":"A. Filinski . 1996. Controlling Effects . Ph.D. Dissertation . School of Computer Science , Carnegie Mellon University , Pittsburgh, Pennsylvania . A. Filinski. 1996. Controlling Effects. Ph.D. Dissertation. School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania."},{"key":"e_1_2_1_4_1","volume-title":"24th International Colloquium (LNCS), P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela (Eds.)","volume":"1256","author":"Honda K.","unstructured":"K. Honda and N. Yoshida . 1997. Game Theoretic Analysis of Call-by-Value Computation. In Automata, Languages and Programming , 24th International Colloquium (LNCS), P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela (Eds.) , Vol. 1256 . Springer, Bologna, Italy, 225--236. K. Honda and N. Yoshida. 1997. Game Theoretic Analysis of Call-by-Value Computation. In Automata, Languages and Programming, 24th International Colloquium (LNCS), P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela (Eds.), Vol. 1256. Springer, Bologna, Italy, 225--236."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2917"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48959-2_17"},{"key":"e_1_2_1_8_1","unstructured":"P. B. Levy. 2001. Call-by-push-value. Ph.D. Dissertation. Queen Mary University of London.  P. B. Levy. 2001. Call-by-push-value. Ph.D. Dissertation. Queen Mary University of London."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45793-3_16"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"P. B. Levy. 2004. Call-By-Push-Value. A Functional\/Imperative Synthesis. Springer.  P. B. Levy. 2004. Call-By-Push-Value. A Functional\/Imperative Synthesis. Springer.","DOI":"10.1007\/978-94-007-0954-6"},{"key":"e_1_2_1_11_1","first-page":"75","article-title":"Adjunction Models For Call-By-Push-Value With Stacks","volume":"14","author":"Levy P. B.","year":"2005","unstructured":"P. B. Levy . 2005 . Adjunction Models For Call-By-Push-Value With Stacks . Theory and Applications of Categories 14 (2005), 75 -- 110 . P. B. Levy. 2005. Adjunction Models For Call-By-Push-Value With Stacks. Theory and Applications of Categories 14 (2005), 75--110.","journal-title":"Theory and Applications of Categories"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-006-0480-6"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_38"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00088-9"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the 1998 ACM SIGPLAN Workshop on Standard ML. Association for Computing Machinery","author":"MacQueen D. B.","unstructured":"D. B. MacQueen , P. Wadler , and W. Taha . 1998. How to add laziness to a strict language without even being odd . In Proceedings of the 1998 ACM SIGPLAN Workshop on Standard ML. Association for Computing Machinery , Baltimore, MD, 24--30. D. B. MacQueen, P. Wadler, and W. Taha. 1998. How to add laziness to a strict language without even being odd. In Proceedings of the 1998 ACM SIGPLAN Workshop on Standard ML. Association for Computing Machinery, Baltimore, MD, 24--30."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1999.2845"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"e_1_2_1_18_1","volume-title":"Hereditarily Sequential Functionals: A Game-Theoretic Approach to Sequentiality","author":"Nickau H.","unstructured":"H. Nickau . 1996. Hereditarily Sequential Functionals: A Game-Theoretic Approach to Sequentiality . Shaker-Verlag . Dissertation, Universit\u00e4t Gesamthochschule Siegen. H. Nickau. 1996. Hereditarily Sequential Functionals: A Game-Theoretic Approach to Sequentiality. Shaker-Verlag. Dissertation, Universit\u00e4t Gesamthochschule Siegen."},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS '01)","author":"Plotkin G. D.","unstructured":"G. D. Plotkin and J. Power . 2001. Adequacy for Algebraic Effects . In Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS '01) . SpringerVerlag, Berlin, Heidelberg, 1--24. G. D. Plotkin and J. Power. 2001. Adequacy for Algebraic Effects. In Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS '01). SpringerVerlag, Berlin, Heidelberg, 1--24."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211062"}],"container-title":["ACM SIGLOG News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3537668.3537670","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3537668.3537670","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:50Z","timestamp":1750186970000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3537668.3537670"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["10.1145\/3537668.3537670"],"URL":"https:\/\/doi.org\/10.1145\/3537668.3537670","relation":{},"ISSN":["2372-3491"],"issn-type":[{"value":"2372-3491","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4]]},"assertion":[{"value":"2022-05-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}