{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:05:15Z","timestamp":1760043915890,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819722990"},{"type":"electronic","value":"9789819723003"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-2300-3_11","type":"book-chapter","created":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T07:02:09Z","timestamp":1715842929000},"page":"188-216","source":"Crossref","is-referenced-by-count":1,"title":["Being Lazy When It Counts"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8856-9095","authenticated-orcid":false,"given":"Chun Kit","family":"Lam","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8805-0728","authenticated-orcid":false,"given":"Lionel","family":"Parreaux","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Blackburn, S.M., McKinley, K.S.: Ulterior reference counting: fast garbage collection without a long wait. In: Crocker, R., Jr., G.L.S. (eds.) Proceedings of the 2003 ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages and Applications, OOPSLA 2003, 26\u201330 October 2003, Anaheim, CA, USA, pp. 344\u2013358. ACM (2003), https:\/\/doi.org\/10.1145\/949305.949336","DOI":"10.1145\/949305.949336"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Blelloch, G.E., Wei, Y.: Concurrent fixed-size allocation and free in constant time (2020). https:\/\/doi.org\/10.48550\/ARXIV.2008.04296, https:\/\/arxiv.org\/abs\/2008.04296","DOI":"10.48550\/ARXIV.2008.04296"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Boehm, H.J.: The space cost of lazy reference counting. In: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2004, pp. 210\u2013219. Association for Computing Machinery, New York (2004). https:\/\/doi.org\/10.1145\/964001.964019. ISBN 158113729X","DOI":"10.1145\/964001.964019"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Bruno, R., Jovanovic, V., Wimmer, C., Alonso, G.: Compiler-assisted object inlining with value fields. In: Freund, S.N., Yahav, E. (eds.) PLDI 2021: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Virtual Event, Canada, 20\u201325 June 2021, pp. 128\u2013141. ACM (2021). https:\/\/doi.org\/10.1145\/3453483.3454034","DOI":"10.1145\/3453483.3454034"},{"issue":"12","key":"11_CR5","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1145\/367487.367501","volume":"3","author":"GE Collins","year":"1960","unstructured":"Collins, G.E.: A method for overlapping and erasure of lists. Commun. ACM 3(12), 655\u2013657 (1960). https:\/\/doi.org\/10.1145\/367487.367501. ISSN 0001-0782","journal-title":"Commun. ACM"},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D Comer","year":"1979","unstructured":"Comer, D.: Ubiquitous B-tree. ACM Comput. Surv. (CSUR) 11(2), 121\u2013137 (1979)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Czaplicki, E., Chong, S.: Asynchronous functional reactive programming for GUIs. In: Boehm, H., Flanagan, C. (eds.) ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2013, Seattle, WA, USA, 16\u201319 June 2013, pp. 411\u2013422. ACM (2013). https:\/\/doi.org\/10.1145\/2491956.2462161","DOI":"10.1145\/2491956.2462161"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Dolby, J.: Automatic inline allocation of objects. In: Chen, M.C., Cytron, R.K., Berman, A.M. (eds.) Proceedings of the ACM SIGPLAN 1997 Conference on Programming Language Design and Implementation (PLDI), Las Vegas, Nevada, USA, 15\u201318 June 1997, pp. 7\u201317. ACM (1997). https:\/\/doi.org\/10.1145\/258915.258918","DOI":"10.1145\/258915.258918"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Doligez, D., Leroy, X.: A concurrent, generational garbage collector for a multithreaded implementation of ML. In: Deusen, M.S.V., Lang, B. (eds.) Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, South Carolina, USA, January 1993, pp. 113\u2013123. ACM Press (1993). https:\/\/doi.org\/10.1145\/158511.158611","DOI":"10.1145\/158511.158611"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Elliott, C., Hudak, P.: Functional reactive animation. In: International Conference on Functional Programming (1997). http:\/\/conal.net\/papers\/icfp97\/","DOI":"10.1145\/258948.258973"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Joisha, P.G.: Compiler optimizations for nondeferred reference: counting garbage collection. In: Proceedings of the 5th International Symposium on Memory Management, ISMM 2006, pp. 150\u2013161. Association for Computing Machinery, New York (2006). https:\/\/doi.org\/10.1145\/1133956.1133976. ISBN 1595932216","DOI":"10.1145\/1133956.1133976"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Joisha, P.G.: Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast. In: Proceedings of the 6th International Symposium on Memory Management, ISMM 2007, pp. 141\u2013158. Association for Computing Machinery, New York (2007). https:\/\/doi.org\/10.1145\/1296907.1296926. ISBN 9781595938930","DOI":"10.1145\/1296907.1296926"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-030-34175-6_13","volume-title":"Programming Languages and Systems","author":"D Leijen","year":"2019","unstructured":"Leijen, D., Zorn, B., de Moura, L.: Mimalloc: free list sharding in action. In: Lin, A.W. (ed.) APLAS 2019. LNCS, vol. 11893, pp. 244\u2013265. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34175-6_13"},{"issue":"9","key":"11_CR14","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/367593.367649","volume":"6","author":"JH McBeth","year":"1963","unstructured":"McBeth, J.H.: Letters to the editor: on the reference counter method. Commun. ACM 6(9), 575 (1963). https:\/\/doi.org\/10.1145\/367593.367649. ISSN 0001-0782","journal-title":"Commun. ACM"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Nilsson, H., Courtney, A., Peterson, J.: Functional reactive programming, continued. In: Proceedings of the 2002 ACM SIGPLAN Workshop on Haskell, Haskell 2002, pp. 51\u201364. Association for Computing Machinery, New York (2002). https:\/\/doi.org\/10.1145\/581690.581695. ISBN 1581136056","DOI":"10.1145\/581690.581695"},{"key":"11_CR16","series-title":"Workshops in Computing","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-1-4471-3215-8_17","volume-title":"Functional Programming, Glasgow 1992","author":"W Partain","year":"1992","unstructured":"Partain, W.: The nofib benchmark suite of Haskell programs. In: Launchbury, J., Sansom, P.M. (eds.) Functional Programming, Glasgow 1992. Workshops in Computing, pp. 195\u2013202. Springer, London (1992). https:\/\/doi.org\/10.1007\/978-1-4471-3215-8_17"},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Powers, B., Tench, D., Berger, E.D., McGregor, A.: Mesh: compacting memory management for C\/C++ applications. In: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2019, pp. 333\u2013346. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3314221.3314582. ISBN 9781450367127","DOI":"10.1145\/3314221.3314582"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Puaut, I.: Real-time performance of dynamic memory allocation algorithms. In: 14th Euromicro Conference on Real-Time Systems (ECRTS 2002), 19-21 June 2002, Vienna, Austria, Proceedings, pp. 41\u201349. IEEE Computer Society (2002). https:\/\/doi.org\/10.1109\/EMRTS.2002.1019184","DOI":"10.1109\/EMRTS.2002.1019184"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Reinking, A., Xie, N., de\u00a0Moura, L., Leijen, D.: Perceus: garbage free reference counting with reuse. In: Freund, S.N., Yahav, E. (eds.) PLDI 2021: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Virtual Event, Canada, 20\u201325 June 2021, pp. 96\u2013111. ACM (2021). https:\/\/doi.org\/10.1145\/3453483.3454032","DOI":"10.1145\/3453483.3454032"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Shahriyar, R., Blackburn, S.M., Frampton, D.: Down for the count? Getting reference counting back in the ring. In: Proceedings of the 2012 International Symposium on Memory Management, ISMM 2012, pp. 73\u201384. Association for Computing Machinery, New York (2012). https:\/\/doi.org\/10.1145\/2258996.2259008. ISBN 9781450313506","DOI":"10.1145\/2258996.2259008"},{"key":"11_CR21","doi-asserted-by":"publisher","unstructured":"Ullrich, S., de\u00a0Moura, L.: Counting immutable beans: reference counting optimized for purely functional programming. In: Proceedings of the 31st Symposium on Implementation and Application of Functional Languages, IFL 2019. Association for Computing Machinery, New York (2021). https:\/\/doi.org\/10.1145\/3412932.3412935. ISBN 9781450375627","DOI":"10.1145\/3412932.3412935"},{"key":"11_CR22","doi-asserted-by":"publisher","unstructured":"Wan, Z., Hudak, P.: Functional reactive programming from first principles. In: Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation, PLDI 2000, pp. 242\u2013252. Association for Computing Machinery, New York (2000). https:\/\/doi.org\/10.1145\/349299.349331. ISBN 1581131992","DOI":"10.1145\/349299.349331"},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"Wan, Z., Taha, W., Hudak, P.: Real-time FRP. In: Pierce, B.C. (ed.) Proceedings of the Sixth ACM SIGPLAN International Conference on Functional Programming (ICFP 2001), Firenze (Florence), Italy, 3\u20135 September 2001, pp. 146\u2013156. ACM (2001). https:\/\/doi.org\/10.1145\/507635.507654","DOI":"10.1145\/507635.507654"},{"issue":"9","key":"11_CR24","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1145\/367593.367617","volume":"6","author":"J Weizenbaum","year":"1963","unstructured":"Weizenbaum, J.: Symmetric list processor. Commun. ACM 6(9), 524\u2013536 (1963). https:\/\/doi.org\/10.1145\/367593.367617. ISSN 0001-0782","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-2300-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T07:02:43Z","timestamp":1715842963000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-2300-3_11"}},"subtitle":["Practical Constant-Time Memory Management for Functional Programming"],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819722990","9789819723003"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-2300-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]}}}