معرفی
Kazuhiko Sakaguchi is a Researcher affiliated with CNRS (French National Centre for Scientific Research), École Normale Supérieure de Lyon (ENS Lyon), and Université Claude Bernard Lyon 1, working at the Laboratoire de l'Informatique du Parallélisme (LIP, UMR 5668). His primary research focuses on foundational aspects of programming languages and formal verification.
Research Interests: Sakaguchi specializes in interactive theorem proving (particularly using Coq), formalization of mathematics, and proof by reflection. His work bridges theoretical computer science and practical tool development, with applications in algorithm verification, algebraic hierarchies, and dependent type systems.
Publication Trends: His recent articles emphasize formal verification of algorithms (e.g., mergesort correctness), design patterns for mathematical structures in proof assistants, and program extraction techniques. A consistent theme is enhancing productivity in theorem proving through reusable abstractions and automated tactics.
