Claudia Faggian
where else to find them
no profile links on file
what they talk about
where they keep going back
on a stage with
all 8 in the filters
who talks about the same things
- Gabriele Vanoni7 talks
- Alejandro Aguirre10 talks
- Philipp G. Haselwarter6 talks
- Kwing Hei Li6 talks
- Simon Oddershede Gregersen9 talks
- Henning Urbat6 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… | ||
| Normal Form Bisimulations by Value | GALOP 2024 | 2024-01-14 |
Defines a new call-by-value normal-form bisimilarity, net bisimilarity, built on the value substituent calculus of aatan Pini; proves net is included… | ||
| 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… | ||
| The Variable Elimination Algorithm as a Let-Term Rewriting | LAFI 2023 | 2023-01-15 |
Expresses variable elimination for Bayesian networks as let-term linear lambda-calculus rewriting and proves any VE factorization is reachable by four simple… | ||
| Intersection Types and (Positive) Almost-Sure Termination | POPL 2021 | 2021-01-17 |
Intersection types exactly characterize two probabilistic termination notions: the probability of convergence equals the least upper bound of norms of certain… | ||
| nothing matches | ||