Demo Data from SIGIR 2026 / reviewers in the wild / expert
Bruce Forstall
dblp:63/3681
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1990
—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 · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computing education · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Programming languages and type systems
type inference |
0.0 | 1 | 1990 | The University of Washington Illustrating Compiler · PLDI 1990 |
Computing education › programming education
programming education tools |
0.0 | 1 | 1990 | The University of Washington Illustrating Compiler · PLDI 1990 |
Methods — techniques the papers use, named apart from their topics
compile-time pattern matching · 0.0abstract data type inference · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1990 | The University of Washington Illustrating CompilerabstractThe University of Washington illustrating compiler (UWPI) automatically illustrates the data structures used in simple programs written in a subset of Pascal2. A UWPI user submits a program to UWPI, and can then watch a graphical display show time varying illustrations of the data structures and program source code. UWPI uses the information latent in the program to determine how to illustrate the program. UWPI infers the abstract data types directly from the declarations and operations used in the source program, and then lays out the illustration in a natural way by instantiating well-known layouts for the abstracts types. UWPI solves program illustration using compile-time pattern matching and type inferencing to link anticipated execution events to display events, rather than relying on user assistance or specialized programming techniques. UWPI has been used to automatically illustrate didactic sorting and searching examples, and can be used to help teach basic data structures, or to help when debugging programs. Kenneth M. Whaley, Bruce Forstall |
PLDI | 3 |