Gabriele Vanoni
where else to find them
what they talk about
where they keep going back
- POPL3 editions2021–2025
all 5 in the filters
on a stage with
all 11 in the filters
who talks about the same things
- Benjamin Gregoire6 talks
- Martin Avanzini4 talks
- Gilles Barthe17 talks
- Georg Moser5 talks
- Beniamino Accattoli4 talks
- Ugo Dal Lago14 talks
| title | conference | date |
|---|---|---|
| Towards Compiling Higher-Order Programs to Bayesian Networks | LAFI 2026 | 2026-01-11 |
Claims an effective compilation from a first‑order probabilistic lambda fragment to Bayesian networks, with a path to higher‑order and recursion, by running a… | ||
| Interaction Equivalence | POPL 2025 | 2025-01-19 |
Defines a checker lambda calculus with black/white lambdas and applications, four beta rules, and a deterministic head interaction steps count that ignores… | ||
| Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security(…) | OOPSLA 2024 | 2024-10-20 |
Proposes a EHL + pRHL hopping rule that reduces expectation-based proof goals to related programs, implements it inside EasyCrypt integration, and proves… | ||
| Invisible pebbles and the geometry of affine higher-order tree transducers | GALOP 2024 | 2024-01-14 |
This work shows that affine λ-transducers with (almost) purely affine memory translate to tree-walking transducers, proving an inexpressivity conjecture of… | ||
| Higher Order Bayesian Networks, Exactly | POPL 2024 | 2024-01-14 |
A higher-order lambda-calculus is defined that is sound and complete for Bayesian networks: every Bayesian network encodes as a term and every well-typed… | ||
| Multi Types and Reasonable Space | ICFP 2022 | 2022-09-11 |
Claims a concrete machine, Space KAM, is a reasonable space cost model for the lambda calculus (linear overhead vs. Turing/RAM) and handles logarithmic-space… | ||
| The (In)Efficiency of Interaction | POPL 2021 | 2021-01-17 |
Compares four token-based abstract machines and proves precise time gaps: YAM (geometry of interaction) can be exponentially slower than Curien’s environment… | ||
| nothing matches | ||