Computing with semirings and weak rig groupoids

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 9632, Issue , 2016, Pages 123-148

  Carette, Jacques ^a   Sabry, Amr ^b  

^a MCMASTER UNIVERSITY   (Canada)

^b INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CALCULATIONS; COMPUTATIONAL LINGUISTICS; COMPUTER CIRCUITS; DIFFERENTIATION (CALCULUS); FORMAL LOGIC; RECONFIGURABLE HARDWARE; SYNTACTICS;

HOMOTOPIES; PROGRAM TRANSFORMATIONS; PROGRAMMING MODELS; PROPOSITIONAL LOGIC; SEMI-RING; SEMIRINGS; SIMPLY TYPED LAMBDA CALCULUS; TYPE THEORY;

COMPUTATION THEORY;

EID: 84961707395     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-49498-1_6     Document Type: Conference Paper

References (33)

1. Baez, J., Stay, M.: Physics, topology, logic and computation: a Rosetta stone. arXiv:0903.0340 [quant-ph] (2009)
2. Baez, J.C., Dolan, J.: Categorification. In: Proceedings of Higher Category Theory, Contemporary Mathematics, vol. 230, pp. 1-36 (1998)
3. Beke, T.: Categorification, term rewriting and the Knuth-Bendix procedure. J. Pure Appl. Algebra 215(5), 728-740 (2011)
4. Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525-532 (1973)
5. Blass, A.: Seven trees in one. J. Pure Appl. Algebra 103, 1-21 (1995)
6. Bowman, W.J., James, R.P., Sabry, A.: Dagger traced symmetric monoidal categories and reversible programming. In: RC (2011)
7. DeBenedictis, E.P.: Reversible logic for supercomputing. In: Proceedings of the 2nd Conference on Computing Frontiers, CF 2005, pp. 391-402. ACM, New York (2005)
8. Dixon, L., Kissinger, A.: Open graphs and monoidal theories. arXiv:1011.4114 (2010)
9. Dosen, K., Petric, Z.: Proof-Theoretical Coherence. KCL Publications (College Publications), London (2004). http://www.mi.sanu.ac.yu/∼kosta/coh.pdf
10. Feynman, R.: Simulating physics with computers. Int. J. Theoret. Phys. 21, 467-488 (1982)
11. 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-2), 35-50 (2006)
12. Fiore, M.: Isomorphisms of generic recursive polynomial types. In: POPL, pp. 77-88. ACM (2004)
13. Fiore, M., Leinster, T.: An objective representation of the Gaussian integers. J. Symbolic Comput. 37(6), 707-716 (2004)
14. Frank, M.P.: Reversibility for efficient computing. Ph.D. thesis, Massachusetts Institute of Technology (1999)
15. Fredkin, E., Toffoli, T.: Conservative logic. Int. J. Theoret. Phys. 21(3), 219-253 (1982)
16. Girard, J.-Y.: Linear logic. Theoret. Comput. Sci. 50, 1-102 (1987)
17. Green, A.S., Altenkirch, T.: From reversible to irreversible computations. Electron. Notes Theoret. Comput. Sci. 210, 65-74 (2008)
18. Hasegawa, M.: Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi. In: TLCA, pp. 196-213 (1997)
19. Saiful Islam, Md.: A novel quantum cost efficient reversible full adder gate in nanotechnology. arXiv:1008.3533 (2010)
20. James, R.P., Sabry, A.: Information effects. In: POPL, pp. 73-84. ACM (2012)
21. James, R.P., Sabry, A.: Isomorphic interpreters from logically reversible abstract machines. In: RC (2012)
22. 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)
23. Kissinger, A.: Abstract tensor systems as monoidal categories. arXiv:1308.3586 (2013)
24. Kissinger, A., Quick, D.: Tensors, !-graphs, and non-commutative quantum structures. arXiv:1412.8552 (2014)
25. Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5, 183-191 (1961)
26. 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-65. Springer, Berlin (1972)
27. Mac Lane, S.: Categories for the Working Mathematician. Springer, New York (1971)
28. nLab: rig category (2015). http://ncatlab.org/nlab/show/rig+category
29. Peres, A.: Reversible logic and quantum computers. Phys. Rev. A 32(6), 3266 (1985)
30. Rittri, M.: Using types as search keys in function libraries. In: FPCA (1989)
31. Sparks, Z., Sabry, A.: Superstructural reversible logic. In: 3rd International Workshop on Linearity (2014)
32. Toffoli, T.: Reversible computing. In: de Bakker, J., van Leeuwen, J. (eds.) Automata, Languages and Programming. LNCS, vol. 85, pp. 632-644. Springer, Heidelberg (1980)
33. Univalent Foundations Program: Homotopy Type Theory: Univalent Foundations of Mathematics. Princeton, Institute for Advanced Study (2013)