Frédéric Bour
where else to find them
bluesky:let-def.bsky.social
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
all 4 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Tail Modulo Cons, OCaml, and Relational Separation Logic | POPL 2025 | 2025-01-19 |
Implements Tail Modulo Constructor in the OCaml compiler and shows it reliably turns non‑tail List.map‑style definitions into stack‑safe code; proof of… | ||
| Faster Reachability Analysis for LR(1) Parsers | SLE 2021 | 2021-10-17 |
A new algorithm reframes LR(1) reachability as recursive matrix equations (using the min,+ semiring) and replaces Pottier 2016 with a naive cost matrices… | ||
| nothing matches | ||