{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:35:15Z","timestamp":1743150915051,"version":"3.40.3"},"publisher-location":"Cham","reference-count":60,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031620751"},{"type":"electronic","value":"9783031620768"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-62076-8_2","type":"book-chapter","created":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T09:02:35Z","timestamp":1716886955000},"page":"10-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compositional Reversible Computation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8993-9804","authenticated-orcid":false,"given":"Jacques","family":"Carette","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7393-2640","authenticated-orcid":false,"given":"Chris","family":"Heunen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7672-799X","authenticated-orcid":false,"given":"Robin","family":"Kaarsgaard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1025-7331","authenticated-orcid":false,"given":"Amr","family":"Sabry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,29]]},"reference":[{"key":"2_CR1","unstructured":"Aharonov, D.: A simple proof that Toffoli and Hadamard are quantum universal (2003). arXiv:quant-ph\/0301040"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Andr\u00e9s-Mart\u00ednez, P., Heunen, C., Kaarsgaard, R.: Universal properties of partial quantum maps (2022). arXiv:2206.04814","DOI":"10.4204\/EPTCS.394.11"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Aubert, C.: The correctness of concurrencies in (reversible) concurrent calculi. J. Log. Algebraic Methods Program. 100924 (2023). https:\/\/doi.org\/10.1016\/j.jlamp.2023.100924","DOI":"10.1016\/j.jlamp.2023.100924"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-19861-8_9","volume-title":"Compiler Construction","author":"HB Axelsen","year":"2011","unstructured":"Axelsen, H.B.: Clean translation of an imperative reversible programming language. In: Knoop, J. (ed.) CC 2011. LNCS, vol. 6601, pp. 144\u2013163. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19861-8_9"},{"key":"2_CR5","unstructured":"Axelsen, H.B.: Private communication (2015)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Baez, J.C., Dolan, J.: From finite sets to Feynman diagrams (2000). arXiv:000413","DOI":"10.1007\/978-3-642-56478-9_3"},{"key":"2_CR7","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\u2014the thermodynamics of garbage collection. In: Bekkers, Y., Cohen, J. (eds.) IWMM 1992. LNCS, vol. 637, pp. 507\u2013524. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0017210"},{"issue":"6","key":"2_CR8","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"CH Bennett","year":"1973","unstructured":"Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17(6), 525\u2013532 (1973). https:\/\/doi.org\/10.1147\/rd.176.0525","journal-title":"IBM J. Res. Dev."},{"issue":"7388","key":"2_CR9","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1038\/nature10872","volume":"483","author":"A B\u00e9rut","year":"2012","unstructured":"B\u00e9rut, A., Arakelyan, A., Petrosyan, A., Ciliberto, S., Dillenschneider, R., Lutz, E.: Experimental verification of Landauer\u2019s principle linking information and thermodynamics. Nature 483(7388), 187\u2013189 (2012). https:\/\/doi.org\/10.1038\/nature10872","journal-title":"Nature"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-540-85101-1_6","volume-title":"Algebraic Biology","author":"L Cardelli","year":"2008","unstructured":"Cardelli, L., Zavattaro, G.: On the computational power of biochemistry. In: Horimoto, K., Regensburger, G., Rosenkranz, M., Yoshida, H. (eds.) AB 2008. LNCS, vol. 5147, pp. 65\u201380. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85101-1_6"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Carette, J., Heunen, C., Kaarsgaard, R., Sabry, A.: With a few square roots, quantum computing is as easy as $$\\Pi $$. Proc. ACM Program. Lang. 8(POPL), 546\u2013574 (2024)","DOI":"10.1145\/3632861"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Carette, J., James, R.P., Sabry, A.: Embracing the laws of physics: three reversible models of computation. Adv. Comput. 126, 15\u201363 (2022). https:\/\/doi.org\/10.1016\/bs.adcom.2021.11.009, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0065245821000838","DOI":"10.1016\/bs.adcom.2021.11.009"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-662-49498-1_6","volume-title":"Programming Languages and Systems","author":"J Carette","year":"2016","unstructured":"Carette, J., Sabry, A.: Computing with semirings and weak rig groupoids. In: Thiemann, P. (ed.) ESOP 2016. LNCS, vol. 9632, pp. 123\u2013148. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49498-1_6"},{"key":"2_CR14","unstructured":"Carette, J., Heunen, C., Kaarsgaard, R., Sabry, A.: The quantum effect: a recipe for QuantumPi (2023). arXiv:2302.01885"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Choudhury, V., Karwowski, J., Sabry, A.: Symmetries in reversible programming: from symmetric rig groupoids to reversible programming languages. Proc. ACM Program. Lang. 6(POPL) (2022). https:\/\/doi.org\/10.1145\/3498667","DOI":"10.1145\/3498667"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Church, A.: A set of postulates for the foundation of logic. Ann. Math. 33(2), 346\u2013366 (1932). http:\/\/www.jstor.org\/stable\/1968337","DOI":"10.2307\/1968337"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-28644-8_19","volume-title":"CONCUR 2004 - Concurrency Theory","author":"V Danos","year":"2004","unstructured":"Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292\u2013307. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28644-8_19"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11787006_1","volume-title":"Automata, Languages and Programming","author":"C Dwork","year":"2006","unstructured":"Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 1\u201312. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_1"},{"issue":"3","key":"2_CR19","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01857727","volume":"21","author":"E Fredkin","year":"1982","unstructured":"Fredkin, E., Toffoli, T.: Conservative logic. Int. J. Theor. Phys. 21(3), 219\u2013253 (1982). https:\/\/doi.org\/10.1007\/BF01857727","journal-title":"Int. J. Theor. Phys."},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-24754-8_21","volume-title":"Functional and Logic Programming","author":"R Gl\u00fcck","year":"2004","unstructured":"Gl\u00fcck, R., Kawabe, M.: Derivation of deterministic inverse programs based on LR parsing. In: Kameyama, Y., Stuckey, P.J. (eds.) FLOPS 2004. LNCS, vol. 2998, pp. 291\u2013306. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24754-8_21"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Gl\u00fcck, R., Yokoyama, T.: Reversible computing from a programming language perspective. Theoret. Comput. Sci. 953, 113429 (2023). https:\/\/doi.org\/10.1016\/j.tcs.2022.06.010, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397522003619","DOI":"10.1016\/j.tcs.2022.06.010"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-38164-5_8","volume-title":"Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky","author":"C Heunen","year":"2013","unstructured":"Heunen, C.: On the functor $$\\ell ^{2}$$. In: Coecke, B., Ong, L., Panangaden, P. (eds.) Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky. LNCS, vol. 7860, pp. 107\u2013121. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38164-5_8"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Heunen, C., Kaarsgaard, R.: Bennett and Stinespring, together at last. In: Proceedings 18th International Conference on Quantum Physics and Logic (QPL 2021). Electronic Proceedings in Theoretical Computer Science, vol.\u00a0343, pp. 102\u2013118. OPA (2021). https:\/\/doi.org\/10.4204\/EPTCS.343.5","DOI":"10.4204\/EPTCS.343.5"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Heunen, C., Kaarsgaard, R.: Quantum information effects. Proc. ACM Program. Lang. 6(POPL), 1\u201327 (2022)","DOI":"10.1145\/3498663"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Heunen, C., Kaarsgaard, R., Karvonen, M.: Reversible effects as inverse arrows. In: Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics (MFPS XXXIV). Electronic Notes in Theoretical Computer Science, vol.\u00a0341, pp. 179\u2013199. Elsevier (2018)","DOI":"10.1016\/j.entcs.2018.11.009"},{"key":"2_CR26","first-page":"1016","volume":"31","author":"C Heunen","year":"2016","unstructured":"Heunen, C., Karvonen, M.: Monads on dagger categories. Theory Appl. Categories 31, 1016\u20131043 (2016)","journal-title":"Theory Appl. Categories"},{"key":"2_CR27","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198739623.001.0001","volume-title":"Categories for Quantum Theory","author":"C Heunen","year":"2019","unstructured":"Heunen, C., Vicary, J.: Categories for Quantum Theory. Oxford University Press, Oxford (2019)"},{"issue":"8","key":"2_CR28","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"CAR Hoare","year":"1978","unstructured":"Hoare, C.A.R.: Communicating sequential processes. Commun. ACM 21(8), 666\u2013677 (1978). https:\/\/doi.org\/10.1145\/359576.359585","journal-title":"Commun. ACM"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/11546382_2","volume-title":"Advanced Functional Programming","author":"J Hughes","year":"2005","unstructured":"Hughes, J.: Programming with arrows. In: Vene, V., Uustalu, T. (eds.) AFP 2004. LNCS, vol. 3622, pp. 73\u2013129. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11546382_2"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Huot, M., Staton, S.: Quantum channels as a categorical completion. In: Proceedings of the ACM\/IEEE Symposium on Logic in Computer Science, vol.\u00a035, pp. 1\u201313 (2019)","DOI":"10.1109\/LICS.2019.8785700"},{"key":"2_CR31","doi-asserted-by":"publisher","unstructured":"Huot, M., Staton, S.: Universal properties in quantum theory. In: Selinger, P., Chiribella, G. (eds.) Proceedings of the 15th International Conference on Quantum Physics and Logic (QPL 2018). Electronic Proceedings in Theoretical Computer Science, vol.\u00a0287, pp. 213\u2013224. Open Publishing Association (2018).https:\/\/doi.org\/10.4204\/EPTCS.287.12","DOI":"10.4204\/EPTCS.287.12"},{"issue":"3\u20134","key":"2_CR32","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1017\/S0956796809007308","volume":"19","author":"B Jacobs","year":"2009","unstructured":"Jacobs, B., Heunen, C., Hasuo, I.: Categorical semantics for Arrows. J. Funct. Program. 19(3\u20134), 403\u2013438 (2009). https:\/\/doi.org\/10.1017\/S0956796809007308","journal-title":"J. Funct. Program."},{"key":"2_CR33","doi-asserted-by":"publisher","unstructured":"James, R.P., Sabry, A.: Information effects. In: POPL 2012: Proceedings of the 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of programming languages, pp. 73\u201384. ACM (2012). https:\/\/doi.org\/10.1145\/2103656.2103667","DOI":"10.1145\/2103656.2103667"},{"key":"2_CR34","unstructured":"Kaarsgaard, R., Gl\u00fcck, R.: A categorical foundation for structured reversible flowchart languages: soundness and adequacy. Log. Methods Comput. Sci. 14(3) (2018)"},{"key":"2_CR35","unstructured":"Kaarsgaard, R.: The logic of reversible computing: theory and practice. Ph.D. thesis, Department of Computer Science, University of Copenhagen (2018)"},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Kastl, J.: Algebraische Modelle, Kategorien und Gruppoide, Studien zur Algebra und ihre Anwendungen, vol.\u00a07, chap. Inverse categories, pp. 51\u201360. Akademie-Verlag, Berlin (1979)","DOI":"10.1515\/9783112708651-006"},{"key":"2_CR37","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BFb0063106","volume-title":"Category Seminar","author":"GM Kelly","year":"1974","unstructured":"Kelly, G.M.: Coherence theorems for lax algebras and for distributive laws. In: Kelly, G.M. (ed.) Category Seminar. LNM, vol. 420, pp. 281\u2013375. Springer, Heidelberg (1974). https:\/\/doi.org\/10.1007\/BFb0063106"},{"issue":"3","key":"2_CR38","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1147\/rd.53.0183","volume":"5","author":"R Landauer","year":"1961","unstructured":"Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5(3), 183\u2013191 (1961). https:\/\/doi.org\/10.1147\/rd.53.0183","journal-title":"IBM J. Res. Dev."},{"key":"2_CR39","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BFb0059555","volume-title":"Coherence in Categories","author":"ML Laplaza","year":"1972","unstructured":"Laplaza, M.L.: Coherence for distributivity. In: Kelly, G.M., Laplaza, M., Lewis, G., Mac Lane, S. (eds.) Coherence in Categories. LNM, vol. 281, pp. 29\u201365. Springer, Heidelberg (1972). https:\/\/doi.org\/10.1007\/BFb0059555"},{"key":"2_CR40","first-page":"2597","volume":"257","author":"Y Lecerf","year":"1963","unstructured":"Lecerf, Y.: Machines de Turing reversibles. Compt. Rendus hebdomadaires seances l\u2019acad. sci. 257, 2597\u20132600 (1963)","journal-title":"Compt. Rendus hebdomadaires seances l\u2019acad. sci."},{"key":"2_CR41","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107360068","volume-title":"Basic Category Theory","author":"T Leinster","year":"2014","unstructured":"Leinster, T.: Basic Category Theory. Cambridge University Press, Cambridge (2014)"},{"key":"2_CR42","doi-asserted-by":"publisher","unstructured":"Ma, X., Huang, J., Lombardi, F.: A model for computing and energy dissipation of molecular QCA devices and circuits. J. Emerg. Technol. Comput. Syst. 3(4) (2008). https:\/\/doi.org\/10.1145\/1324177.1324180","DOI":"10.1145\/1324177.1324180"},{"key":"2_CR43","unstructured":"Mac Lane, S.: Natural associativity and commutativity. Rice Univ. Stud. 49(4) (1963)"},{"key":"2_CR44","doi-asserted-by":"publisher","unstructured":"Macii, E., Poncino, M.: Exact computation of the entropy of a logic circuit. In: Proceedings of the Sixth Great Lakes Symposium on VLSI, pp. 162\u2013167 (1996). https:\/\/doi.org\/10.1109\/GLSV.1996.497613","DOI":"10.1109\/GLSV.1996.497613"},{"key":"2_CR45","doi-asserted-by":"crossref","unstructured":"McCarthy, J.: The inversion of functions defined by Turing machines. In: C.E.\u00a0Shannon, J.M. (ed.) Automata Studies, Annals of Mathematical Studies, pp. 177\u2013181. No.\u00a034. Princeton University Press (1956)","DOI":"10.1515\/9781400882618-009"},{"key":"2_CR46","doi-asserted-by":"publisher","unstructured":"Milner, R.: A Calculus of Communicating Systems. Lecture Notes in Computer Science, vol.\u00a092. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10235-3","DOI":"10.1007\/3-540-10235-3"},{"issue":"2","key":"2_CR47","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1017\/S0960129500001407","volume":"2","author":"R Milner","year":"1992","unstructured":"Milner, R.: Functions as processes. Math. Struct. Comput. Sci. 2(2), 119\u2013141 (1992). https:\/\/doi.org\/10.1017\/S0960129500001407","journal-title":"Math. Struct. Comput. Sci."},{"key":"2_CR48","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computations and monads. Inf. Comput. 93, 55\u201392 (1991)","journal-title":"Inf. Comput."},{"key":"2_CR49","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2002","unstructured":"Nielsen, M.A., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2002)"},{"key":"2_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/11690634_17","volume-title":"Foundations of Software Science and Computation Structures","author":"I Phillips","year":"2006","unstructured":"Phillips, I., Ulidowski, I.: Reversing algebraic process calculi. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FoSSaCS 2006. LNCS, vol. 3921, pp. 246\u2013260. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11690634_17"},{"issue":"1","key":"2_CR51","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/JSAC.2002.806121","volume":"21","author":"A Sabelfeld","year":"2003","unstructured":"Sabelfeld, A., Myers, A.: Language-based information-flow security. IEEE J. Sel. Areas Commun. 21(1), 5\u201319 (2003). https:\/\/doi.org\/10.1109\/JSAC.2002.806121","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"1","key":"2_CR52","first-page":"84","volume":"3","author":"Y Shi","year":"2003","unstructured":"Shi, Y.: Both Toffoli and controlled-NOT need little help to do universal quantum computing. Quantum Info. Comput. 3(1), 84\u201392 (2003)","journal-title":"Quantum Info. Comput."},{"issue":"2","key":"2_CR53","doi-asserted-by":"publisher","first-page":"211","DOI":"10.2307\/2032342","volume":"6","author":"WF Stinespring","year":"1955","unstructured":"Stinespring, W.F.: Positive functions on C*-algebras. Proc. Am. Math. Soc. 6(2), 211\u2013216 (1955). https:\/\/doi.org\/10.2307\/2032342","journal-title":"Proc. Am. Math. Soc."},{"key":"2_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-319-20860-2_13","volume-title":"Reversible Computation","author":"MK Thomsen","year":"2015","unstructured":"Thomsen, M.K., Kaarsgaard, R., Soeken, M.: Ricercar: a language for describing and\u00a0rewriting reversible circuits with Ancillae and its permutation semantics. In: Krivine, J., Stefani, J.-B. (eds.) RC 2015. LNCS, vol. 9138, pp. 200\u2013215. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20860-2_13"},{"key":"2_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/3-540-10003-2_104","volume-title":"Automata, Languages and Programming","author":"T Toffoli","year":"1980","unstructured":"Toffoli, T.: Reversible computing. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 632\u2013644. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10003-2_104"},{"issue":"5","key":"2_CR56","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1137\/S0097539703432165","volume":"33","author":"A van Tonder","year":"2004","unstructured":"van Tonder, A.: A lambda calculus for quantum computation. SIAM J. Comput. 33(5), 1109\u20131135 (2004). https:\/\/doi.org\/10.1137\/S0097539703432165","journal-title":"SIAM J. Comput."},{"key":"2_CR57","doi-asserted-by":"publisher","unstructured":"Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. s2-42(1), 230\u2013265 (1937). https:\/\/doi.org\/10.1112\/plms\/s2-42.1.230, https:\/\/londmathsoc.onlinelibrary.wiley.com\/doi\/abs\/10.1112\/plms\/s2-42.1.230","DOI":"10.1112\/plms\/s2-42.1.230"},{"key":"2_CR58","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813887","volume-title":"Quantum Computing for Computer Scientists","author":"N Yanofsky","year":"2008","unstructured":"Yanofsky, N., Mannucci, M.A.: Quantum Computing for Computer Scientists. Cambridge University Press, Cambridge (2008)"},{"issue":"9","key":"2_CR59","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1145\/362342.362360","volume":"16","author":"MV Zelkowitz","year":"1973","unstructured":"Zelkowitz, M.V.: Reversible execution. Commun. ACM 16(9), 566 (1973). https:\/\/doi.org\/10.1145\/362342.362360","journal-title":"Commun. ACM"},{"key":"2_CR60","doi-asserted-by":"publisher","unstructured":"Zeng, H., Ellis, C.S., Lebeck, A.R., Vahdat, A.: Ecosystem: managing energy as a first class operating system resource. In: Proceedings of the 10th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS X, pp. 123\u2013132. Association for Computing Machinery, New York (2002). https:\/\/doi.org\/10.1145\/605397.605411","DOI":"10.1145\/605397.605411"}],"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-031-62076-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T05:24:31Z","timestamp":1732080271000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62076-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031620751","9783031620768"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62076-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"RC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reversible Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toru\u0144","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rc2024.mat.umk.pl\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}