{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:19:31Z","timestamp":1725851971046},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662496299"},{"type":"electronic","value":"9783662496305"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49630-5_5","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T09:04:32Z","timestamp":1458551072000},"page":"73-90","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Join Inverse Categories as Models of Reversible Recursion"],"prefix":"10.1007","author":[{"given":"Holger Bock","family":"Axelsen","sequence":"first","affiliation":[]},{"given":"Robin","family":"Kaarsgaard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-61604-7_44","volume-title":"CONCUR \u201996: Concurrency Theory","author":"S Abramsky","year":"1996","unstructured":"Abramsky, S.: Retracing some paths in process algebra. In: Montanari, U., Sassone, V. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 1\u201317. Springer, Heidelberg (1996)"},{"issue":"5","key":"5_CR2","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1017\/S0960129502003730","volume":"12","author":"S Abramsky","year":"2002","unstructured":"Abramsky, S., Haghverdi, E., Scott, P.: Geometry of interaction and linear combinatory algebras. Math. Struct. Comput. Sci. 12(5), 625\u2013665 (2002)","journal-title":"Math. Struct. Comput. Sci."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1006\/inco.1995.1061","volume":"118","author":"J Ad\u00e1mek","year":"1995","unstructured":"Ad\u00e1mek, J.: Recursive data types in algebraically \n                      \n                        \n                      \n                      $$\\omega $$\n                      \n                        \n                          \u03c9\n                        \n                      \n                    -complete categories. Inf. Comput. 118, 181\u2013190 (1995)","journal-title":"Inf. Comput."},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-19805-2_4","volume-title":"Foundations of Software Science and Computational Structures","author":"HB Axelsen","year":"2011","unstructured":"Axelsen, H.B., Gl\u00fcck, R.: What do reversible programs compute? In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol. 6604, pp. 42\u201356. Springer, Heidelberg (2011)"},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0022-4049(92)90169-G","volume":"82","author":"M Barr","year":"1992","unstructured":"Barr, M.: Algebraically compact functors. J. Pure Appl. Algebra 82(3), 211\u2013231 (1992)","journal-title":"J. Pure Appl. Algebra"},{"issue":"6","key":"5_CR6","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)","journal-title":"IBM J. Res. Dev."},{"key":"5_CR7","unstructured":"Bowman, W.J., James, R.P., Sabry, A.: Dagger traced symmetric monoidal categories and reversible programming. In: Proceedings of RC 2011, pp. 51\u201356. Ghent University (2011). \n                      http:\/\/www.cs.indiana.edu\/~sabry\/papers\/cat-rev.pdf"},{"key":"5_CR8","unstructured":"Cockett, J.R.B., Guo, X.: Join restriction categories and the importance of being adhesive (2007). \n                      http:\/\/www.mat.uc.pt\/~categ\/ct2007\/slides\/cockett.pdf\n                      \n                    , presentation at Category Theory 2007"},{"issue":"1\u20132","key":"5_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0304-3975(00)00382-0","volume":"270","author":"JRB Cockett","year":"2002","unstructured":"Cockett, J.R.B., Lack, S.: Restriction categories I: categories of partial maps. Theoret. Comput. Sci. 270(1\u20132), 223\u2013259 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"5_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0304-3975(01)00245-6","volume":"294","author":"JRB Cockett","year":"2003","unstructured":"Cockett, J.R.B., Lack, S.: Restriction categories II: partial map classification. Theoret. Comput. Sci. 294(1\u20132), 61\u2013102 (2003)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1017\/S0960129507006056","volume":"17","author":"JRB Cockett","year":"2007","unstructured":"Cockett, J.R.B., Lack, S.: Restriction categories III: colimits, partial limits and extensivity. Math. Struct. Comput. Sci. 17(4), 775\u2013817 (2007)","journal-title":"Math. Struct. Comput. Sci."},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.tcs.2013.12.018","volume":"523","author":"R Cockett","year":"2014","unstructured":"Cockett, R., Garner, R.: Restriction categories as enriched categories. Theoret. Comput. Sci. 523, 37\u201355 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Cristescu, I., Krivine, J., Varacca, D.: A compositional semantics for the reversible \n                      \n                        \n                      \n                      $$\\pi $$\n                      \n                        \n                          \u03c0\n                        \n                      \n                    -calculus. In: LICS 2013, pp. 388\u2013397. IEEE Computer Society (2013)","DOI":"10.1109\/LICS.2013.45"},{"key":"5_CR14","unstructured":"Fiore, M.P.: Axiomatic Domain Theory in Categories of Partial Maps. Ph.D. thesis, University of Edinburgh (1994)"},{"issue":"3\u20134","key":"5_CR15","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\u20134), 219\u2013253 (1982)","journal-title":"Int. J. Theor. Phys."},{"key":"5_CR16","unstructured":"Giles, B.G.: An Investigation of some Theoretical Aspects of Reversible Computing. Ph.D. thesis, University of Calgary (2014)"},{"key":"5_CR17","unstructured":"Guo, X.: Products, Joins, Meets, and Ranges in Restriction Categories. Ph.D. thesis, University of Calgary (2012)"},{"key":"5_CR18","unstructured":"Haghverdi, E.: A Categorical Approach to Linear Logic, Geometry of Proofs and Full Completeness. Ph.D. thesis, Carlton University and University of Ottawa (2000)"},{"key":"5_CR19","unstructured":"Hasegawa, M.: Models of Sharing Graphs. Ph.D. thesis, University of Edinburgh (1997)"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-62688-3_37","volume-title":"Typed Lambda Calculi and Applications","author":"M Hasegawa","year":"1997","unstructured":"Hasegawa, M.: Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi. In: de Groote, P., Hindley, J.R. (eds.) TLCA 1997. LNCS, vol. 1210, pp. 196\u2013213. Springer, Heidelberg (1997)"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/978-3-642-38164-5_8","volume-title":"Computation, Logic, Games, and Quantum Foundations","author":"C Heunen","year":"2013","unstructured":"Heunen, C.: On the functor \n                      \n                        \n                      \n                      $$\\ell ^{2}$$\n                      \n                        \n                          \n                            \u2113\n                            2\n                          \n                        \n                      \n                    . In: Coecke, B., Ong, L., Panangaden, P. (eds.) Computation, Logic, Games and Quantum Foundations. LNCS, vol. 7860, pp. 107\u2013121. Springer, Heidelberg (2013)"},{"key":"5_CR22","unstructured":"Hines, P.M.: The Algebra of Self-Similarity and its Applications. Ph.D. thesis, University of Wales, Bangor (1998)"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Hoshino, N.: A representation theorem for unique decomposition categories. In: Berger, U., Mislove, M. (eds.) MFPS XXVIII. Electronic Notes in Theoretical Computer Science, vol. 286, pp. 213\u2013227. Elsevier (2012)","DOI":"10.1016\/j.entcs.2012.08.014"},{"key":"5_CR24","unstructured":"Hyland, M.: Abstract and concrete models for recursion. In: Grumberg, O., Nipkow, T., Pfaller, C. (eds.) Proceedings of the NATO Advanced Study Institute on Formal Logical Methods for System Security and Correctness, pp. 175\u2013198. IOS Press (2008)"},{"key":"5_CR25","unstructured":"James, R.P., Sabry, A.: Theseus: a high level language for reversible computing, work-in-progress report at RC 2014 (2014). \n                      https:\/\/www.cs.indiana.edu\/~sabry\/papers\/theseus.pdf"},{"issue":"3","key":"5_CR26","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0305004100074338","volume":"119","author":"A Joyal","year":"1996","unstructured":"Joyal, A., Street, R., Verity, D.: Traced monoidal categories. Math. Proc. Camb. Philos. Soc. 119(3), 447\u2013468 (1996)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-319-23111-2_8","volume-title":"Machines, Computations, and Universality","author":"M Kutrib","year":"2015","unstructured":"Kutrib, M., Wendlandt, M.: Reversible limited automata. In: Durand-Lose, J., Nagy, B. (eds.) MCU 2015. LNCS, vol. 9288, pp. 113\u2013128. Springer, Heidelberg (2015)"},{"issue":"3","key":"5_CR28","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)","journal-title":"IBM J. Res. Dev."},{"key":"5_CR29","doi-asserted-by":"publisher","DOI":"10.1142\/3645","volume-title":"Inverse Semigroups: The Theory of Partial Symmetries","author":"MV Lawson","year":"1998","unstructured":"Lawson, M.V.: Inverse Semigroups: The Theory of Partial Symmetries. World Scientific, Singapore (1998)"},{"issue":"1","key":"5_CR30","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02572645","volume":"31","author":"EG Manes","year":"1985","unstructured":"Manes, E.G., Benson, D.B.: The inverse semigroup of a sum-ordered semiring. Semigroup Forum 31(1), 129\u2013152 (1985)","journal-title":"Semigroup Forum"},{"issue":"1\u20134","key":"5_CR31","doi-asserted-by":"crossref","first-page":"241","DOI":"10.3233\/FI-2011-541","volume":"110","author":"K Morita","year":"2011","unstructured":"Morita, K.: Two-way reversible multihead automata. Fundamenta Informaticae 110(1\u20134), 241\u2013254 (2011)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR32","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0890-5401(88)90034-X","volume":"79","author":"E Robinson","year":"1988","unstructured":"Robinson, E., Rosolini, G.: Categories of partial maps. Inf. Comput. 79, 95\u2013130 (1988)","journal-title":"Inf. Comput."},{"key":"5_CR33","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/978-3-319-20860-2_6","volume-title":"Reversible Computation","author":"Markus Schordan","year":"2015","unstructured":"Schordan, M., Jefferson, D., Barnes, P., Oppelstrup, T., Quinlan, D.: Reverse code generation for parallel discrete event simulation. In: Krivine, J., Stefani, J.B. (eds.) RC 2015. LNCS, vol. 9138, pp. 95\u2013110. Springer, Heidelberg (2015)"},{"issue":"1","key":"5_CR34","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1017\/S0263574710000664","volume":"29","author":"UP Schultz","year":"2011","unstructured":"Schultz, U.P., Bordignon, M., St\u00f8y, K.: Robust and reversible execution of self-reconfiguration sequences. Robotica 29(1), 35\u201357 (2011)","journal-title":"Robotica"},{"key":"5_CR35","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-319-20860-2_7","volume-title":"Reversible Computation","author":"Ulrik Pagh Schultz","year":"2015","unstructured":"Schultz, U.P., Laursen, J.S., Ellekilde, L., Axelsen, H.B.: Towards a domain-specific language for reversible assembly sequences. In: Krivine, J., Stefani, J.B. (eds.) RC 2015. LNCS, vol. 9138, pp. 111\u2013126. Springer, Heidelberg (2015)"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Selinger, P.: Idempotents in dagger categories. In: Selinger, P. (ed.) QPL 2006. Electronic Notes in Theoretical Computer Science, vol. 210, pp. 107\u2013122. Elsevier (2008)","DOI":"10.1016\/j.entcs.2008.04.021"},{"key":"5_CR37","series-title":"Lecture Notes in Physics","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-12821-9_4","volume-title":"New Structures for Physics","author":"P Selinger","year":"2011","unstructured":"Selinger, P.: A survey of graphical languages for monoidal categories. In: Coecke, B. (ed.) New Structures for Physics. Lecture Notes in Physics, vol. 813, pp. 289\u2013355. Springer, Heidelberg (2011)"},{"issue":"3","key":"5_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-8(3:6)2012","volume":"8","author":"P Selinger","year":"2012","unstructured":"Selinger, P.: Finite dimensional Hilbert spaces are complete for dagger compact closed categories. Logical Methods Comput. Sci. 8(3), 1\u201312 (2012)","journal-title":"Logical Methods Comput. Sci."},{"key":"5_CR39","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)"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"Yokoyama, T., Gl\u00fcck, R.: A reversible programming language and its invertible self-interpreter. In: Proceedings of the Partial Evaluation and Program Manipulation, pp. 144\u2013153. ACM (2007)","DOI":"10.1145\/1244381.1244404"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49630-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T01:06:40Z","timestamp":1585012000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49630-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662496299","9783662496305"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49630-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}