Ben Greenman
where else to find them
no profile links on file
what they talk about
all 4 in the filters
where they keep going back
- OOPSLA2 editions2023–2024
all 5 in the filters
on a stage with
all 38 in the filters
who talks about the same things
- Matthias Felleisen10 talks
- Christos Dimoulas8 talks
- Jonathan Aldrich17 talks
- Éric Tanter12 talks
- Shriram Krishnamurthi12 talks
- Amal Ahmed25 talks
| title | conference | date |
|---|---|---|
| Type Narrowing the Hard Way | WITS 2026 | 2026-01-17 |
A litmus-suite called the if t benchmark runs on eight real typecheckers and shows everyone handles basic narrowing but disagree widely on harder cases… | ||
| Nice to Meet You: Synthesizing Practical MLIR Abstract Transformers | POPL 2026 | 2026-01-11 |
Automates generation of MLIR integer abstract transformers by synthesizing small SSA programs (cut-style MCMC search) and composing them with… | ||
| Toward a Corpus Study of the Dynamic Gradual Type | HATRA 2024 | 2024-10-20 |
Corpus analysis targets 221 mypy-annotated GitHub projects and finds roughly 320,000 any occurrences, then clusters them into eight patterns of use. Several… | ||
| Forge: A Tool and Language for Teaching Formal Methods | OOPSLA 2024 | 2024-10-20 |
Forge is a reworked Alloy designed to teach formal methods incrementally: it implements language levels (froglet → relational → LTL) that restrict expressive… | ||
| How Profilers Can Help Navigate Type Migration | OOPSLA 2023 | 2023-10-23 |
Uses a 16‑benchmark corpus with ~100,000 gradually typed configurations and 1.2M runtime/profile measurements to evaluate 17 migration strategies driven by a… | ||
| Rhombus: A New Spin on Macros without All the Parentheses | OOPSLA 2023 | 2023-10-23 |
Rhombus is a new language implemented on Racket that replaces prefix s-exprs with an infix-friendly Shrubbery token-tree, interleaves macro expansion with an… | ||
| How to Evaluate Blame for Gradual Types, Part 2 | ICFP 2023 | 2023-09-04 |
Empirical study instruments a rational-programmer procedure, mutates GTB benchmark programs, and runs three TyRet/Racket semantics (eraser, transient, natural)… | ||
| nothing matches | ||