Nathanaëlle Courant
where else to find them
what they talk about
where they keep going back
- POPL2 editions2021–2026
on a stage with
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| A Lazy, Concurrent Convertibility Checker | POPL 2026 | 2026-01-11 |
A convertibility algorithm that interleaves evaluation and comparison using lazy channels and concurrent processes, representing lazy values as channels and… | ||
| An OCaml use case for strong call-by-need reduction | ML 2022 | 2022-09-15 |
Describes a concrete OCaml-compiler change: a strong call-by-need reduction strategy for the module language, implemented as an evaluator inside the compiler… | ||
| Verified Code Generation for the Polyhedral Model | POPL 2021 | 2021-01-17 |
A formally verified code generator turns a polyhedral IR into sequential counted loops and is mechanized in Coq producing about 8k lines of development; it… | ||
| nothing matches | ||