Scherer Gabriel
Publications
Publications
|
|
Zoo: A Framework for the Verification of Concurrent OCaml 5 Programs using Separation LogicProceedings of the ACM on Programming Languages, 2026, 10 (POPL), pp.1702-1729. ⟨10.1145/3776701⟩ |
|
|
Tail Modulo Cons, OCaml, and Relational Separation LogicProceedings of the ACM on Programming Languages, 2025, 9 (POPL), pp.2337-2363. ⟨10.1145/3704915⟩ |
|
|
Snapshottable StoresProceedings of the ACM on Programming Languages, 2024, 8 (ICFP), pp.338-369. ⟨10.1145/3674637⟩ |
|
|
Coqlex: Generating Formally Verified LexersThe Art, Science, and Engineering of Programming, 2023, 8 (1), ⟨10.22152/programming-journal.org/2024/8/3⟩ |
|
|
Debootstrapping without ArcheologyThe Art, Science, and Engineering of Programming, 2022, 6 (3), ⟨10.22152/programming-journal.org/2022/6/13⟩ |
|
|
A practical mode system for recursive definitionsProceedings of the ACM on Programming Languages, 2021, 5 (POPL), pp.1-29. ⟨10.1145/3434326⟩ |
|
|
Merlin: a language server for OCaml (experience report)Proceedings of the ACM on Programming Languages, 2018, 2 (ICFP), pp.1 - 15. ⟨10.1145/3236798⟩ |
|
|
Correctness of Speculative Optimizations with Dynamic DeoptimizationProceedings of the ACM on Programming Languages, 2018, 2 (POPL), ⟨10.1145/3158137⟩ |
|
|
Capturing the Future by Replaying the Past Functional PearlProceedings of the ACM on Programming Languages, 2018, 2 (ICFP), pp.1 - 29. ⟨10.1145/3236771⟩ |
|
|
On the design and implementation of Modular ExplicitsJFLA 2026 – 37es Journées Francophones des Langages Applicatifs, Marie Kerjean; Yannick Zakowski, Jan 2026, Oberbronn, France |
|
|
Omnidirectional type inference for MLWITS 2026. 5th Workshop on the Implementation of Type Systems, Jan 2026, Rennes, France |
|
|
Storable types: free, absorbing, custom36es Journées Francophones des Langages Applicatifs (JFLA 2025), Jan 2025, Roiffé, France |
|
|
Correct tout seul, sûr à plusieurs35es Journées Francophones des Langages Applicatifs (JFLA 2024), Jan 2024, Saint-Jacut-de-la-Mer, France |
|
|
Backtracking reference storesJFLA 2023 - 34èmes Journées Francophones des Langages Applicatifs, Jan 2023, Praz-sur-Arly, France. pp.190-210 |
|
|
Déboîter les constructeursJournées Francophones des Langages Applicatifs, Feb 2022, Saint-Médard-d'Excideuil, France |
|
|
Boxroot, fast movable GC roots for a better FFIML Family Workshop, Benoît Montagu, Sep 2022, Ljubljana, Slovenia |
|
|
An OCaml use case for strong call-by-need reductionACM SIGPLAN Workshop on ML 2022 - ML Family Workshop, Benoit Montagu, Sep 2022, Ljubljana, Slovenia |
|
|
Tail Modulo ConsJFLA 2021 - Journées Francophones des Langages Applicatifs, Apr 2021, Saint Médard d’Excideuil, France |
|
|
Quantified Applicatives: API design for type-inference constraintsML Family Workshop, Aug 2020, Jersey City / Online, United States |
|
|
Translation validation of a pattern-matching compilerML Family Workshop, Aug 2020, New Jersey /Online, United States |
|
|
Unboxing Mutually Recursive Type Definitions in OCamlJFLA 2019 - 30 èmes journées francophones des langages applicatifs, Jan 2019, Les Rousses, France |
|
|
Functional programming with $λ$-tree syntaxPPDP 2019 - 21st International Symposium on Principles and Practice of Programming Languages, Oct 2019, Porto, Portugal. pp.1-16, ⟨10.1145/3354166.3354177⟩ |
|
|
FabULous Interoperability for ML and a Linear LanguageInternational Conference on Foundations of Software Science and Computation Structures (FoSSaCS), Apr 2018, Thessaloniki, Greece. ⟨10.1007/978-3-319-89366-2_8⟩ |
A preview of a tutorial on L (polarized μμ-tilde)HOPE 2018 - 7th ACM SIGPLAN Workshop on Higher-Order Programming with Effects, Sep 2018, St. Louis, United States |
|
|
|
Génération aléatoire de programmes guidée par la vivacitéJFLA 2018 - Journées Francophones des Langages Applicatifs, Jan 2018, Banyuls-sur-Mer, France |
|
|
Search for Program Structure2nd Summit on Advances in Programming Languages (SNAPL 2017), Jan 2017, Asilomar, United States |
|
|
Deciding equivalence with sums and the empty typePOPL 2017, Jan 2017, Paris, France |
|
|
Ambiguous pattern variablesOCaml 2016: The OCaml Users and Developers Workshop, Sep 2016, Nara, Japan. pp.2 |
|
|
Polarised Intermediate Representation of Lambda Calculus with SumsThirtieth Annual ACM/IEEE Symposium on Logic In Computer Science (LICS 2015), Jul 2015, Kyoto, Japan. ⟨10.1109/LICS.2015.22⟩ |
|
|
Normalization by realizability also evaluatesVingt-sixièmes Journées Francophones des Langages Applicatifs (JFLA 2015), Jan 2015, Le Val d'Ajol, France |
|
|
Multi-focusing on extensional rewriting with sumsTyped Lambda Calculi and Applications, Jun 2015, Warsaw, Poland |
|
|
Which simple types have a unique inhabitant?The 20th ACM SIGPLAN International Conference on Functional Programming (ICFP 2015), Aug 2015, Vancouver, Canada |
Full reduction in the face of absurdityESOP'2015: European Conference on Programming Languages and Systems, Apr 2015, London, United Kingdom |
|
|
|
Deciding unique inhabitants with sums (work in progress)TYPES, May 2014, Paris, France |
|
|
Well-typed generic smart-fuzzing for APIsML'14 - ACM SIGPLAN ML Family Workshop, Aug 2014, Göteborg, Sweden |
|
|
Tracking Data-Flow with Open Closure TypesLPAR 2013 - 19th International Conference Logic for Programming, Artificial Intelligence, and Reasoning, Dec 2013, Stellenbosch, South Africa. pp.710-726 |
|
|
GADTs meet subtypingESOP 2013 - 22nd European Symposium on Programming, Mar 2013, Rome, Italy. pp.554-573, ⟨10.1007/978-3-642-37036-6⟩ |
|
|
GADTs Meet SubtypingACM SIGPLAN Workshop on ML, Sep 2012, Copenhagen, Denmark |
|
|
GADT meet subtypingACM SIGPLAN Workshop on ML, Aug 2012, Copenhague, Denmark |
Macaque : Interrogation sûre et flexible de base de données depuis OCamlVing et unième journées francophones des langages applicatifs, Jan 2010, La Ciotat, France |
|
|
Omnidirectional type inference for ML: principality any wayUniversity of Cambridge, INRIA, IRIF, Université Paris Cité. 2025 |
|
|
Constrained generation of well-typed programInria - Paris 7. 2024 |
|
|
Full reduction in the face of absurdity[Research Report] INRIA. 2014 |
|
|
Tracking Data-Flow with Open Closure Types[Research Report] RR-8345, INRIA. 2013, pp.24 |
|
|
GADT meet Subtyping[Research Report] RR-8114, INRIA. 2012, pp.33 |
|
|
The free bifibration on a functor2025 |
|
|
2-or-more approximation for intuitionistic logic2014 |
|
|
Which types have a unique inhabitant?Programming Languages [cs.PL]. Université Paris-Diderot, 2016. English. ⟨NNT : ⟩ |