Cass Alexandru (they/them)
I am a PhD student at the Working Group Programming Languages at the RPTU Kaiserslautern-Landau, supervised by Ralf Hinze. I am co-supervised by Jurriaan Rot and Niels van der Weide, both at Radboud University Nijmegen. I will be available for Post-Docs starting around Fall 2027. My current research topic is the application of categorical semantics of (dependent) type theory to writing intrinsically correct total algorithms using structured recursion. More specifically, I am investigating recursive coalgebras and algorithmic duality.
More broadly, I am interested in the application of the full breadth of the theoretical arsenal to the problem of designing theoretically rigorous and ergonomic verified functional programming languages, including but not limited to:
- datatype-generic programming
- recursion schemes
- cubical and directed type theory
- substructural type systems
- embedded domain-specific languages
- compiler construction
- staged compilation
- SMT, ATP & decision procedures
- editor-time code generation & annotation
- proof/program synthesis
Further areas I am interested in:
- generative (property-based) testing, combinatorial species
- recursive definition as a principle
- symmetry-elimination for state-space reduction in ATP
Online presence / contact
I go by cxandru on most online
forums, and also use the same profile icon
everywhere, so I should be relatively easy to spot.
My accounts on selected forums:
- Mastodon: @cxandru@types.pl
- Github: cxandru
- Mail:
(\(f,l) -> f.l@cs.rptu.de) "c" "alexandru"
Papers
- Cass Alexandru, Henning Urbat, Thorsten Wißmann : “Intrinsically Correct Algorithms and Recursive Coalgebras”, Agda library. PLDI 2026.
- Cass Alexandru, Vikraman Choudhury, Jurriaan Rot, Niels van der Weide: “Intrinsically Correct Sorting in Cubical Agda”. CPP 2025.
Talks
- “Intrinsically Recursive Coalgebras”. FP Dag 2026.
- “Intrinsically Correct Sorting in Cubical Agda”, Recording. CPP 2025.
- “Natural transformations as business logics: An operational intuition”. FP Dag 2025. Updated slides
- “Intrinsically correct sorting using bialgebraic semantics”. SPLV 2024 lightning talk.
- “When the Types Align: A coincidence of total and partial correctness with a slice of cubical Agda”. Dutch FP Day 2024.
- “Structured Traversals for (Mutually) Recursive Algebraic Data Types”, Recording. Munihac 2022.
Theses
- “Intrinsically
correct sorting using bialgebraic semantics”.
Master’s thesis, Radboud University, 2023.
BibLaTex
@thesis{alexandru_intrinsically_2023, author = {Alexandru, Cass}, title = {Intrinsically correct sorting using bialgebraic semantics}, institution = {Radboud University}, type = {mathesis}, year = {2023}, file = {https://www.cs.ru.nl/masters-theses/2023/C_Alexandru___Intrinsically_correct_sorting_using_bialgebraic_semantics.pdf}, url = {https://www.cs.ru.nl/masters-theses#2023}, } - “Specifying
Loops with Contracts”. Bachelor’s thesis, LMU
Munich, 2019.
BibLaTex
@thesis{alexandru_specifying_2019, author = {Alexandru, Cass}, title = {Specifying Loops with Contracts}, subtitle = {Reasoning about loops as recursive procedures}, institution = {LMU Munich}, type = {bathesis}, year = {2019}, file = {https://www.sosy-lab.org/research/bsc/2019.Alexandru.Specifying_Loops_With_Contracts.pdf}, url = {https://www.sosy-lab.org/research/bib/Year/2019.html#AlexandruLoopContracts} }
Service
I serve as the main PhD student representative in the RPTU senate for Kaiserslautern in the academic year 2025-26 (link). I served as the main PhD student representative for computer science in 2024-25, and again in 2025-26 (link).
Unpublished Notes
- “Bialgebraic Semantics, Formalized”. 2023. This research internship report documents the pull request μ-Bialgebras by cxandru · Pull Request #362 · agda/agda-categories