معرفی
Meven Lennon-Bertrand is a post-doctoral researcher at the University of Cambridge, actively contributing to the fields of programming languages, type theory, and formal verification. His work centers on extending and analyzing proof assistants, particularly Coq, through metaprogramming and gradual typing.
His research interests include:
- Gradual Typing and Mixed-Typed Systems
- Dependent Type Theory and the Calculus of Inductive Constructions
- Metaprogramming and Reflection in Coq
- Formalization of Logical Systems
- Algorithmic Type Checking and Conversion
- Case Analysis and Pattern Matching Semantics
His recent publications reflect a strong trend toward integrating dynamic and static typing in dependently typed languages, improving the usability and correctness of proof assistants, and formalizing foundational aspects of type systems. Much of his work is associated with the MetaCoq project, aiming to provide a verified framework for Coq metaprogramming.
Notable contributions include work on gradualizing dependent types, resolving issues with η-conversion in Coq, and equivalence of typed and untyped conversion algorithms.
He has not listed any formal awards or scientific prizes in the provided texts.
Meven advises no named students in the provided data. However, he actively collaborates on major research projects such as MetaCoq and participates in top-tier academic venues like POPL, CPP, and ICFP. He has not mentioned specific grants, but his research output suggests involvement in funded academic initiatives.
His primary research activities are conducted within the MetaCoq team, a collaborative effort to build a fully verified metaprogramming framework for Coq. This involves formal verification of Coq’s kernel, reflection mechanisms, and code generation tools.
