{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T23:08:50Z","timestamp":1765667330421,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,1,17]],"date-time":"2021-01-17T00:00:00Z","timestamp":1610841600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1719158"],"award-info":[{"award-number":["1719158"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,1,18]]},"DOI":"10.1145\/3441296.3441398","type":"proceedings-article","created":{"date-parts":[[2020,12,23]],"date-time":"2020-12-23T00:32:44Z","timestamp":1608683564000},"page":"74-89","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Strictly capturing non-strict closures"],"prefix":"10.1145","author":[{"given":"Zachary J.","family":"Sullivan","sequence":"first","affiliation":[{"name":"University of Oregon, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0165-9387","authenticated-orcid":false,"given":"Paul","family":"Downen","sequence":"additional","affiliation":[{"name":"University of Oregon, USA"}]},{"given":"Zena M.","family":"Ariola","sequence":"additional","affiliation":[{"name":"University of Oregon, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,1,17]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411227"},{"key":"e_1_3_2_1_3_1","first-page":"293","volume-title":"Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages","author":"Andrew","year":"1989","unstructured":"Andrew W. Appel and Trevor Jim. Continuation-passing, closurepassing style . In Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages , Austin, Texas, USA , January 11-13, 1989 , pages 293 - 302 , 1989. Andrew W. Appel and Trevor Jim. Continuation-passing, closurepassing style. In Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, USA, January 11-13, 1989, pages 293-302, 1989."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/800055.802038"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/5280.5303"},{"key":"e_1_3_2_1_6_1","first-page":"797","volume-title":"Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018","author":"William","year":"2018","unstructured":"William J. Bowman and Amal Ahmed. Typed closure conversion for the calculus of constructions . In Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018 , Philadelphia, PA, USA , June 18-22, 2018 , pages 797 - 811 , 2018. William J. Bowman and Amal Ahmed. Typed closure conversion for the calculus of constructions. In Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018, Philadelphia, PA, USA, June 18-22, 2018, pages 797-811, 2018."},{"key":"e_1_3_2_1_7_1","first-page":"241","volume-title":"4th Fuji International Symposium, FLOPS'99","author":"Danvy Olivier","year":"1999","unstructured":"Olivier Danvy . An extensional characterization of lambda-lifting and lambda-dropping. In Functional and Logic Programming , 4th Fuji International Symposium, FLOPS'99 , Tsukuba, Japan , November 11-13, 1999 , Proceedings, pages 241 - 250 , 1999. Olivier Danvy. An extensional characterization of lambda-lifting and lambda-dropping. In Functional and Logic Programming, 4th Fuji International Symposium, FLOPS'99, Tsukuba, Japan, November 11-13, 1999, Proceedings, pages 241-250, 1999."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3408986"},{"key":"e_1_3_2_1_9_1","volume":"111","author":"Downen Paul","unstructured":"Paul Downen , Philip Johnson-Freyd , and Zena M. Ariola . Abstracting models of strong normalization for classical calculi. J. Log. Algebraic Methods Program. , 111 : 100512, 2020. Paul Downen, Philip Johnson-Freyd, and Zena M. Ariola. Abstracting models of strong normalization for classical calculi. J. Log. Algebraic Methods Program., 111 : 100512, 2020.","journal-title":"J. Log. Algebraic Methods Program."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17184-1_5"},{"key":"e_1_3_2_1_11_1","first-page":"4","volume":"22","author":"Dreyer Derek","unstructured":"Derek Dreyer , Georg Neis , and Lars Birkedal . The impact of higherorder state and control efects on local relational reasoning. J. Funct. Program. , 22 ( 4 - 5 ): 477-528, 2012. Derek Dreyer, Georg Neis, and Lars Birkedal. The impact of higherorder state and control efects on local relational reasoning. J. Funct. Program., 22 ( 4-5 ): 477-528, 2012.","journal-title":"J. Funct. Program."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/502874.502880"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-007-9018-9"},{"key":"e_1_3_2_1_15_1","volume-title":"The mechanical evaluation of expressions. The Computer Journal, 6 ( 4 ): 308-320","author":"Landin Peter J.","year":"1964","unstructured":"Peter J. Landin . The mechanical evaluation of expressions. The Computer Journal, 6 ( 4 ): 308-320 , 1964 . Peter J. Landin. The mechanical evaluation of expressions. The Computer Journal, 6 ( 4 ): 308-320, 1964."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158618"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages, PPDP 2019","author":"Mates Phillip","year":"2019","unstructured":"Phillip Mates , Jamie Perconti , and Amal Ahmed . Under control : Compositionally correct closure conversion with mutable state. In Ekaterina Komendantskaya, editor , Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages, PPDP 2019 , Porto, Portugal , October 7-9, 2019 . ACM, 2019. Phillip Mates, Jamie Perconti, and Amal Ahmed. Under control: Compositionally correct closure conversion with mutable state. In Ekaterina Komendantskaya, editor, Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages, PPDP 2019, Porto, Portugal, October 7-9, 2019. ACM, 2019."},{"key":"e_1_3_2_1_18_1","first-page":"482","volume-title":"Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2017","author":"Maurer Luke","year":"2017","unstructured":"Luke Maurer , Paul Downen , Zena M. Ariola , and Simon L . Peyton Jones. Compiling without continuations . In Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2017 , Barcelona, Spain , June 18-23, 2017 , pages 482 - 494 , 2017. Luke Maurer, Paul Downen, Zena M. Ariola, and Simon L. Peyton Jones. Compiling without continuations. In Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2017, Barcelona, Spain, June 18-23, 2017, pages 482-494, 2017."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237791"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89366-2_15"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34175-6_10"},{"key":"e_1_3_2_1_22_1","volume-title":"Call-by-need and continuation-passing style. LISP Symb. Comput., 7 ( 1 ): 57-82","author":"Okasaki Chris","year":"1994","unstructured":"Chris Okasaki , Peter Lee , and David Tarditi . Call-by-need and continuation-passing style. LISP Symb. Comput., 7 ( 1 ): 57-82 , 1994 . Chris Okasaki, Peter Lee, and David Tarditi. Call-by-need and continuation-passing style. LISP Symb. Comput., 7 ( 1 ): 57-82, 1994."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341687"},{"key":"e_1_3_2_1_24_1","volume-title":"The Implementation of Functional Programming Languages","author":"Peyton Jones Simon L.","year":"1987","unstructured":"Simon L. Peyton Jones . The Implementation of Functional Programming Languages . Prentice-Hall , 1987 . Simon L. Peyton Jones. The Implementation of Functional Programming Languages. Prentice-Hall, 1987."},{"key":"e_1_3_2_1_25_1","first-page":"636","volume-title":"5th ACM Conference","author":"Simon","year":"1991","unstructured":"Simon L. Peyton Jones and John Launchbury. Unboxed values as first class citizens in a non-strict functional language. In Functional Programming Languages and Computer Architecture , 5th ACM Conference , Cambridge, MA, USA , August 26-30, 1991 , Proceedings, pages 636 - 666 , 1991. Simon L. Peyton Jones and John Launchbury. Unboxed values as first class citizens in a non-strict functional language. In Functional Programming Languages and Computer Architecture, 5th ACM Conference, Cambridge, MA, USA, August 26-30, 1991, Proceedings, pages 636-666, 1991."},{"key":"e_1_3_2_1_26_1","first-page":"184","volume-title":"Proceedings of the Fourth International Conference on Functional Programming Languages and Computer Architecture, FPCA '89","author":"Simon","year":"1989","unstructured":"Simon L. Peyton Jones and Jon Salkild. The spineless tagless g-machine . In Proceedings of the Fourth International Conference on Functional Programming Languages and Computer Architecture, FPCA '89 , pages 184 - 201 , 1989 . Simon L. Peyton Jones and Jon Salkild. The spineless tagless g-machine. In Proceedings of the Fourth International Conference on Functional Programming Languages and Computer Architecture, FPCA '89, pages 184-201, 1989."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1996.561314"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/182409.156783"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/174675.178044"}],"event":{"name":"POPL '21: The 48th Annual ACM SIGPLAN Symposium on Principles of Programming Languages","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Virtual Denmark","acronym":"POPL '21"},"container-title":["Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3441296.3441398","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3441296.3441398","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3441296.3441398","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:03:04Z","timestamp":1750197784000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3441296.3441398"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,17]]},"references-count":27,"alternative-id":["10.1145\/3441296.3441398","10.1145\/3441296"],"URL":"https:\/\/doi.org\/10.1145\/3441296.3441398","relation":{},"subject":[],"published":{"date-parts":[[2021,1,17]]},"assertion":[{"value":"2021-01-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}