French mathematician and computer scientist, professor at Aix-Marseille University.
Invented interaction nets (1990), a graphical model of computation where programs are networks of agents connected by wires, reduced by local rewriting rules.
Proved that interaction nets are inherently parallel: every reduction step is local and independent, enabling optimal parallel evaluation.
His interaction combinators — a universal basis of just three agents — form the theoretical foundation of HVM and the cyber virtual machine.
Extended linear logic with insights connecting proof theory, computation, and resource management.
Interaction nets solve the sharing problem in lambda calculus: they compute without duplication overhead, reaching optimal reduction.