Eelco Visser
where else to find them
what they talk about
where they keep going back
- OOPSLA2 editions2020–2022
all 4 in the filters
on a stage with
all 10 in the filters
who talks about the same things
- Arjen Rouvoet6 talks
- Casper Bach Poulsen11 talks
- Casper Bach2 talks
- Robbert Krebbers26 talks
- Hendrik van Antwerpen5 talks
- Derek Dreyer35 talks
| title | conference | date |
|---|---|---|
| Incremental Type-Checking for Free: Using Scope Graphs to Derive Incremental Type-Checkers | OOPSLA 2022 | 2022-12-05 |
Automatic derivation of incremental type-checkers from Statix meta-DSL specifications uses scope graphs to turn name-resolution queries into precise inter-unit… | ||
| Intrinsically-Typed Definitional Interpreters à la Carte | OOPSLA 2022 | 2022-12-05 |
Presents a method for building modular, mechanically verified type-safe language components using intrinsically-typed definitional interpreters and a new… | ||
| Language-parametric static semantic code completion | OOPSLA 2022 | 2022-12-05 |
Implements a language‑parametric code completion that is sound and complete by construction: it reinterprets Statix static semantics and SDF3 syntax to expand… | ||
| Intrinsically Typed Compilation with Nameless Labels | POPL 2021 | 2021-01-17 |
Claims a compositional way to intrinsically type bytecode by replacing global names with nameless labels and a co-contextual interface algebra, implemented as… | ||
| Gradually Typing Strategies | SLE 2020 | 2020-11-16 |
Adds a gradual type system to Stratego with a prototype type checker and cast inserter that type-checks code and emits runtime casts; applied to Jasmin (an… | ||
| Knowing When to Ask: Sound Scheduling of Name Resolution in Type Checkers Derived from Declarative S | OOPSLA 2020 | 2020-11-15 |
Derives executable type checkers from Statix specifications by giving an operational semantics that schedules name resolution to avoid unstable queries… | ||
| What is PL Research? | SPLASH 2019 PLMW | 2019-10-20 |
PL research centers on ways to get programming stuff for free: given X (syntax, specs) produce Y (IDE, compiler, proof) automatically. Concrete chain: a… | ||
| nothing matches | ||