{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:40:04Z","timestamp":1748461204368,"version":"3.41.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319208596"},{"type":"electronic","value":"9783319208602"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20860-2_5","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T08:15:57Z","timestamp":1434701757000},"page":"79-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Garbage Collection for Reversible Functional Languages"],"prefix":"10.1007","author":[{"given":"Torben \u00c6gidius","family":"Mogensen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-38986-3_9","volume-title":"Reversible Computation","author":"HB Axelsen","year":"2013","unstructured":"Axelsen, H.B., Gl\u00fcck, R.: Reversible representation and manipulation of constructor terms in the heap. In: Dueck, G.W., Miller, D.M. (eds.) RC 2013. LNCS, vol. 7948, pp. 96\u2013109. Springer, Heidelberg (2013)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/BFb0017210","volume-title":"Memory Management","author":"HG Baker","year":"1992","unstructured":"Baker, H.G.: Nreversal of fortune \u2014 the thermodynamics of garbage collection. In: Bekkers, Y., Cohen, J. (eds.) Memory Management. Lecture Notes in Computer Science, vol. 637, pp. 507\u2013524. Springer, Berlin Heidelberg (1992)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Broder, A.Z., Mitzenmacher, M.: Using multiple hash functions to improve IP lookups. In: Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001), vol. 3, pp. 1454\u20131463. IEEE Comput. Soc. Press (2001)","DOI":"10.1109\/INFCOM.2001.916641"},{"issue":"8","key":"5_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/368892.368907","volume":"1","author":"AP Ershov","year":"1958","unstructured":"Ershov, A.P.: On programming of arithmetic operations. Communications of the ACM 1(8), 3\u20136 (1958)","journal-title":"Communications of the ACM"},{"key":"5_CR5","unstructured":"Goto, E.: Monocopy and associative algorithms in an extended lisp. Technical Report TR 74\u201303, University of Tokyo (1974)"},{"key":"5_CR6","unstructured":"Hansen, J.S.K.: Translation of a reversible functional programming language. Master\u2019s thesis, DIKU, University of Copenhagen, December 2014"},{"key":"5_CR7","unstructured":"James, R.P., Sabry, A.: Theseus: a high-level language for reversible computation. In: Reversible Computation - Booklet of work-in-progress and short reports (2014). http:\/\/www.reversible-computation.org"},{"key":"5_CR8","unstructured":"Jenkins, B.: Hash functions. Dr. Dobb\u2019s Journal of Software Tools 22(7) (1997)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/978-3-642-04128-0_60","volume-title":"Algorithms - ESA 2009","author":"E Lehman","year":"2009","unstructured":"Lehman, E., Panigrahy, R.: 3.5-Way cuckoo hashing for the price of 2-and-a-bit. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 671\u2013681. Springer, Heidelberg (2009)"},{"key":"5_CR10","unstructured":"Lutz, C.: Janus: a time-reversible language. A letter to Landauer (1986). http:\/\/www.tetsuo.jp\/ref\/janus.pdf"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-29709-0_25","volume-title":"Perspectives of Systems Informatics","author":"T\u00c6 Mogensen","year":"2012","unstructured":"Mogensen, T.\u00c6.: Partial evaluation of janus part 2: assertions and procedures. In: Clarke, E., Virbitskaite, I., Voronkov, A. (eds.) PSI 2011. LNCS, vol. 7162, pp. 289\u2013301. Springer, Heidelberg (2012)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/978-3-319-08494-7_7","volume-title":"Reversible Computation","author":"T\u00c6 Mogensen","year":"2014","unstructured":"Mogensen, T.\u00c6.: Reference counting for reversible languages. In: Yamashita, S., Minato, S. (eds.) RC 2014. LNCS, vol. 8507, pp. 82\u201394. Springer, Heidelberg (2014)"},{"key":"5_CR13","unstructured":"Oh, C.W.: Reversible intermediate language for the translation of reversibleprogramming languages. Master\u2019s thesis, DIKU, University of Copenhagen, November 2009"},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"R Pagh","year":"2004","unstructured":"Pagh, R., Rodler, F.F.: Cuckoo hashing. J. Algorithms 51(2), 122\u2013144 (2004)","journal-title":"J. Algorithms"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-49543-6_13","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"M Raab","year":"1998","unstructured":"Raab, M., Steger, A.: \u201cBalls into bins\u201d - a simple and tight analysis. In: Rolim, J.D.P., Serna, M., Luby, M. (eds.) RANDOM 1998. LNCS, vol. 1518, pp. 159\u2013170. Springer, Heidelberg (1998)"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-29517-1_2","volume-title":"Reversible Computation","author":"T Yokoyama","year":"2012","unstructured":"Yokoyama, T., Axelsen, H.B., Gl\u00fcck, R.: Towards a reversible functional language. In: De Vos, A., Wille, R. (eds.) RC 2011. LNCS, vol. 7165, pp. 14\u201329. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20860-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:04:49Z","timestamp":1748459089000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20860-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319208596","9783319208602"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20860-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}