Robin Kaarsgaard

Who?

I am (tenure-track) assistant professor in the Section for Artificial Intelligence, Cybersecurity, and Programming Languages at the Department of Mathematics and Computer Science at University of Southern Denmark. I am also associated with the Centre for Quantum Mathematics.

My research focuses on quantum programming languages and their semantics, and more broadly on the applications of category theory to computer science.

News

• Our paper "With a Few Square Roots, Quantum Computing is as Easy as Pi" with Jacques Carette, Chris Heunen, and Amr Sabry was accepted for POPL 2024!
• New office! I've moved from Ø14-602b-1 to Ø17-604b-2.
• Member of the program committee for PLanQC 2024.
• Member of the program committee for IFL 2023.
• I am giving an invited talk in the special session on Progress and challenges of quantum computing in its NISQ era at NCM 2023 in Aalborg, Denmark.
• I'm giving an invited talk at RC 2023 in Giessen, Germany.
• Chair of the program committee for SYCO 10.
• Member of the program committee for IFL 2022.
• Travelling to Oxford for QPL 2022, June 27 – July 1, 2022. Come say hi!
• Member of the program committee for ACT 2022.

Preprints

1. J. Carette, C. Heunen, R. Kaarsgaard and A. Sabry. The Quantum Effect: A Recipe for QuantumPi. arXiv preprint 2302.01885, 2023.
2. J. T. Kristensen, R. Kaarsgaard and M. K. Thomsen. Jeopardy: An Invertible Functional Programming Language. arXiv preprint 2209.02422, 2022.

Publications

1. J. Carette, C. Heunen, R. Kaarsgaard and A. Sabry. With a Few Square Roots, Quantum Computing is as Easy as Pi. Accepted for POPL 2024, arXiv preprint 2310.14056, 2023.
2. J. T. Kristensen, R. Kaarsgaard and M. K. Thomsen. Tail recursion transformation for invertible functions. Accepted for 15th International Conference on Reversible Computation (RC 2023), to appear, 2023.
3. J. T. Kristensen, R. Kaarsgaard and M. K. Thomsen. Branching execution symmetry in Jeopardy by available implicit arguments analysis. Accepted for Norwegian Informatics Conference (NIK 2022), to appear, 2022.
4. P. A. Martínez, C. Heunen and R. Kaarsgaard. Universal Properties of Partial Quantum Maps. Accepted for Quantum Physics and Logic (QPL 2022), to appear, 2022.
5. F. Henglein, R. Kaarsgaard and M. K. Mathiesen. Algeo: An Algebraic Approach to Reversibility. In C. A. Mezzina and K. Podlaski, editors, Reversible Computation (RC 2022), Lecture Notes in Computer Science Volume 13354, pages 128–145, Springer Verlag, 2022.
6. R. Glück, R. Kaarsgaard and T. Yokoyama. From Reversible Programming Languages to Reversible Metalanguages. Theoretical Computer Science, Volume 920, pages 46–63, 2022.
7. M. Elsman, F. Henglein, R. Kaarsgaard, M. K. Mathiesen and R. Schenck. Combinatory adjoints and differentiation. In J. Gibbons and M. S. New, editors, Proceedings Ninth Workshop on Mathematically Structured Functional Programming (MSFP 2022), Electronic Proceedings in Theoretical Computer Science (EPTCS) Volume 360, pages 1–26, 2022.
8. F. Henglein, R. Kaarsgaard and M. K. Mathiesen. The Programming of Algebra. In J. Gibbons and M. S. New, editors, Proceedings Ninth Workshop on Mathematically Structured Functional Programming (MSFP 2022), Electronic Proceedings in Theoretical Computer Science (EPTCS) Volume 360, pages 71–92, 2022.
9. C. Heunen and R. Kaarsgaard. Quantum Information Effects. In Proceedings of the ACM on Programming Languages, Volume 6, Issue POPL, Article No. 2, pages 1–27, 2022.
10. R. Kaarsgaard and M. Rennela. Join inverse rig categories for reversible functional programming, and beyond. In A. Sokolova, editor, Proceedings 37th Conference on Mathematical Foundations of Programming Semantics (MFPS XXXVII), Electronic Proceedings in Theoretical Computer Science (EPTCS) Volume 351, pages 152-167, 2021.
11. 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.
12. 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.
13. 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.
14. 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.
15. 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.
16. 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.
17. 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.
18. 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.
19. 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.
20. 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.
21. 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.
22. 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.
23. 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.
24. 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.
25. 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.

Thesis

1. R. Kaarsgaard. The Logic of Reversible Computing - Theory and Practice. PhD thesis, Department of Computer Science, University of Copenhagen, 2018.

Teaching and supervision

• Spring 2023: Objektorienteret programmering (lecturer)
• Autumn 2023: Quantum Computing (lecturer, course head)

• Spring 2022: Categories and Quantum Informatics (lecturer)

• Autumn 2020: Grundlæggende Datalogi (lecturer)
• Autumn 2019: Logic in Computer Science (lecturer, course head)
• Spring 2019: Softwareudvikling (lecturer)
• Spring 2019: Programming Language Design (lecturer)
• Autumn 2018: Logic in Computer Science: Models and Proofs for Systems (lecturer, course head)
• Autumn 2017: Logic in Computer Science: Models and Proofs for Systems (lecturer)
• Autumn 2016: Logic in Computer Science: Models and Proofs for Systems (lecturer)
• Autumn 2015: Logic in Computer Science: Models and Proofs for Systems (lecturer)
• Spring 2015: Topics in Programming Languages (guest lecturer, misc. assistance)

Supervision

Contact

• Address

  Robin Kaarsgaard
  University of Southern Denmark
  Department of Mathematics and Computer Science
  Campusvej 55
  5230 Odense M
  Office Ø17-604b-2

• Email

  kaarsgaard@imada.sdu.dk

• Calendar

  Book a meeting.