{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:43:31Z","timestamp":1750308211581,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,10,24]],"date-time":"2004-10-24T00:00:00Z","timestamp":1098576000000},"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":[],"published-print":{"date-parts":[[2004,10,24]]},"DOI":"10.1145\/1029873.1029893","type":"proceedings-article","created":{"date-parts":[[2005,1,30]],"date-time":"2005-01-30T17:55:16Z","timestamp":1107107716000},"page":"163-174","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Exploring the barrier to entry"],"prefix":"10.1145","author":[{"given":"A. M.","family":"Cheadle","sequence":"first","affiliation":[{"name":"Imperial College London"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. J.","family":"Field","sequence":"additional","affiliation":[{"name":"Imperial College London"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Marlow","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. L. Peyton","family":"Jones","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. L.","family":"While","sequence":"additional","affiliation":[{"name":"The University of Western Australia, Perth"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,10,24]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1002\/spe.4380190206"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/359460.359470"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/604131.604155"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/301618.301648"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/378795.378823"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/62678.62717"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/351240.351265"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/362790.362798"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/117954.117957"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/1016850.1016856"},{"key":"e_1_3_2_1_12_1","volume-title":"USA","author":"Maessen Hybrid Eager J.W.","year":"2002","unstructured":"J.W. Maessen Hybrid Eager and Lazy Evaluation for the Efficient Compilation of Haskell PhD thesis, Massachusetts Institute of Technology , USA , 2002 J.W. Maessen Hybrid Eager and Lazy Evaluation for the Efficient Compilation of Haskell PhD thesis, Massachusetts Institute of Technology, USA, 2002"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.5555\/645648.664825"},{"key":"e_1_3_2_1_14_1","volume-title":"of Computer Science","author":"Partain W.","year":"1993","unstructured":"W. Partain . The nofib Benchmark Suite of Haskell Programs . Dept. of Computer Science , University of Glasgow , 1993 . W. Partain. The nofib Benchmark Suite of Haskell Programs. Dept. of Computer Science, University of Glasgow, 1993."},{"unstructured":"PAPI\n  : Performance Application Programming Interface http:\/\/icl.cs.utk.edu\/papi\/  PAPI: Performance Application Programming Interface http:\/\/icl.cs.utk.edu\/papi\/","key":"e_1_3_2_1_15_1"},{"key":"e_1_3_2_1_16_1","first-page":"145","volume-title":"Generational Garbage Collection for Lazy Functional Languages Without Temporary Space Leaks Memory Management Workshop","author":"Rojemo N.","year":"1995","unstructured":"N. Rojemo . Generational Garbage Collection for Lazy Functional Languages Without Temporary Space Leaks Memory Management Workshop , pages 145 -- 162 , 1995 . ftp:\/\/ftp.cs.chalmers.se\/pub\/users\/rojemo\/iwmm95.ps.gz N. Rojemo. Generational Garbage Collection for Lazy Functional Languages Without Temporary Space Leaks Memory Management Workshop, pages 145--62, 1995. ftp:\/\/ftp.cs.chalmers.se\/pub\/users\/rojemo\/iwmm95.ps.gz"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/165180.165195"},{"key":"e_1_3_2_1_18_1","first-page":"147","volume-title":"Workshop on the Parallel Implementation of Functional Languages","volume":"07","author":"Jones S. Peyton","year":"1991","unstructured":"S. Peyton Jones . The Spineless Tagless g-machine: Second attempt . In Workshop on the Parallel Implementation of Functional Languages , volume CSTR 91- 07 , pages 147 -- 191 . University of Southampton , 1991 . S. Peyton Jones. The Spineless Tagless g-machine: Second attempt. In Workshop on the Parallel Implementation of Functional Languages, volume CSTR 91-07, pages 147--91. University of Southampton, 1991."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1017\/S0956796800000319"},{"key":"e_1_3_2_1_20_1","volume-title":"The STG runtime system (revised). Draft paper","author":"Jones S. Peyton","year":"1999","unstructured":"S. Peyton Jones , S. Marlow , and A. Reid . The STG runtime system (revised). Draft paper , Microsoft Research Ltd , 1999 . S. Peyton Jones, S. Marlow, and A. Reid. The STG runtime system (revised). Draft paper, Microsoft Research Ltd, 1999."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/99370.99385"},{"key":"e_1_3_2_1_22_1","first-page":"200","volume-title":"Generational Garbage Collection for Lazy Graph Reduction. In International Workshop on Memory Management","author":"Seward J.","year":"1992","unstructured":"J. Seward . Generational Garbage Collection for Lazy Graph Reduction. In International Workshop on Memory Management , pages 200 -- 217 , 1992 . J. Seward. Generational Garbage Collection for Lazy Graph Reduction. In International Workshop on Memory Management, pages 200--17, 1992."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/800020.808261"},{"unstructured":"Valgrind an open-source memory debugger for x86-linux. http:\/\/valgrind.kde.org.  Valgrind an open-source memory debugger for x86-linux. http:\/\/valgrind.kde.org.","key":"e_1_3_2_1_25_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1002\/spe.4380230704"}],"event":{"sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"],"acronym":"ISMM04","name":"ISMM04: 2004 International Symposium on Memory Management ( in conjunction with OOPSLA 2004 Conference )","location":"Vancouver BC Canada"},"container-title":["Proceedings of the 4th international symposium on Memory management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1029873.1029893","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1029873.1029893","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:03Z","timestamp":1750264263000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1029873.1029893"}},"subtitle":["incremental generational garbage collection for Haskell"],"short-title":[],"issued":{"date-parts":[[2004,10,24]]},"references-count":24,"alternative-id":["10.1145\/1029873.1029893","10.1145\/1029873"],"URL":"https:\/\/doi.org\/10.1145\/1029873.1029893","relation":{},"subject":[],"published":{"date-parts":[[2004,10,24]]},"assertion":[{"value":"2004-10-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}