OUPS novembre 2026

Le prochain OUPS aura lieu le mardi 3 novembre 2026. Le rendez-vous est fixé à 18h30 au 4 place Jussieu, amphi 45A, au pied de la tour 45.
Un plan est disponible.

L'inscription est obligatoire pour pouvoir accéder au meetup !

Les exposés seront également retransmis en ligne sur le galène du OUPS.
Toutes les informations sont disponibles sur le site du OUPS.

Programme :

Compiling FFI-heavy OCaml to WebAssembly: An Experience Report on MOPSA -- Réda Boudrouss

Large OCaml applications often rely on native C and C++ libraries through the OCaml FFI, making them difficult to run in the browser. Existing browser backends compile OCaml to JavaScript or WebAssembly, but leave the native dependency stack behind.

In this presentation, we explore a different approach: compiling the OCaml runtime together with the complete native dependency stack to WebAssembly using Emscripten, and running the original OCaml bytecode on top of it. FFI calls are resolved through a static primitive table, without modifying existing FFI code or CamlIDL-generated bindings.

We demonstrate this approach on MOPSA, a static analyzer combining OCaml with LLVM/Clang, GMP, MPFR, Apron, and CamlIDL, and show how the complete application can run directly in a web browser.

Designing a Set-Theoretic Type Library in OCaml -- Mickaël Laurent

In this talk, I will share my experience using OCaml to design a library for set-theoretic types.
Set-theoretic types are difficult to define because they consist of several recursive components and layers.
Furthermore, the termination of certain operations on recursive types depends on a hash-consing system operating at various levels.
I will discuss the challenges and advantages of using OCaml, such as the difficulty of making some recursive modules typecheck and how we used algebraic effects to implement our hash-consing system.

***

Les présentations seront suivies par des discussions libres. Les pizzas seront offertes par la fondation OCaml !