Despite their popularity, systems enforcing full ownership guarantees such as Rust leave many users frustrated with the inability to represent notionally self-referential data structures—e.g., doubly-linked lists—using first-class references. This frustration has motivated a number of proposals to relax on full ownership to support idioms common in languages with pervasive reference semantics. In this paper, we propose to go in another direction and study representations of arbitrary graph-like without references.

I’m a post-doc researcher at EPFL (Switzerland). I’m working on language designs for safe and high-performance computing.

Besides research, I’m also actively involved in software development and engineering, and actively maintain a handful of open source software libraries. Most (if not all) of my work is available on my GitHub profile.