Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGabriel Scherer
Person information
- affiliation: INRIA Saclay, France
- affiliation (former): Northeastern University, Boston, MA, USA
- affiliation (former): INRIA Paris-Rocquencourt, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Nicolas Chataing
, Stephen Dolan, Gabriel Scherer, Jeremy Yallop:
Unboxed Data Constructors: Or, How cpp Decides a Halting Problem. Proc. ACM Program. Lang. 8(POPL): 1509-1539 (2024)- 2023
- [j7]Wendlasida Ouedraogo, Gabriel Scherer, Lutz Straßburger:
Coqlex: Generating Formally Verified Lexers. Art Sci. Eng. Program. 8(1) (2023) - [i15]Wendlasida Ouedraogo, Gabriel Scherer, Lutz Straßburger:
Coqlex: Generating Formally Verified Lexers. CoRR abs/2306.12411 (2023) - [i14]Nicolas Chataing, Stephen Dolan, Gabriel Scherer, Jeremy Yallop:
Unboxed data constructors - or, how cpp decides a halting problem. CoRR abs/2311.07369 (2023) - 2022
- [j6]Nathanaëlle Courant, Julien Lepiller, Gabriel Scherer:
Debootstrapping without Archeology - Stacked Implementations in Camlboot. Art Sci. Eng. Program. 6(3): 13 (2022) - [i13]Nathanaëlle Courant, Julien Lepiller, Gabriel Scherer:
Debootstrapping without Archeology: Stacked Implementations in Camlboot. CoRR abs/2202.09231 (2022) - 2021
- [j5]Alban Reynaud, Gabriel Scherer, Jeremy Yallop:
A practical mode system for recursive definitions. Proc. ACM Program. Lang. 5(POPL): 1-29 (2021) - [i12]Frédéric Bour, Basile Clément, Gabriel Scherer:
Tail Modulo Cons. CoRR abs/2102.09823 (2021)
2010 – 2019
- 2019
- [c10]Ulysse Gérard, Dale Miller, Gabriel Scherer:
Functional programming with λ-tree syntax. PPDP 2019: 12:1-12:16 - [e1]Sam Lindley, Gabriel Scherer:
Proceedings ML Family / OCaml Users and Developers workshops, ML/OCaml 2017, Oxford, UK, 7th September 2017. EPTCS 294, 2019 [contents] - [i11]Ulysse Gérard, Dale Miller, Gabriel Scherer:
Functional programming with lambda-tree syntax. CoRR abs/1908.03619 (2019) - [i10]Pierre-Évariste Dagand, Lionel Rieg, Gabriel Scherer:
Dependent Pearl: Normalization by realizability. CoRR abs/1908.09123 (2019) - 2018
- [j4]James Koppel, Gabriel Scherer, Armando Solar-Lezama:
Capturing the future by replaying the past (functional pearl). Proc. ACM Program. Lang. 2(ICFP): 76:1-76:29 (2018) - [j3]Frédéric Bour, Thomas Refis, Gabriel Scherer:
Merlin: a language server for OCaml (experience report). Proc. ACM Program. Lang. 2(ICFP): 103:1-103:15 (2018) - [j2]Olivier Flückiger, Gabriel Scherer, Ming-Ho Yee, Aviral Goel, Amal Ahmed, Jan Vitek:
Correctness of speculative optimizations with dynamic deoptimization. Proc. ACM Program. Lang. 2(POPL): 49:1-49:28 (2018) - [c9]Gabriel Scherer, Max S. New, Nick Rioux, Amal Ahmed:
Fab ous Interoperability for ML and a Linear Language. FoSSaCS 2018: 146-162 - [i9]Frédéric Bour, Thomas Refis, Gabriel Scherer:
Merlin: A Language Server for OCaml (Experience Report). CoRR abs/1807.06702 (2018) - [i8]Simon Colin, Rodolphe Lepigre, Gabriel Scherer:
Unboxing Mutually Recursive Type Definitions in OCaml. CoRR abs/1811.02300 (2018) - [i7]Alban Reynaud, Gabriel Scherer, Jeremy Yallop:
A right-to-left type system for mutually-recursive value definitions. CoRR abs/1811.08134 (2018) - 2017
- [c8]Gabriel Scherer:
Deciding equivalence with sums and the empty type. POPL 2017: 374-386 - [c7]Gabriel Scherer:
Search for Program Structure. SNAPL 2017: 15:1-15:14 - [i6]Gabriel Scherer, Max S. New, Nicholas Rioux, Amal Ahmed:
FabULous Interoperability for ML and a Linear Language. CoRR abs/1707.04984 (2017) - [i5]Olivier Flückiger, Gabriel Scherer, Ming-Ho Yee, Aviral Goel, Amal Ahmed, Jan Vitek:
Correctness of Speculative Optimizations with Dynamic Deoptimization. CoRR abs/1711.03050 (2017) - 2016
- [b1]Gabriel Scherer:
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). Paris Diderot University, France, 2016 - [i4]Gabriel Scherer:
Deciding equivalence with sums and the empty type. CoRR abs/1610.01213 (2016) - 2015
- [c6]Gabriel Scherer, Didier Rémy:
Full Reduction in the Face of Absurdity. ESOP 2015: 685-709 - [c5]Gabriel Scherer, Didier Rémy:
Which simple types have a unique inhabitant? ICFP 2015: 243-255 - [c4]Guillaume Munch-Maccagnoni, Gabriel Scherer:
Polarised Intermediate Representation of Lambda Calculus with Sums. LICS 2015: 127-140 - [c3]Gabriel Scherer:
Multi-Focusing on Extensional Rewriting with Sums. TLCA 2015: 317-331 - 2013
- [c2]Gabriel Scherer, Didier Rémy:
GADTs Meet Subtyping. ESOP 2013: 554-573 - [c1]Gabriel Scherer, Jan Hoffmann:
Tracking Data-Flow with Open Closure Types. LPAR 2013: 710-726 - [i3]Gabriel Scherer, Didier Rémy:
GADTs meet subtyping. CoRR abs/1301.2903 (2013) - [i2]Gabriel Scherer, Jan Hoffmann:
Tracking Data-Flow with Open Closure Types. CoRR abs/1312.0018 (2013) - 2012
- [j1]Andreas Abel, Gabriel Scherer:
On Irrelevance and Algorithmic Equality in Predicative Type Theory. Log. Methods Comput. Sci. 8(1) (2012) - [i1]Gabriel Scherer, Didier Rémy:
GADT meet Subtyping. CoRR abs/1210.5935 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-02-12 20:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
