{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:42Z","timestamp":1750220202535,"version":"3.41.0"},"reference-count":5,"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>After an extended hiatus, the<jats:italic>Semantics<\/jats:italic>column is returning with this issue of the<jats:italic>Newsletter.<\/jats:italic>The subject of this quarter's column is<jats:italic>Call-By-Push-Value<\/jats:italic>, written by Paul B. Levy. CBPV is Paul's invention, and it's an interesting and powerful calculus that incorporates both the<jats:italic>Call-By-Value<\/jats:italic>and<jats:italic>Call-By-Name<\/jats:italic>calculi. Moreover, it's also simpler to describe, as Paul's column demonstrates. After a short introduction to set the stage, and an outline of relevant components of the pure functional programming -- i.e., the simply-typed lambda calculus, Paul describes CBPV and how it incorporates a wide range of computational effects. He then indicates how CBN and CBV each can be translated into CBPV.<\/jats:p>","DOI":"10.1145\/3537668.3537669","type":"journal-article","created":{"date-parts":[[2022,5,12]],"date-time":"2022-05-12T22:21:08Z","timestamp":1652394068000},"page":"3-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Semantics column"],"prefix":"10.1145","volume":"9","author":[{"given":"Michael","family":"Mislove","sequence":"first","affiliation":[{"name":"Tulane University"}]}],"member":"320","published-online":{"date-parts":[[2022,5,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Abramsky S. and A. Jung Domain Theory Corrected and expanded version https:\/\/www.cs.bham.ac.uk\/~axj\/pub\/papers\/handy1.pdf Abramsky S. and A. Jung Domain Theory Corrected and expanded version https:\/\/www.cs.bham.ac.uk\/~axj\/pub\/papers\/handy1.pdf","DOI":"10.1093\/oso\/9780198537625.003.0001"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0022251"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1994.316083"},{"key":"e_1_2_1_4_1","first-page":"375","volume-title":"Lambda Calculus and Formalism","author":"Lambek J.","year":"1980","unstructured":"Lambek , J. From \u03bb-calculus to Cartesian closed categories. In To H. B. Curry: Essays on Combinatory Logic , Lambda Calculus and Formalism , pages 375 -- 402 . J.R. Hindley, J.P. Seldin (Eds.), New York , 1980 . Lambek, J. From \u03bb-calculus to Cartesian closed categories. In To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 375--402. J.R. Hindley, J.P. Seldin (Eds.), New York, 1980."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1906.09503"}],"container-title":["ACM SIGLOG News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3537668.3537669","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3537668.3537669","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.3537669"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["10.1145\/3537668.3537669"],"URL":"https:\/\/doi.org\/10.1145\/3537668.3537669","relation":{},"ISSN":["2372-3491"],"issn-type":[{"type":"electronic","value":"2372-3491"}],"subject":[],"published":{"date-parts":[[2022,4]]},"assertion":[{"value":"2022-05-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}