Gabriel Scherer

Orcid: 0000-0003-1758-3938

Affiliations:
  • INRIA Saclay, France
  • Northeastern University, Boston, MA, USA (former)
  • INRIA Paris-Rocquencourt, France (former)


According to our database1, Gabriel Scherer authored at least 27 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Unboxed Data Constructors: Or, How cpp Decides a Halting Problem.
Proc. ACM Program. Lang., January, 2024

Coqlex: Generating Formally Verified Lexers.
Art Sci. Eng. Program., 2024

Snapshottable Stores.
Proc. ACM Program. Lang., 2024

2022
Debootstrapping without Archeology - Stacked Implementations in Camlboot.
Art Sci. Eng. Program., 2022

2021
A practical mode system for recursive definitions.
Proc. ACM Program. Lang., 2021

Tail Modulo Cons.
CoRR, 2021

2019
Dependent Pearl: Normalization by realizability.
CoRR, 2019

Functional programming with lambda-tree syntax.
CoRR, 2019

Functional programming with λ-tree syntax.
Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages, 2019

2018
Capturing the future by replaying the past (functional pearl).
Proc. ACM Program. Lang., 2018

Correctness of speculative optimizations with dynamic deoptimization.
Proc. ACM Program. Lang., 2018

Merlin: a language server for OCaml (experience report).
Proc. ACM Program. Lang., 2018

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

Unboxing Mutually Recursive Type Definitions in OCaml.
CoRR, 2018

Fab ous Interoperability for ML and a Linear Language.
Proceedings of the Foundations of Software Science and Computation Structures, 2018

2017
FabULous Interoperability for ML and a Linear Language.
CoRR, 2017

Search for Program Structure.
Proceedings of the 2nd Summit on Advances in Programming Languages, 2017

Deciding equivalence with sums and the empty type.
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).
PhD thesis, 2016

2015
Multi-Focusing on Extensional Rewriting with Sums.
Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

Polarised Intermediate Representation of Lambda Calculus with Sums.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Which simple types have a unique inhabitant?
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, 2015

Full Reduction in the Face of Absurdity.
Proceedings of the Programming Languages and Systems, 2015

2013
Tracking Data-Flow with Open Closure Types.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

GADTs Meet Subtyping.
Proceedings of the Programming Languages and Systems, 2013

2012
GADT meet Subtyping
CoRR, 2012

On Irrelevance and Algorithmic Equality in Predicative Type Theory
Log. Methods Comput. Sci., 2012


  Loading...