معرفی
Thibaut Balabonski is an Assistant Professor of computer science at Paris-Saclay University, affiliated with the Formal Methods Lab. His research focuses on programming languages, operational semantics, type systems, lambda calculus, and concurrency, with notable work on formal verification of mobile robot swarms and functional programming optimizations.
- Published key works on strong call-by-need calculus (LMCS, 2023), weak optimality in lambda calculus (ICFP'13), and separation logic for permission-based languages (TOPLAS, 2016).
- Co-authored educational books for high school and preparatory classes, including Digital and Computer Science series.
- Teaching includes object-oriented programming, compilation, and lambda calculus courses at L2, M1, and M2 levels.
- Labs & Teams: Formal Methods Lab (LMF), CNRS, with collaborations in Coq formalization (Pactole framework) and concurrency theory.
۰مقاله منتشرشده
