{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:29:19Z","timestamp":1767929359261,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662494974","type":"print"},{"value":"9783662494981","type":"electronic"}],"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-49498-1_6","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T13:36:06Z","timestamp":1458567366000},"page":"123-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Computing with Semirings and Weak Rig Groupoids"],"prefix":"10.1007","author":[{"given":"Jacques","family":"Carette","sequence":"first","affiliation":[]},{"given":"Amr","family":"Sabry","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Baez, J., Stay, M.: Physics, topology, logic and computation: a Rosetta stone. \n                    arXiv:0903.0340\n                    \n                   [quant-ph] (2009)","DOI":"10.1007\/978-3-642-12821-9_2"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Baez, J.C., Dolan, J.: Categorification. In: Proceedings of Higher Category Theory, Contemporary Mathematics, vol. 230, pp. 1\u201336 (1998)","DOI":"10.1090\/conm\/230\/03336"},{"issue":"5","key":"6_CR3","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1016\/j.jpaa.2010.06.019","volume":"215","author":"T Beke","year":"2011","unstructured":"Beke, T.: Categorification, term rewriting and the Knuth-Bendix procedure. J. Pure Appl. Algebra 215(5), 728\u2013740 (2011)","journal-title":"J. Pure Appl. Algebra"},{"key":"6_CR4","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, 525\u2013532 (1973)","journal-title":"IBM J. Res. Dev."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-4049(95)00098-H","volume":"103","author":"A Blass","year":"1995","unstructured":"Blass, A.: Seven trees in one. J. Pure Appl. Algebra 103, 1\u201321 (1995)","journal-title":"J. Pure Appl. Algebra"},{"key":"6_CR6","unstructured":"Bowman, W.J., James, R.P., Sabry, A.: Dagger traced symmetric monoidal categories and reversible programming. In: RC (2011)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"DeBenedictis, E.P.: Reversible logic for supercomputing. In: Proceedings of the 2nd Conference on Computing Frontiers, CF 2005, pp. 391\u2013402. ACM, New York (2005)","DOI":"10.1145\/1062261.1062325"},{"key":"6_CR8","unstructured":"Dixon, L., Kissinger, A.: Open graphs and monoidal theories. \n                    arXiv:1011.4114\n                    \n                   (2010)"},{"key":"6_CR9","unstructured":"Dosen, K., Petric, Z.: Proof-Theoretical Coherence. KCL Publications (College Publications), London (2004). \n                    http:\/\/www.mi.sanu.ac.yu\/~kosta\/coh.pdf"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","author":"R Feynman","year":"1982","unstructured":"Feynman, R.: Simulating physics with computers. Int. J. Theoret. Phys. 21, 467\u2013488 (1982)","journal-title":"Int. J. Theoret. Phys."},{"issue":"1\u20132","key":"6_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.apal.2005.09.001","volume":"141","author":"MP Fiore","year":"2006","unstructured":"Fiore, M.P., di Cosmo, R., Balat, V.: Remarks on isomorphisms in typed calculi with empty and sum types. Ann. Pure Appl. Logic 141(1\u20132), 35\u201350 (2006)","journal-title":"Ann. Pure Appl. Logic"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Fiore, M.: Isomorphisms of generic recursive polynomial types. In: POPL, pp. 77\u201388. ACM (2004)","DOI":"10.1145\/982962.964008"},{"issue":"6","key":"6_CR13","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1016\/j.jsc.2003.10.002","volume":"37","author":"M Fiore","year":"2004","unstructured":"Fiore, M., Leinster, T.: An objective representation of the Gaussian integers. J. Symbolic Comput. 37(6), 707\u2013716 (2004)","journal-title":"J. Symbolic Comput."},{"key":"6_CR14","unstructured":"Frank, M.P.: Reversibility for efficient computing. Ph.D. thesis, Massachusetts Institute of Technology (1999)"},{"issue":"3","key":"6_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. Theoret. Phys. 21(3), 219\u2013253 (1982)","journal-title":"Int. J. Theoret. Phys."},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J-Y Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theoret. Comput. Sci. 50, 1\u2013102 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.entcs.2008.04.018","volume":"210","author":"AS Green","year":"2008","unstructured":"Green, A.S., Altenkirch, T.: From reversible to irreversible computations. Electron. Notes Theoret. Comput. Sci. 210, 65\u201374 (2008)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Hasegawa, M.: Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi. In: TLCA, pp. 196\u2013213 (1997)","DOI":"10.1007\/3-540-62688-3_37"},{"key":"6_CR19","unstructured":"Saiful Islam, Md.: A novel quantum cost efficient reversible full adder gate in nanotechnology. \n                    arXiv:1008.3533\n                    \n                   (2010)"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"James, R.P., Sabry, A.: Information effects. In: POPL, pp. 73\u201384. ACM (2012)","DOI":"10.1145\/2103621.2103667"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"James, R.P., Sabry, A.: Isomorphic interpreters from logically reversible abstract machines. In: RC (2012)","DOI":"10.1007\/978-3-642-36315-3_5"},{"key":"6_CR22","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)"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Kissinger, A.: Abstract tensor systems as monoidal categories. \n                    arXiv:1308.3586\n                    \n                   (2013)","DOI":"10.1007\/978-3-642-54789-8_13"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Kissinger, A., Quick, D.: Tensors, \n                    \n                      \n                    \n                    $$!$$\n                    \n                      \n                        !\n                      \n                    \n                  -graphs, and non-commutative quantum structures. \n                    arXiv:1412.8552\n                    \n                   (2014)","DOI":"10.4204\/EPTCS.172.5"},{"key":"6_CR25","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, 183\u2013191 (1961)","journal-title":"IBM J. Res. Dev."},{"key":"6_CR26","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., Lane, S.M. (eds.) Coherence in Categories. LNM, vol. 281, pp. 29\u201365. Springer, Berlin (1972)"},{"key":"6_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-9839-7","volume-title":"Categories for the Working Mathematician","author":"S Mac Lane","year":"1971","unstructured":"Mac Lane, S.: Categories for the Working Mathematician. Springer, New York (1971)"},{"key":"6_CR28","unstructured":"nLab: rig category (2015). \n                    http:\/\/ncatlab.org\/nlab\/show\/rig+category"},{"issue":"6","key":"6_CR29","doi-asserted-by":"publisher","first-page":"3266","DOI":"10.1103\/PhysRevA.32.3266","volume":"32","author":"A Peres","year":"1985","unstructured":"Peres, A.: Reversible logic and quantum computers. Phys. Rev. A 32(6), 3266 (1985)","journal-title":"Phys. Rev. A"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Rittri, M.: Using types as search keys in function libraries. In: FPCA (1989)","DOI":"10.1145\/99370.99384"},{"key":"6_CR31","unstructured":"Sparks, Z., Sabry, A.: Superstructural reversible logic. In: 3rd International Workshop on Linearity (2014)"},{"key":"6_CR32","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.) Automata, Languages and Programming. LNCS, vol. 85, pp. 632\u2013644. Springer, Heidelberg (1980)"},{"key":"6_CR33","volume-title":"Homotopy Type Theory: Univalent Foundations of Mathematics","author":"Univalent Foundations Program","year":"2013","unstructured":"Univalent Foundations Program: Homotopy Type Theory: Univalent Foundations of Mathematics. Princeton, Institute for Advanced Study (2013)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49498-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T01:03:55Z","timestamp":1584925435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49498-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662494974","9783662494981"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49498-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}