{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T17:42:29Z","timestamp":1750786949854,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T00:00:00Z","timestamp":1442188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004836","name":"Det Frie Forskningsr\u00e5d","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004836","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000921","name":"European Cooperation in Science and Technology","doi-asserted-by":"publisher","award":["IC1405"],"award-info":[{"award-number":["IC1405"]}],"id":[{"id":"10.13039\/501100000921","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["7th Framework Programme"],"award-info":[{"award-number":["7th Framework Programme"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,9,14]]},"DOI":"10.1145\/2897336.2897345","type":"proceedings-article","created":{"date-parts":[[2016,7,21]],"date-time":"2016-07-21T15:20:09Z","timestamp":1469114409000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Interpretation and programming of the reversible functional language RFUN"],"prefix":"10.1145","author":[{"given":"Michael Kirkedal","family":"Thomsen","sequence":"first","affiliation":[{"name":"University of Bremen, Germany"}]},{"given":"Holger Bock","family":"Axelsen","sequence":"additional","affiliation":[{"name":"University of Copenhagen, Denmark"}]}],"member":"320","published-online":{"date-parts":[[2015,9,14]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"LNCS","first-page":"142","volume-title":"Compiler Construction. CC '11","author":"Axelsen H. B.","year":"2011","unstructured":"H. B. Axelsen . Clean translation of an imperative reversible programming language . In J. Knoop, editor, Compiler Construction. CC '11 , volume 6601 of LNCS , pages 142 -- 161 . Springer-Verlag , 2011 . H. B. Axelsen. Clean translation of an imperative reversible programming language. In J. Knoop, editor, Compiler Construction. CC '11, volume 6601 of LNCS, pages 142--161. Springer-Verlag, 2011."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"H. B.\n      Axelsen\n     and \n      R.\n      Gl\u00fcck\n  . \n  What do reversible programs compute? In M\n  . Hofmann editor Foundations of Software Science and Computational Structures volume \n  6604\n   of \n  LNCS pages \n  42\n  --\n  56\n  . \n  Springer-Verlag 2011\n  .   H. B. Axelsen and R. Gl\u00fcck. What do reversible programs compute? In M. Hofmann editor Foundations of Software Science and Computational Structures volume 6604 of LNCS pages 42--56. Springer-Verlag 2011.","DOI":"10.1007\/978-3-642-19805-2_4"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38986-3_9"},{"key":"e_1_3_2_1_4_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/978-3-319-26529-2_22","volume-title":"Programming Languages and Systems. Proceedings (APLAS)","author":"Axelsen H. B.","year":"2015","unstructured":"H. B. Axelsen and T. Yokoyama . Programming techniques for reversible comparison sorts . In X. Feng and S. Park, editors, Programming Languages and Systems. Proceedings (APLAS) , volume 9458 of LNCS , pages 407 -- 426 . Springer , 2015 . H. B. Axelsen and T. Yokoyama. Programming techniques for reversible comparison sorts. In X. Feng and S. Park, editors, Programming Languages and Systems. Proceedings (APLAS), volume 9458 of LNCS, pages 407--426. Springer, 2015."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.176.0525"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature10872"},{"key":"e_1_3_2_1_7_1","volume-title":"A new quantum ripple-carry addition circuit. arXiv:quant-ph\/0410184v1","author":"Cuccaro S. A.","year":"2005","unstructured":"S. A. Cuccaro , T. G. Draper , S. A. Kutin , and D. P. Moulton . A new quantum ripple-carry addition circuit. arXiv:quant-ph\/0410184v1 , 2005 . S. A. Cuccaro, T. G. Draper, S. A. Kutin, and D. P. Moulton. A new quantum ripple-carry addition circuit. arXiv:quant-ph\/0410184v1, 2005."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462177"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1959.1057537"},{"key":"e_1_3_2_1_11_1","volume-title":"Theseus: A high level language for reversible computing. Work in progress paper at RC","author":"James R. P.","year":"2014","unstructured":"R. P. James and A. Sabry . Theseus: A high level language for reversible computing. Work in progress paper at RC 2014 . Available at www.cs.indiana.edu\/~sabry\/papers\/theseus.pdf, 2014. R. P. James and A. Sabry. Theseus: A high level language for reversible computing. Work in progress paper at RC 2014. Available at www.cs.indiana.edu\/~sabry\/papers\/theseus.pdf, 2014."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.53.0183"},{"key":"e_1_3_2_1_13_1","volume-title":"Machines de Turing r\u00e9versibles. Comptes Rendus Hebdomadaires des S\u00e9ances de l'Acad\u00e9mie des Sciences, 257:2597--2600","author":"Lecerf Y.","year":"1963","unstructured":"Y. Lecerf . Machines de Turing r\u00e9versibles. Comptes Rendus Hebdomadaires des S\u00e9ances de l'Acad\u00e9mie des Sciences, 257:2597--2600 , 1963 . Y. Lecerf. Machines de Turing r\u00e9versibles. Comptes Rendus Hebdomadaires des S\u00e9ances de l'Acad\u00e9mie des Sciences, 257:2597--2600, 1963."},{"key":"e_1_3_2_1_14_1","unstructured":"C. Lutz and H. Derby. Janus: A time-reversible language. A letter to R. Landauer. http:\/\/tetsuo.jp\/ref\/janus.pdf 1986.  C. Lutz and H. Derby. Janus: A time-reversible language. A letter to R. Landauer. http:\/\/tetsuo.jp\/ref\/janus.pdf 1986."},{"key":"e_1_3_2_1_15_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-3-319-20860-2_5","volume-title":"J. Krivine and J.-B","author":"Mogensen T. A.","year":"2015","unstructured":"T. A. Mogensen . Garbage collection for reversible functional languages . In J. Krivine and J.-B . Stefani, editors, Reversible Computation, volume 9138 of Lecture Notes in Computer Science , pages 79 -- 94 . Springer International Publishing , 2015 . T. A. Mogensen. Garbage collection for reversible functional languages. In J. Krivine and J.-B. Stefani, editors, Reversible Computation, volume 9138 of Lecture Notes in Computer Science, pages 79--94. Springer International Publishing, 2015."},{"key":"e_1_3_2_1_16_1","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":"S. Yamashita and S.-i","author":"Mogensen T.","year":"2014","unstructured":"T. \u00c6. Mogensen . Reference counting for reversible languages . In S. Yamashita and S.-i . Minato, editors, Reversible Computation, volume 8507 of Lecture Notes in Computer Science , pages 82 -- 94 . Springer International Publishing , 2014 . T. \u00c6. Mogensen. Reference counting for reversible languages. In S. Yamashita and S.-i. Minato, editors, Reversible Computation, volume 8507 of Lecture Notes in Computer Science, pages 82--94. Springer International Publishing, 2014."},{"key":"e_1_3_2_1_17_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-3-319-20860-2_5","volume-title":"J. Krivine and J.-B","author":"Mogensen T.","year":"2015","unstructured":"T. \u00c6. Mogensen . Garbage collection for reversible functional languages . In J. Krivine and J.-B . Stefani, editors, Reversible Computation, volume 9138 of Lecture Notes in Computer Science , pages 79 -- 94 . Springer International Publishing , 2015 . T. \u00c6. Mogensen. Garbage collection for reversible functional languages. In J. Krivine and J.-B. Stefani, editors, Reversible Computation, volume 9138 of Lecture Notes in Computer Science, pages 79--94. Springer International Publishing, 2015."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1143\/JJAP.51.06FE10"},{"key":"e_1_3_2_1_19_1","first-page":"95","volume-title":"J. Krivine and J.-B","author":"Schordan M.","year":"2015","unstructured":"M. Schordan , D. Jefferson , P. Barnes , T. Oppelstrup , and D. Quinlan . Reverse code generation for parallel discrete event simulation . In J. Krivine and J.-B . Stefani, editors, Reversible Computation, 9138, pages 95 -- 110 . Springer , 2015 . M. Schordan, D. Jefferson, P. Barnes, T. Oppelstrup, and D. Quinlan. Reverse code generation for parallel discrete event simulation. In J. Krivine and J.-B. Stefani, editors, Reversible Computation, 9138, pages 95--110. Springer, 2015."},{"key":"e_1_3_2_1_20_1","first-page":"111","volume-title":"RC 2015, Grenoble, France, July 16-17, 2015","volume":"9138","author":"Schultz U. P.","year":"2015","unstructured":"U. P. Schultz , J. S. Laursen , L. Ellekilde , and H. B. Axelsen . Towards a domain-specific language for reversible assembly sequences. In J. Krivine and J. Stefani, editors, Reversible Computation - 7th International Conference , RC 2015, Grenoble, France, July 16-17, 2015 , Proceedings , volume 9138 , pages 111 -- 126 , 2015 . U. P. Schultz, J. S. Laursen, L. Ellekilde, and H. B. Axelsen. Towards a domain-specific language for reversible assembly sequences. In J. Krivine and J. Stefani, editors, Reversible Computation - 7th International Conference, RC 2015, Grenoble, France, July 16-17, 2015, Proceedings, volume 9138, pages 111--126, 2015."},{"key":"e_1_3_2_1_21_1","first-page":"135","article-title":"A functional language for describing reversible logic. In Specification & Design Languages","volume":"2012","author":"Thomsen M. K.","year":"2012","unstructured":"M. K. Thomsen . A functional language for describing reversible logic. In Specification & Design Languages , FDL 2012 , pages 135 -- 142 . IEEE, 2012 . M. K. Thomsen. A functional language for describing reversible logic. In Specification & Design Languages, FDL 2012, pages 135--142. IEEE, 2012.","journal-title":"FDL"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.147"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNC.2012.73"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_22"},{"issue":"1","key":"e_1_3_2_1_25_1","first-page":"5","article-title":"Optimizing reversible simulation of injective functions","volume":"18","author":"Yokoyama T.","year":"2012","unstructured":"T. Yokoyama , H. B. Axelsen , and R. Gl\u00fcck . Optimizing reversible simulation of injective functions . Multiple-Valued Logic and Soft Computing , 18 ( 1 ): 5 -- 24 , 2012 . T. Yokoyama, H. B. Axelsen, and R. Gl\u00fcck. Optimizing reversible simulation of injective functions. Multiple-Valued Logic and Soft Computing, 18(1):5--24, 2012.","journal-title":"Multiple-Valued Logic and Soft Computing"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29517-1_2"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.07.046"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1244381.1244404"}],"event":{"name":"IFL '15: Symposium on the implementation and application of functional programming languages","acronym":"IFL '15","location":"Koblenz Germany"},"container-title":["Proceedings of the 27th Symposium on the Implementation and Application of Functional Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897336.2897345","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897336.2897345","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:39:02Z","timestamp":1750221542000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897336.2897345"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,14]]},"references-count":27,"alternative-id":["10.1145\/2897336.2897345","10.1145\/2897336"],"URL":"https:\/\/doi.org\/10.1145\/2897336.2897345","relation":{},"subject":[],"published":{"date-parts":[[2015,9,14]]},"assertion":[{"value":"2015-09-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}