معرفی
Yannick Forster is a Researcher at INRIA Paris, working in the Cambium research team. His primary research focuses on formal verification, programming languages, and proof assistants, with significant contributions to the Coq proof assistant ecosystem. He has developed tools like MetaCoq and worked on certified undecidability proofs.
His research interests span formal verification, proof assistants, type theory, programming language semantics, compiler verification, and computational complexity. He maintains active involvement in the programming languages research community through publications and program committee participation.
Forster's publications demonstrate a consistent focus on formal verification of programming language foundations, with work spanning: certified undecidability proofs, compiler verification (especially for Coq-to-OCaml compilation), formalization of computational models (Turing machines, λ-calculus), and practical tools for proof engineering. His recent work shows increased focus on MetaCoq and verified compiler toolchains.
He has served in multiple academic service roles including: PLMW Co-Chair (POPL 2026), PLDI Review Committee member (2025), Workshops Co-Chair (ICFP 2024), and program committee memberships for CPP, APLAS, and ICFP events.
