Join inverse categories and reversible recursion

Journal of Logical and Algebraic Methods in Programming

Volumn 87, Issue , 2017, Pages 33-50

  Kaarsgaard, Robin ^a   Axelsen, Holger Bock ^a   Glück, Robert ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Categorical semantics; Enriched category theory; Recursion; Reversible computing

Indexed keywords

COMPUTATION THEORY; INVERSE PROBLEMS; SEMANTICS; STRUCTURE (COMPOSITION);

ADDITIONAL STRUCTURES; CATEGORICAL SEMANTICS; DATA TYPE; ENRICHED CATEGORY THEORY; MORPHISMS; RECURSIONS; REVERSIBLE COMPUTING;

FUNCTIONAL PROGRAMMING;

EID: 84994112964     PISSN: 23522208     EISSN: 23522216     Source Type: Journal    
DOI: 10.1016/j.jlamp.2016.08.003     Document Type: Article

References (50)

1. [1] R. Kaarsgaard, Join inverse categories and reversible recursion, 2015, abstract presented at the 27th Nordic Workshop on Programming Theory.
2. [2] Axelsen, H.B., Kaarsgaard, R., Join inverse categories as models of reversible recursion. Jacobs, B., Löding, C., (eds.) Foundations of Software Science and Computation Structures, 19th International Conference, FoSSaCS 2016, Proceedings Lecture Notes in Computer Science, vol. 9634, 2016, Springer, 73–90.
3. [3] Landauer, R., Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5:3 (1961), 183–191.
4. [4] Fredkin, E., Toffoli, T., Conservative logic. Int. J. Theor. Phys. 21:3–4 (1982), 219–253.
5. [5] Bennett, C.H., Logical reversibility of computation. IBM J. Res. Dev. 17:6 (1973), 525–532.
6. [6] Axelsen, H.B., Glück, R., What do reversible programs compute?. Hofmann, M., (eds.) Foundations of Software Science and Computational Structures, 14th International Conference, FOSSACS 2011, Proceedings Lecture Notes in Computer Science, vol. 6604, 2011, Springer, 42–56.
7. [7] Kutrib, M., Wendlandt, M., Reversible limited automata. Durand-Lose, J., Nagy, B., (eds.) Machines, Computations, and Universality, 7th International Conference, MCU 2015, Proceedings Lecture Notes in Computer Science, vol. 9288, 2015, Springer, 113–128.
8. [8] Morita, K., Two-way reversible multihead automata. Fundam. Inform. 110:1–4 (2011), 241–254.
9. [9] Schordan, M., Jefferson, D., Barnes, P., Oppelstrup, T., Quinlan, D., Reverse code generation for parallel discrete event simulation. Krivine, J., Stefani, J.-B., (eds.) Reversible Computation, 7th International Conference, RC 2015, Proceedings Lecture Notes in Computer Science, vol. 9138, 2015, Springer, 95–110.
10. [10] Cristescu, I., Krivine, J., Varacca, D., A compositional semantics for the reversible π-calculus. LICS 2013, 2013, IEEE Computer Society, 388–397.
11. [11] Schultz, U.P., Bordignon, M., Støy, K., Robust and reversible execution of self-reconfiguration sequences. Robotica 29:1 (2011), 35–57.
12. [12] Schultz, U.P., Laursen, J.S., Ellekilde, L., Axelsen, H.B., Towards a domain-specific language for reversible assembly sequences. Krivine, J., Stefani, J.-B., (eds.) Reversible Computation, 7th International Conference, RC 2015, Proceedings Lecture Notes in Computer Science, vol. 9138, 2015, Springer, 111–126.
13. [13] Yokoyama, T., Glück, R., A reversible programming language and its invertible self-interpreter. Partial Evaluation and Program Manipulation. Proceedings, 2007, ACM, 144–153.
14. [14] Yokoyama, T., Axelsen, H.B., Glück, R., Fundamentals of reversible flowchart languages. Theor. Comput. Sci. 611 (2016), 87–115.
15. [15] James, R.P., Sabry, A., Theseus: A high level language for reversible computing. work-in-progress report at RC, 2014 available at https://www.cs.indiana.edu/~sabry/papers/theseus.pdf, 2014.
16. [16] Bowman, W.J., James, R.P., Sabry, A., Dagger traced symmetric monoidal categories and reversible programming. De Vos, A., Wille, R., (eds.) Reversible Computation 2011, Proceedings, 2011, Ghent University, 51–56.
17. [17] Cockett, J.R.B., Lack, S., Restriction categories I: categories of partial maps. Theor. Comput. Sci. 270:1–2 (2002), 223–259.
18. [18] Giles, B.G., An investigation of some theoretical aspects of reversible computing. Ph.D. thesis, 2014, University of Calgary.
19. [19] Guo, X., Products, joins, meets, and ranges in restriction categories. Ph.D. thesis, 2012, University of Calgary.
20. [20] Haghverdi, E., A categorical approach to linear logic, geometry of proofs and full completeness. Ph.D. thesis, 2000, Carlton University and University of Ottawa.
21. [21] Hoshino, N., A representation theorem for unique decomposition categories. Berger, U., Mislove, M., (eds.) MFPS XXVIII Electronic Notes in Theoretical Computer Science, vol. 286, 2012, Elsevier, 213–227.
22. [22] Yokoyama, T., Axelsen, H.B., Glück, R., Towards a reversible functional language. De Vos, A., Wille, R., (eds.) Reversible Computation, Third International Workshop, RC 2011, Revised papers Lecture Notes in Computer Science, vol. 7165, 2012, Springer, 14–29.
23. [23] Abramov, S.M., Glück, R., Principles of inverse computation and the universal resolving algorithm. Mogensen, T. Æ., Schmidt, D.A., Sudborough, I.H., (eds.) The Essence of Computation: Complexity, Analysis, Transformation Lecture Notes in Computer Science, vol. 2566, 2002, Springer, 269–295.
24. [24] Glück, R., Kawabe, M., Derivation of deterministic inverse programs based on LR parsing. Kameyama, Y., Stuckey, P.J., (eds.) Functional and Logic Programming, 7th International Symposium, FLOPS 2004, Proceedings Lecture Notes in Computer Science, vol. 2998, 2004, Springer, 291–306.
25. [25] Glück, R., Kawabe, M., A program inverter for a functional language with equality and constructors. Ohori, A., (eds.) Programming Languages and Systems, First Asian Symposium, APLAS 2003, Proceedings Lecture Notes in Computer Science, vol. 2895, 2003, Springer, 246–264.
26. [26] James, R.P., Sabry, A., Information effects. Proceedings of the 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '12, 2012, ACM, 73–84.
27. [27] Cockett, J.R.B., Lack, S., Restriction categories II: partial map classification. Theor. Comput. Sci. 294:1–2 (2003), 61–102.
28. [28] Cockett, J.R.B., Lack, S., Restriction categories III: colimits, partial limits and extensivity. Math. Struct. Comput. Sci. 17:4 (2007), 775–817.
29. [29] Lawson, M.V., Inverse Semigroups: The Theory of Partial Symmetries. 1998, World Scientific.
30. [30] Kastl, J., Inverse categories. Hoehnke, H.-J., (eds.) Algebraische Modelle, Kategorien und Gruppoide Studien zur Algebra und Ihre Anwendungen, vol. 7, 1979, Akademie-Verlag, 51–60.
31. 2. Computation, Logic, Games, and Quantum Foundations – The Many Facets of Samson Abramsky Lecture Notes in Computer Science, vol. 7860, 2013, Springer, 107–121.
32. [32] Robinson, E., Rosolini, G., Categories of partial maps. Inf. Comput. 79 (1988), 95–130.
33. [33] Adámek, J., Recursive data types in algebraically ω-complete categories. Inf. Comput. 118 (1995), 181–190.
34. [34] Barr, M., Algebraically compact functors. J. Pure Appl. Algebra 82:3 (1992), 211–231.
35. [35] Cockett, J.R.B., Guo, X., Join restriction categories and the importance of being adhesive. presentation at Category Theory (2007), 2007.
36. [36] Laplaza, M.L., Coherence for distributivity. Kelly, G.M., Laplaza, M.L., Lewis, G., Mac Lane, S., (eds.) Coherence in Categories Lecture Notes in Mathematics, vol. 281, 1972, Springer, 29–65.
37. [37] Carette, J., Sabry, A., Computing with semirings and weak rig groupoids. Thiemann, P., (eds.) Programming Languages and Systems, 25th European Symposium on Programming, Proceedings Lecture Notes in Computer Science, vol. 9632, 2016, Springer, 123–148.
38. [38] Joyal, A., Street, R., Verity, D., Traced monoidal categories. Math. Proc. Camb. Philos. Soc. 119:3 (1996), 447–468.
39. [39] Abramsky, S., Retracing some paths in process algebra. Montanari, U., Sassone, V., (eds.) CONCUR '96: Concurrency Theory, 7th International Conference, Proceedings Lecture Notes in Computer Science, vol. 1119, 1996, Springer, 1–17.
40. [40] Hasegawa, M., Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi. de Groote, P., Hindley, J.R., (eds.) Typed Lambda Calculi and Applications, Third International Conference on Typed Lambda Calculi and Applications, TLCA '97, Proceedings Lecture Notes in Computer Science, vol. 1210, 1997, Springer, 196–213.
41. [41] Hasegawa, M., Models of sharing graphs. Ph.D. thesis, 1997, University of Edinburgh.
42. [42] Hyland, M., Abstract and concrete models for recursion. Grumberg, O., Nipkow, T., Pfaller, C., (eds.) Proceedings of the NATO Advanced Study Institute on Formal Logical Methods for System Security and Correctness, 2008, IOS Press, 175–198.
43. [43] Selinger, P., A survey of graphical languages for monoidal categories. Coecke, B., (eds.) New Structures for Physics Lecture Notes in Physics, vol. 813, 2011, Springer, 289–355.
44. [44] Hines, P.M., The algebra of self-similarity and its applications. Ph.D. thesis, 1998, University of Wales, Bangor.
45. [45] Abramsky, S., Haghverdi, E., Scott, P., Geometry of Interaction and linear combinatory algebras. Math. Struct. Comput. Sci. 12:05 (2002), 625–665.
46. [46] Manes, E.G., Benson, D.B., The inverse semigroup of a sum-ordered semiring. Semigroup Forum 31:1 (1985), 129–152.
47. [47] Cockett, R., Garner, R., Restriction categories as enriched categories. Theor. Comput. Sci. 523 (2014), 37–55.
48. [48] Fiore, M.P., Axiomatic domain theory in categories of partial maps. Ph.D. thesis, 1994, University of Edinburgh.
49. [49] Selinger, P., Finite dimensional Hilbert spaces are complete for dagger compact closed categories. Log. Methods Comput. Sci. 8:3 (2012), 1–12.
50. [50] Selinger, P., Idempotents in dagger categories. Selinger, P., (eds.) QPL 2006 Electronic Notes in Theoretical Computer Science, vol. 210, 2008, Elsevier, 107–122.