ACM Fellow
- 2015-12-09
Xavier Leroy was appointed Fellow of the ACM "for contributions to safe, high-performance functional programming languages and compilers, and to compiler verification".
Xavier Leroy was appointed Fellow of the ACM "for contributions to safe, high-performance functional programming languages and compilers, and to compiler verification".
Xavier Leroy was awarded the 2016 Royal Society Milner Award "in recognition of his exceptional achievements in computer programming which includes the design and implementation of the OCaml programming language".
The following paper will be presented at ICFP 2015: Which simple types have a unique inhabitant?, by Gabriel Scherer and Didier Rémy.
The Verasco static analyzer verifies the absence of run-time errors in C programs using static analysis techniques based on abstract interpretation. The novelty of Verasco is that it is entirely specified and proved sound using the Coq proof assistant. The first public release is available here. The paper below gives more details on the design and verification of Verasco.
The following paper will be presented at POPL 2015: A formally-verified C static analyzer, by Jacques-Henri Jourdan, Vincent Laporte, Sandrine Blazy, Xavier Leroy, and David Pichardie.
Maxime Dénès joins the Gallium team as a post-doctoral fellow. Welcome, Maxime!
Jonathan Protzenko successfully defended his Ph.D. thesis, Mezzo, a typed language for safe effectful concurrent programs at University Paris Diderot. Congratulations, Jonathan!
Team gagallium (François Bobot, Pierre Boutillier, Thomas Braibant, Damien Doligez, and Gabriel Scherer) were awarded the Judge's prize at the ICFP 2014 programming contest. In the words of the judge, Team gagallium are an extremely cool bunch of hackers!
OCaml version 4.02.0 is now available. This major release adds many long-awaited language features and brings some performance improvements. Enjoy!
The following paper will be presented at ICFP 2014: Hindley-Milner elaboration in applicative style by François Pottier.
The following paper will be presented at CSL-LICS 2014: System F with Coercion Constraints by Julien Cretin and Didier Rémy.
Julien Cretin successfully defended his Ph.D. thesis, Erasable coercions: a unified approach to type systems at University Paris Diderot. Congratulations, Julien!
Pierre-Évariste Dagand is now a post-doctoral fellow in the Gallium team. Welcome, Pierre!
Didier Le Botlan and Didier Rémy received the ACM SIGPLAN Most Influential ICFP Paper Award for their ICFP 2003 paper, MLF: Raising ML to the power of System F.
Version 4.01 of the OCaml system is now available. This is a major release that introduces type-based disambiguation of constructors and record field labels and a whole lot of new warnings, among other new features.
The Compcert C verified compiler reaches the 2.0 landmark with full support for 64-bit integers and a new register allocator based on end-to-end translation validation.
The following papers will be presented at ICFP 2013: Programming with Permissions in Mezzo by François Pottier and Jonathan Protzenko, and Weak Optimality, and the Meaning of Sharing by Thibaut Balabonski.
Umut Acar, assistant professor at CMU, and Mike Rainey join the Gallium team on, respectively, a part-time Inria advanced research position and an Inria starting research position. They will work on the DeepSea project, funded by the European Research Council, whose goal is to develop novel approaches to dynamic parallelism. Welcome, Umut and Mike!
The Gallium team welcomes Fabrice Le Fessant and Luc Maranget, INRIA research scientists.
Xavier Leroy was awarded the Microsoft Research Verified Software Milestone Award in recognition of his work on the CompCert formally-verified compiler.
Thibaut Balabonski just started a post-doc in the Gallium team. Welcome, Thibaut!
Thomas Braibant just started a post-doc in the Gallium team. Welcome, Thomas!
Version 4.00 of the OCaml system is now available. Novelties include generalized algebraic datatypes (GADTs), improved support for first-class modules, and a "bin-annot" mechanism to communicate typed abstract syntax trees to IDEs and similar external tools.
Some of our members now chronicle their thoughts on the Gagallium blog. Happy reading!
Nicolas Pouillard successfully defended his Ph.D. thesis, Namely, Painless: A unifying approach to safe programming with first-order syntax with binders at University Paris 7 Diderot. Congratulations, Nicolas!
Tahina Ramananandro successfully defended his Ph.D. thesis, Machine-checked Formal Semantics and Verified Compilation for C++ Objects at University Paris 7 Diderot. Congratulations, Tahina!
Xavier Leroy, Sandrine Blazy, Zaynah Dargaye and Jean-Baptiste Tristan received the 2011 award in Information Sciences of the La Recherche science monthly.
The following papers will be presented at POPL 2012: Extending System F-eta with Abstraction over Erasable Coercions by Julien Cretin and Didier Rémy; A mechanized semantics for C++ object construction and destruction, with applications to resource management by Tahina Ramananandro, Gabriel Dos Reis, and Xavier Leroy.
The following paper will be presented at ICFP 2011: Nameless, Painless by Nicolas Pouillard.
Arthur Charguéraud successfully defended his Ph.D. thesis, Characteristic formulae for mechanized program verification at University Paris 7 Diderot. Congratulations, Arthur!
Benoît Montagu successfully defended his Ph.D. thesis, Programming with first-class modules in a core language with subtyping, singleton kinds and open existential types at École Polytechnique. Congratulations, Benoît!
The following papers will be presented at POPL 2011: A typed store-passing translation for general references by François Pottier; Formal verification of object layout for C++ multiple inheritance by Tahina Ramananandro, Gabriel Dos Reis, and Xavier Leroy.
OCaml 3.12.0 is released. It includes a number of long-awaited new features, including first-class modules, polymorphic recursion, and much more.
The following papers will be presented at ICFP 2010: Program Verification Through Characteristic Formulae by Arthur Charguéraud; A fresh look at programming with names and binders by Nicolas Pouillard and François Pottier; Matching Lenses: Alignment and View Update by Davi M. J. Barbosa, Julien Cretin, Nate Foster, Michael Greenberg and Benjamin C. Pierce.