Guillaume Munch-Maccagnoni
where else to find them
no profile links on file
what they talk about
where they keep going back
- ML2 editions2022–2024
all 5 in the filters
on a stage with
- Gabriel Schereronce
- Jean Casparonce
- Leo Whiteonce
all 6 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| S4 modal sequent calculus as intermediate logic and intermediate language (Short Paper) | PEPM 2026 | 2026-01-11 |
Claims that second-class continuations correspond to a restricted S4 modal fragment where implications may only return modal types, and that this fragment sits… | ||
| Classical Notions of Computation and the Hasegawa-Thielecke Theorem | POPL 2026 | 2026-01-11 |
Defines a polarized effect calculus called linear classical L-calculus and shows composition can fail associativity when call-by-value and call-by-name… | ||
| Is there a use for linear types? | ML 2024 | 2024-09-06 |
Argues that linear types and linear logic are different theories with different claims, and tests practical promises by tracing models, polarities and effect… | ||
| Designing interrupts for ML and OCaml | ML 2024 | 2024-09-06 |
Proposes a concrete design for OCaml asynchronous exceptions that introduces a new exception kind separate from ordinary catchable exceptions, plus a… | ||
| Resource polymorphism: proposal for integrating first-class resources into ML | Higher-order, Typed, Inferred, Strict: ML Family Workshop 2023 | 2023-09-08 |
Proposal adds a type-level destructor to ML types and a finite kind system so values can be owned, moved and dropped, enabling first-class resources… | ||
| Efficient “out of heap” pointers for multicore OCaml | OCaml 2022 | 2022-09-16 |
Implements a large pages allocator (inspired by Go) that reserves contiguous ranges (tested with 64–256 MB reserved ranges and Linux transparent hugepages) and… | ||
| Boxroot, fast movable GC roots for a better FFI | ML 2022 | 2022-09-15 |
Boxroot is a C library that implements a caller-roots protocol and an allocator for one-word roots, used already by several OCaml–Rust bindings. It chooses… | ||
| nothing matches | ||