Who?

I am a postdoctoral researcher at the Quantum Informatics group at the School of Informatics at University of Edinburgh.

I am interested in the applications of category theory in computer science, where I tend to use it in models of programming languages and logics, especially reversible aspects of classical and quantum computation.

Preprints

  1. C. Heunen and R. Kaarsgaard. Quantum Information Effects. arXiv preprint 2107.12144, 2021.

Publications

  1. R. Kaarsgaard and M. Rennela. Join inverse rig categories for reversible functional programming, and beyond. Accepted for 37th Conference on Mathematical Foundations of Programming Semantics (MFPS XXXVII), to appear, 2021.
  2. S. Bhaskar and R. Kaarsgaard. Graph Traversals as Universal Constructions. In F. Bonchi and S. J. Puglisi, editors, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), Leibniz International Proceedings in Informatics (LIPIcs) Volume 202, pages 17:1-17:20, 2021.
  3. C. Heunen and R. Kaarsgaard. Bennett and Stinespring, Together at Last. In M. Backens and C. Heunen, editors, 18th International Conference on Quantum Physics and Logic (QPL 2021), Electronic Proceedings in Theoretical Computer Science (EPTCS) Volume 343, pages 102–118, 2021.
  4. B. Aman, G. Ciobanu, R. Glück, R. Kaarsgaard, J. Kari, M. Kutrib, I. Lanese, C. A. Mezzina, Ł. Mikulski, R. Nagarajan, I. Phillips, M. Pinna, L. Prigioniero, I. Ulidowski and G. Vidal. Foundations of Reversible Computation. In I. Ulidowski, I. Lanese, U. P. Schultz and C. Ferreira, editors, Reversible Computation: Extending Horizons of Computing (Selected Results of the COST Action IC1405), Lecture Notes in Computer Science Volume 12070, pages 1–40, 2020.
  5. R. Glück, R. Kaarsgaard, and T. Yokoyama. Reversible Programs Have Reversible Semantics. In E. Sekerinski et al., editors, FM 2019 Workshops, Lecture Notes in Computer Science Volume 12233, pages 413–427, Springer Verlag, 2020.
  6. R. Kaarsgaard and N. Veltri. En garde! Unguarded iteration for reversible computation in the Delay monad. In G. Hutton, editor, 13th International Conference on Mathematics of Program Construction (MPC 2019), Lecture Notes in Computer Science Volume 11825, pages 366-384, 2019.
  7. R. Kaarsgaard. Condition/Decision Duality and the Internal Logic of Extensive Restriction Categories. In B. König, editor, Proceedings of the Thirty-Fifth Conference on the Mathematical Foundations of Programming Semantics (MFPS XXXV), Electronic Notes in Theoretical Computer Science Volume 347, pages 179–202, Elsevier, 2019.
  8. R. Kaarsgaard. Inversion, Iteration, and the Art of Dual Wielding. In M. Thomsen and M. Soeken, editors, Reversible Computation (RC 2019), Lecture Notes in Computer Science Volume 11497, pages 34–50, Springer Verlag, 2019.
  9. R. Kaarsgaard. The Logic of Reversible Computing - Theory and Practice. PhD thesis, Department of Computer Science, University of Copenhagen, 2018.
  10. R. Glück and R. Kaarsgaard. A categorical foundation for structured reversible flowchart languages: Soundness and adequacy. Logical Methods in Computer Science, volume 14(3), pages 1–38, 2018.
  11. P. A. H. Jacobsen, R. Kaarsgaard, and M. K. Thomsen. CoreFun: A Typed Functional Reversible Core Language. In J. Kari and I. Ulidowski, editors, Reversible Computation (RC 2018), Lecture Notes in Computer Science Volume 11106, pages 304–321, Springer Verlag, 2018.
  12. C. Heunen, R. Kaarsgaard, and M. Karvonen. Reversible effects as inverse arrows. In S. Staton, editor, Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics (MFPS XXXIV), Electronic Notes in Theoretical Computer Science Volume 341, pages 179–199, Elsevier, 2018.
  13. R. Glück and R. Kaarsgaard. A Categorical Foundation for Structured Reversible Flowchart Languages. In A. Silva, editor, Proceedings of the Thirty-third Conference on the Mathematical Foundations of Programming Semantics (MFPS XXXIII), Electronic Notes in Theoretical Computer Science Volume 336, pages 155–171, Elsevier, 2018.
  14. R. Kaarsgaard, H. B. Axelsen, and R. Glück. Join Inverse Categories and Reversible Recursion. Journal of Logical and Algebraic Methods in Programming, volume 87, pages 33–50, 2017.
  15. H. B. Axelsen, R. Glück, and R. Kaarsgaard. A Classical Propositional Logic for Reasoning about Reversible Logic Circuits. In J. Väänänen, Å. Hirvonen, and R. de Queiroz, editors, Logic, Language, Information, and Computation (WoLLIC), Lecture Notes in Computer Science Volume 9803, pages 52–67, Springer Verlag, 2016.
  16. H. B. Axelsen and R. Kaarsgaard. Join inverse categories as models of reversible recursion. In B. Jacobs and C. Löding, editors, Foundations of Software Science and Computation Structures (FoSSaCS 2016), Lecture Notes in Computer Science Volume 9634, pages 73–90, Springer Verlag, 2016.
  17. M. K. Thomsen, R. Kaarsgaard, and M. Soeken. Ricercar: A Language for Describing and Rewriting Reversible Circuits with Ancillae and its Permutation Semantics. In J. Krivine and J.-B. Stefani, editors, Reversible Computation (RC 2015), Lecture Notes in Computer Science Volume 9138, pages 200–215, Springer Verlag, 2015.

Teaching and supervision

While at the University of Copenhagen, I taught the following courses:

Supervision

If you're interested in writing a project with me on classical or quantum reversible computing, get in touch.

Contact