Demo Data from VLDB 2026 / reviewers in the wild / expert
Matthew Flower
dblp:11/3036
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2007
—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 |
Programming languages and type systems · 50% Program synthesis and code generation · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program synthesis and code generation
search-based program synthesis |
0.1 | 1 | 2007 | Searching for type-error messages · PLDI 2007 |
Programming languages and type systems
type inference |
0.1 | 1 | 2007 | Searching for type-error messages · PLDI 2007 |
Methods — techniques the papers use, named apart from their topics
type checking · 0.1oracle-based search · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | Searching for type-error messagesabstractAdvanced type systems often need some form of type inference to reduce the burden of explicit typing, but type inference often leads to poor error messages for ill-typed programs. This work pursues a new approach to constructing compilers and presenting type-error messages in which the type-checker itself does not produce the messages. Instead, it is an oracle for a search procedure that finds similar programs that do type-check. Our two-fold goal is to improve error messages while simplifying compiler construction. Our primary implementation and evaluation is for Caml, a language with full type inference. We also present a prototype for C++ template functions, where type instantiation is implicit. A key extension is making our approach robust even when the program has multiple independent type errors. Benjamin S. Lerner, Matthew Flower, Dan Grossman, Craig Chambers |
PLDI | 2 |