EDBT 2026 Demo / reviewers in the wild / expert
Thierry Coppey
dblp:152/5813
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Software engineering, system software, and programming languages
1 paper |
Compilers and program optimization · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Compilers and program optimization › parsing
parser combinators |
0.2 | 1 | 2014 | Staged parser combinators for efficient data processing · OOPSLA 2014 |
Compilers and program optimization
parsing |
0.2 | 1 | 2014 | Staged parser combinators for efficient data processing · OOPSLA 2014 |
Methods — techniques the papers use, named apart from their topics
staging · 0.2partial evaluation · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Staged parser combinators for efficient data processingabstractParsers are ubiquitous in computing, and many applications depend on their performance for decoding data efficiently. Parser combinators are an intuitive tool for writing parsers: tight integration with the host language enables grammar specifications to be interleaved with processing of parse results. Unfortunately, parser combinators are typically slow due to the high overhead of the host language abstraction mechanisms that enable composition. Manohar Jonnalagedda, Thierry Coppey, Sandro Stucki, Tiark Rompf, Martin Odersky |
OOPSLA | 2 |