Gabriel Scherer

According to our database, Gabriel Scherer authored at least 26 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Unboxed Data Constructors: Or, How cpp Decides a Halting Problem.

Nicolas Chataing, Stephen Dolan, Gabriel Scherer, Jeremy Yallop

Proc. ACM Program. Lang., January, 2024

2023

Coqlex: Generating Formally Verified Lexers.

Wendlasida Ouedraogo, Gabriel Scherer, Lutz Straßburger

Art Sci. Eng. Program., June, 2023

2022

Debootstrapping without Archeology - Stacked Implementations in Camlboot.

Nathanaëlle Courant, Julien Lepiller, Gabriel Scherer

Art Sci. Eng. Program., 2022

2021

A practical mode system for recursive definitions.

Alban Reynaud, Gabriel Scherer, Jeremy Yallop

Proc. ACM Program. Lang., 2021

Tail Modulo Cons.

Frédéric Bour, Basile Clément, Gabriel Scherer

CoRR, 2021

2019

Dependent Pearl: Normalization by realizability.

Pierre-Évariste Dagand, Lionel Rieg, Gabriel Scherer

CoRR, 2019

Functional programming with lambda-tree syntax.

Ulysse Gérard, Dale Miller, Gabriel Scherer

CoRR, 2019

Functional programming with λ-tree syntax.

Ulysse Gérard, Dale Miller, Gabriel Scherer

Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages, 2019

2018

Capturing the future by replaying the past (functional pearl).

James Koppel, Gabriel Scherer, Armando Solar-Lezama

Proc. ACM Program. Lang., 2018

Correctness of speculative optimizations with dynamic deoptimization.

Olivier Flückiger, Gabriel Scherer, Ming-Ho Yee, Aviral Goel, Amal Ahmed, Jan Vitek

Proc. ACM Program. Lang., 2018

Merlin: a language server for OCaml (experience report).

Frédéric Bour, Thomas Refis, Gabriel Scherer

Proc. ACM Program. Lang., 2018

A right-to-left type system for mutually-recursive value definitions.

Alban Reynaud, Gabriel Scherer, Jeremy Yallop

CoRR, 2018

Unboxing Mutually Recursive Type Definitions in OCaml.

Simon Colin, Rodolphe Lepigre, Gabriel Scherer

CoRR, 2018

Fab ous Interoperability for ML and a Linear Language.

Gabriel Scherer, Max S. New, Nick Rioux, Amal Ahmed

Proceedings of the Foundations of Software Science and Computation Structures, 2018

2017

FabULous Interoperability for ML and a Linear Language.

Gabriel Scherer, Max S. New, Nicholas Rioux, Amal Ahmed

CoRR, 2017

Search for Program Structure.

Gabriel Scherer

Proceedings of the 2nd Summit on Advances in Programming Languages, 2017

Deciding equivalence with sums and the empty type.

Gabriel Scherer

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

2016

Which types have a unique inhabitant? : Focusing on pure program equivalence. (Quels types ont un habitant unique ? / Quels types ont un habitant unique ? : Focalisons-nous sur l'équivalence de programmes).

Gabriel Scherer

PhD thesis, 2016

2015

Multi-Focusing on Extensional Rewriting with Sums.

Gabriel Scherer

Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

Polarised Intermediate Representation of Lambda Calculus with Sums.

Guillaume Munch-Maccagnoni, Gabriel Scherer

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Which simple types have a unique inhabitant?

Gabriel Scherer, Didier Rémy

Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, 2015

Full Reduction in the Face of Absurdity.

Gabriel Scherer, Didier Rémy

Proceedings of the Programming Languages and Systems, 2015

2013

Tracking Data-Flow with Open Closure Types.

Gabriel Scherer, Jan Hoffmann

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

GADTs Meet Subtyping.

Gabriel Scherer, Didier Rémy

Proceedings of the Programming Languages and Systems, 2013

2012

GADT meet Subtyping

Gabriel Scherer, Didier Rémy

CoRR, 2012

On Irrelevance and Algorithmic Equality in Predicative Type Theory

Andreas Abel, Gabriel Scherer

Log. Methods Comput. Sci., 2012