Michael Carbin
where else to find them
what they talk about
all 5 in the filters
where they keep going back
all 4 in the filters
on a stage with
all 26 in the filters
who talks about the same things
- Charles Yuan12 talks
- Eric Atkinson6 talks
- Gilles Barthe17 talks
- Jonathan Ragan-Kelley12 talks
- Jens Palsberg17 talks
- Yizhou Zhang13 talks
| title | conference | date |
|---|---|---|
| Inference Plans for Hybrid Particle Filtering | POPL 2025 | 2025-01-19 |
Built Siren, a probabilistic programming language that accepts inference plan annotations to force hybrid particle filtering to keep some random variables… | ||
| Quantum Control Machine: The Limits of Control Flow in Quantum Programming | OOPSLA 2024 | 2024-10-20 |
Proves that a straightforward conditional jump impossibility holds: lifting classical conditional jumps into superposition is nonrealizable, with a formal… | ||
| Distributions for Compositionally Differentiating Parametric Discontinuities | OOPSLA 2024 | 2024-10-20 |
Introduces Potto prototype as the first differentiable first-order language that soundly differentiates parametric discontinuities, gives a denotational… | ||
| The T-Complexity Costs of Error Correction for Control Flow in Quantum Computation | PLDI 2024 | 2024-06-24 |
Identifies that common control-flow constructs cause polynomial increases in T-complexity under surface-code error correction and gives a precise cost model… | ||
| Turaco: Complexity-Guided Data Sampling for Training Neural Surrogates of Progr... | OOPSLA 2023 | 2023-10-23 |
Method proposes Turaco, a tiny language plus analysis that computes per-path sample complexity from program source by forming a power series tilde… | ||
| Panel: Next 50 Years of POPL | POPL 2023 | 2023-01-15 |
Panel discussion surveys POPL's past and future with concrete examples and tensions: cites FlashFill and program synthesis, the 1976 abstract interpretation… | ||
| Tower: Data Structures in Quantum Superposition | OOPSLA 2022 | 2022-12-05 |
Language Tower provides a reversible semantics that compiles every program to a unitary circuit and enforces reversible operations, a type system that bounds… | ||
| Semi-symbolic Inference for Efficient Streaming Probabilistic Programming | OOPSLA 2022 | 2022-12-05 |
Semi-symbolic inference implements an automatic Rao-Blackwellized particle filter in ProbZelus by manipulating symbolic expression trees, using a central swap… | ||
| Tower: Data Structures in Quantum Superposition | PLanQC 2022 | 2022-09-15 |
Implements a language and runtime that realize reversible, history‑independent, bounded‑time data structures for quantum algorithms: Tower provides reversible… | ||
| Twist: Sound Reasoning for Purity and Entanglement in Quantum Programs | POPL 2022 | 2022-01-16 |
Twist presents a concrete language and the semantic property purity that guarantees an expression is unentangled from the rest of the program, implemented via… | ||
| Statically Bounded-Memory Delayed Sampling for Probabilistic Streams | OOPSLA 2021 | 2021-10-17 |
Defines two dataflow conditions, m-consumed and unseparated path, and proves they are necessary and sufficient for delayed sampling to use bounded memory on… | ||
| Simplifying Multiple-Statement Reductions with the Polyhedral Model | POPL 2021 | 2021-01-17 |
Paper formalizes simplifying dependent reductions as an integer bilinear program over reuse vectors and polyhedral schedules and shows it is hard to solve… | ||
| λS: Computable Semantics for Diff'ble Programming with HO Functions and Datatypes | POPL 2021 | 2021-01-17 |
A new differentiable programming semantics, λS, gives computable meanings for higher-order derivatives and for nondifferentiable ops via the Clarke derivative… | ||
| Programming and Reasoning with Partial Observability | OOPSLA 2020 | 2020-11-15 |
Presents belief programming plus Epistemic Hoare Logic and a new language BLIMP that treat program state as a set of environments and use box/diamond… | ||
| nothing matches | ||