I am a PhD student, working on Programming Languages. My current work is related to the OCaml compiler and working towards modular implicits.

Publications

Conference papers

PureCake: A Verified Compiler for a Lazy Functional Language

Hrutvik Kanabar, Samuel Vivien, Oskar Abrahamsson, Magnus O Myreen, Michael Norrish, Johannes Åman Pohjola, Riccardo Zanetti

PLDI (2023)

Parallel integer multiplication

Samuel Vivien

30th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP) (2022)

Drafts

Automated Discovery of New L-Function Relations

Hadrien Barral, Éric Brier, Rémi Géraud-Stewart, Arthur Léonard, David Naccache, Quentin Vermande, Samuel Vivien

Talks

Tracking which types are principally known in OCaml.

Samuel Vivien

PETITS (2025)

Slides

On the design and implementation of Modular Explicits

Samuel Vivien, Didier Rémy

OCaml@ICFP'24 (2024)

Software

OCaml

I’ve started working on the OCaml compiler in March 2024. Since then I worked on :

#13275 modular explicits (not merged yet)
a few bug fix #13053 and refactoring PRs #13113, #13681, #13682, #13683, #13684.

PureCake

PureCake is a verified compiler for a Haskell-like language. My contribution to this project was the formalisation and implementation of demands analysis.

For more details see the related section in PureCake: A Verified Compiler for a Lazy Functional Language.

Teaching

I’ve did TD and TP for a course on the “fundamental principle of the binary machine” (binary arithmetic, boolean logic, boolean circuits and a bit of cryptography).
I’m currently teaching TP in a Java course.