Willow Ahrens
where else to find them
no profile links on file
what they talk about
all 4 in the filters
where they keep going back
- Sparse2 editions2024–2025
on a stage with
all 13 in the filters
who talks about the same things
- Teodoro F. Collin2 talks
- Saman Amarasinghe13 talks
- Changwan Hong2 talks
- Jonathan Ragan-Kelley12 talks
- Amanda Liu4 talks
- Amir Shaikhha15 talks
| title | conference | date |
|---|---|---|
| The Continuous Tensor Abstraction: Where Indices are Real | OOPSLA 2025 | 2025-10-16 |
Introduces a compiler and code generator that lets tensor indices be real numbers and represents data as piecewise-constant tensors so infinite domains execute… | ||
| Finch: Sparse and Structured Tensor Programming with Control Flow | OOPSLA 2025 | 2025-10-16 |
Finch is a new language and compiler that combines flexible control flow with a parameterized format DSL to generate code that iterates only over nonzeros and… | ||
| Sparsity-Aware Autoscheduling for Numpy with Finch and Galley | Sparse 2025 | 2025-06-16 |
Galley implements an autoscheduler for the Finch sparse tensor compiler that makes concrete decisions: it uses database-style cardinality estimation (notably… | ||
| Panel: Compilation Frameworks | Sparse 2024 | 2024-06-25 |
Discussion shows a concrete path for quantify over bitwidth proofs: Lean supports quantifying bitwidth but only offers high‑performance automation for fixed… | ||
| Compiling Control Flow in Sparse and Structured Array Programs | Sparse 2024 | 2024-06-25 |
Finch is a new language and compiler that merges control flow and data-format descriptions so the compiler specializes loops, ifs, breaks, masks and… | ||
| Mechanised Hypersafety Proofs about Structured Data | PLDI 2024 | 2024-06-24 |
Claims a practical verification path: LGTM encodes formats as getter code and proves correctness via parametrised hypersafety triples mechanised as a Coq… | ||
| nothing matches | ||