{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T21:01:43Z","timestamp":1730322103943,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":60,"publisher":"ACM","funder":[{"DOI":"10.13039\/100014718","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1010568,CCF-1718540"],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,11]]},"DOI":"10.1145\/3385412.3385994","type":"proceedings-article","created":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T21:40:10Z","timestamp":1591479610000},"page":"75-90","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["From folklore to fact: comparing implementations of stacks and continuations"],"prefix":"10.1145","author":[{"given":"Kavon","family":"Farvardin","sequence":"first","affiliation":[{"name":"University of Chicago, USA"}]},{"given":"John","family":"Reppy","sequence":"additional","affiliation":[{"name":"University of Chicago, USA"}]}],"member":"320","published-online":{"date-parts":[[2020,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Brian Anderson. 2013. Abandoning segmented stacks in Rust. https: \/\/mail.mozilla.org\/pipermail\/rust-dev\/2013-November\/006314.html Brian Anderson. 2013. Abandoning segmented stacks in Rust. https: \/\/mail.mozilla.org\/pipermail\/rust-dev\/2013-November\/006314.html"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806651.1806655"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90175-X"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380190206"},{"volume-title":"Compiling with Continuations","author":"Appel Andrew W.","key":"e_1_3_2_1_5_1","unstructured":"Andrew W. Appel . 1992. Compiling with Continuations . Cambridge University Press , Cambridge, UK . Andrew W. Appel. 1992. Compiling with Continuations. Cambridge University Press, Cambridge, UK."},{"volume-title":"Modern Compiler Implementation in ML","author":"Appel Andrew W.","key":"e_1_3_2_1_6_1","unstructured":"Andrew W. Appel . 1998. Modern Compiler Implementation in ML . Cambridge University Press , Cambridge, UK . Andrew W. Appel. 1998. Modern Compiler Implementation in ML. Cambridge University Press, Cambridge, UK."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75303"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54444-5_83"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01807505"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1017\/S095679680000157X"},{"key":"e_1_3_2_1_11_1","volume-title":"Programming Erlang: Software for a Concurrent World. Pragmatic Bookshelf","author":"Armstrong Joe","year":"2007","unstructured":"Joe Armstrong . 2007 . Programming Erlang: Software for a Concurrent World. Pragmatic Bookshelf , Raleigh, NC . Joe Armstrong. 2007. Programming Erlang: Software for a Concurrent World. Pragmatic Bookshelf, Raleigh, NC."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1988915.1988929"},{"volume-title":"Microprocessor architecture: from simple pipelines to chip multiprocessors","author":"Baer Jean-Loup","key":"e_1_3_2_1_13_1","unstructured":"Jean-Loup Baer . 2009. Microprocessor architecture: from simple pipelines to chip multiprocessors . Cambridge University Press , Cambridge, UK . Jean-Loup Baer. 2009. Microprocessor architecture: from simple pipelines to chip multiprocessors. Cambridge University Press, Cambridge, UK."},{"key":"e_1_3_2_1_14_1","volume-title":"The Manticore Project","author":"Bergstrom Lars","year":"2020","unstructured":"Lars Bergstrom , Matthew Fluet , Mike Rainey , John Reppy , Stephen Rosen , Nora Sandler , and Adam Shaw . 2017. The Manticore Project . University of Chicago . Retrieved April 4, 2020 from https:\/\/manticore. cs.uchicago.edu Lars Bergstrom, Matthew Fluet, Mike Rainey, John Reppy, Stephen Rosen, Nora Sandler, and Adam Shaw. 2017. The Manticore Project. University of Chicago. Retrieved April 4, 2020 from https:\/\/manticore. cs.uchicago.edu"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/249069.231395"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/277652.277718"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/62678.62692"},{"key":"e_1_3_2_1_18_1","volume-title":"Hansen","author":"Clinger William D.","year":"2017","unstructured":"William D. Clinger and Lars T . Hansen . 2017 . The Larceny Project. Retrieved April 4, 2020 from http:\/\/www.larcenists.org William D. Clinger and Lars T. Hansen. 2017. The Larceny Project. Retrieved April 4, 2020 from http:\/\/www.larcenists.org"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010016816429"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/141471.141564"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386232"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/143095.143140"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/174675"},{"key":"e_1_3_2_1_24_1","unstructured":"174673 174673"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158611"},{"key":"e_1_3_2_1_26_1","volume-title":"Kernighan","author":"Donovan Alan A.A.","year":"2015","unstructured":"Alan A.A. Donovan and Brian W . Kernighan . 2015 . The Go Programming Language (1st ed.). Addison-Wesley , Reading, MA, USA. Alan A.A. Donovan and Brian W. Kernighan. 2015. The Go Programming Language (1st ed.). Addison-Wesley, Reading, MA, USA."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0096-0551(89)90018-0"},{"volume-title":"Weighing Continuations for Concurrency. Master\u2019s thesis. Department of Computer Science","author":"Farvardin Kavon","key":"e_1_3_2_1_28_1","unstructured":"Kavon Farvardin . 2017. Weighing Continuations for Concurrency. Master\u2019s thesis. Department of Computer Science , University of Chicago , Chicago IL . Kavon Farvardin. 2017. Weighing Continuations for Concurrency. Master\u2019s thesis. Department of Computer Science, University of Chicago, Chicago IL."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.285.5"},{"key":"e_1_3_2_1_30_1","unstructured":"Kathleen Fisher and John Reppy. 2002. Compiler support for lightweight concurrency. Technical Memorandum. Bell Labs. http:\/\/moby.cs. uchicago.edu\/papers\/2002\/tm-lightweight-concur.pdf Kathleen Fisher and John Reppy. 2002. Compiler support for lightweight concurrency. Technical Memorandum. Bell Labs. http:\/\/moby.cs. uchicago.edu\/papers\/2002\/tm-lightweight-concur.pdf"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1292535.1292539"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411203.1411239"},{"key":"e_1_3_2_1_33_1","first-page":"5","article-title":"Implicitly-threaded Parallelism in Manticore","volume":"20","author":"Fluet Matthew","year":"2011","unstructured":"Matthew Fluet , Mike Rainey , John Reppy , and Adam Shaw . 2011 . Implicitly-threaded Parallelism in Manticore . Journal of Functional Programming 20 , 5 \u2013 6 (2011), 537\u2013576. S0956796810000201 PLDI \u201920, June 15\u201320, 2020, London, UK Kavon Farvardin and John Reppy Matthew Fluet, Mike Rainey, John Reppy, and Adam Shaw. 2011. Implicitly-threaded Parallelism in Manticore. Journal of Functional Programming 20, 5\u20136 (2011), 537\u2013576. S0956796810000201 PLDI \u201920, June 15\u201320, 2020, London, UK Kavon Farvardin and John Reppy","journal-title":"Journal of Functional Programming"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57877-3_6"},{"key":"e_1_3_2_1_35_1","volume-title":"The Glasgow Haskell Compiler. Retrieved","author":"GHC.","year":"2020","unstructured":"GHC. 2020. The Glasgow Haskell Compiler. Retrieved April 4, 2020 from http:\/\/www.haskell.org\/ghc GHC. 2020. The Glasgow Haskell Compiler. Retrieved April 4, 2020 from http:\/\/www.haskell.org\/ghc"},{"key":"e_1_3_2_1_36_1","first-page":"21","article-title":"The Intel Pentium M Processor: Microarchitecture and Performance","volume":"7","author":"Gochman Simcha","year":"2003","unstructured":"Simcha Gochman , Ronny Ronen , Ittai Anati , Ariel Berkovits , Tsvika Kurts , Alon Naveh , Ali Saeed , Zeev Sperber , and Robert C Valentine . 2003 . The Intel Pentium M Processor: Microarchitecture and Performance . Intel Technology Journal 7 , 2 (2003), 21 \u2013 36 . Simcha Gochman, Ronny Ronen, Ittai Anati, Ariel Berkovits, Tsvika Kurts, Alon Naveh, Ali Saeed, Zeev Sperber, and Robert C Valentine. 2003. The Intel Pentium M Processor: Microarchitecture and Performance. Intel Technology Journal 7, 2 (2003), 21\u201336.","journal-title":"Intel Technology Journal"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224219"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/800055.802046"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094811.1094836"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/93548.93554"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/202529.202532"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2784731.2784736"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/301618.301667"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291201.1291217"},{"key":"e_1_3_2_1_45_1","unstructured":"LLVM Developers. 2019. Garbage Collection Safepoints in LLVM. https:\/\/releases.llvm.org\/9.0.0\/docs\/Statepoints.html LLVM Developers. 2019. Garbage Collection Safepoints in LLVM. https:\/\/releases.llvm.org\/9.0.0\/docs\/Statepoints.html"},{"volume-title":"The MLton Standard ML compiler. Retrieved","year":"2020","key":"e_1_3_2_1_47_1","unstructured":"MLton. 2020. The MLton Standard ML compiler. Retrieved April 4, 2020 from http:\/\/mlton.org MLton. 2020. The MLton Standard ML compiler. Retrieved April 4, 2020 from http:\/\/mlton.org"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45788-7_14"},{"key":"e_1_3_2_1_50_1","volume-title":"Featherweight concurrency in a portable assembly language. (Nov","author":"Ramsey Norman","year":"2000","unstructured":"Norman Ramsey and Simon Peyton Jones . 2000. Featherweight concurrency in a portable assembly language. (Nov . 2000 ). https: \/\/www.cs.tufts.edu\/~nr\/pubs\/c--con.pdf Norman Ramsey and Simon Peyton Jones. 2000. Featherweight concurrency in a portable assembly language. (Nov. 2000). https: \/\/www.cs.tufts.edu\/~nr\/pubs\/c--con.pdf"},{"key":"e_1_3_2_1_51_1","volume-title":"Contiguous Stacks in Go. golang.org. Retrieved","author":"Randall Keith","year":"2020","unstructured":"Keith Randall . 2013. Contiguous Stacks in Go. golang.org. Retrieved April 4, 2020 from http:\/\/golang.org\/s\/contigstacks Keith Randall. 2013. Contiguous Stacks in Go. golang.org. Retrieved April 4, 2020 from http:\/\/golang.org\/s\/contigstacks"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020839128338"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596550.1596588"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/113446.113470"},{"volume-title":"Concurrent Programming in ML","author":"Reppy John H.","key":"e_1_3_2_1_55_1","unstructured":"John H. Reppy . 1999. Concurrent Programming in ML . Cambridge University Press, Cambridge , UK. John H. Reppy. 1999. Concurrent Programming in ML. Cambridge University Press, Cambridge, UK."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01019459"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/182590.156783"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/345099.345125"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796814000161"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/182409.182428"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01935330"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/800087.802786"}],"event":{"name":"PLDI '20: 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"London UK","acronym":"PLDI '20"},"container-title":["Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3385412.3385994","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T23:50:52Z","timestamp":1673394652000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3385412.3385994"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,11]]},"references-count":60,"alternative-id":["10.1145\/3385412.3385994","10.1145\/3385412"],"URL":"https:\/\/doi.org\/10.1145\/3385412.3385994","relation":{},"subject":[],"published":{"date-parts":[[2020,6,11]]},"assertion":[{"value":"2020-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}