Tiark Rompf
where else to find them
what they talk about
all 8 in the filters
where they keep going back
all 10 in the filters
on a stage with
all 34 in the filters
who talks about the same things
- Guannan Wei21 talks
- Oliver Bračevac9 talks
- Songlin Jia6 talks
- Yuyan Bao8 talks
- Nada Amin26 talks
- Deepak Garg18 talks
| title | conference | date |
|---|---|---|
| Rhyme: A Multi-Paradigm Declarative Query Language | ARRAY 2026 | 2026-06-16 |
Rhyme is an implemented declarative language for nested data that expresses aggregations, group-bys, joins and tensor ops in a single JSON-like syntax and… | ||
| Escape with Your Self: Sound and Expressive Bidirectional Typing with Avoidance for(…) | PLDI 2026 | 2026-06-15 |
Presents an algorithmic design for reachability types that proves sound and decidable bidirectional typing and avoidance, mechanized in Lean 4 and accompanied… | ||
| Typestate via Revocable Capabilities | PLDI 2026 | 2026-06-15 |
Presents a Scala 3 compiler extension (prototype in Stella) that implements flow-sensitive revocation, ties capabilities to objects via path-dependent… | ||
| Modeling Reachability Types with Logical Relations -- Semantic Type Soundness,(…) | OOPSLA 2025 | 2025-10-16 |
Presents a formal logical-relations model for reachability types that augments standard relations with relational store typing to localize heap reasoning, and… | ||
| Specializing Data Access in a Distributed File System (Generative Pearl) | GPCE 2024 | 2024-10-21 |
DDLoader embeds HDFS partitioning and distribution into generated programs using LMS, fusing data-access and computation so code knows exact block paths at… | ||
| Polymorphic Reachability Types: Tracking Freshness, Aliasing, and Separation in(…) | OOPSLA 2024 | 2024-10-20 |
Presents a type system that adds a freshness qualifier to reachability types so newly allocated values remain distinct until substituted, enabling precise… | ||
| Rhyme: A Data-Centric Expressive Query Language for Nested Data Structures | PADL 2024 | 2024-01-15 |
Rhyme is an expressive query language implemented as an embedded DSL in JavaScript that targets nested JSON and tensor workloads and compiles to executable JS… | ||
| Polymorphic Reachability Types: Tracking Freshness, Aliasing, and Separation in ... | POPL 2024 | 2024-01-14 |
Introduces a new freshness qualifier (diamond) that marks allocations whose reachability may materialize later, and designs two calculi (λ✦ and F✦ calculi)… | ||
| Flan: An Expressive and Efficient Datalog Compiler for Program Analysis | POPL 2024 | 2024-01-14 |
Flan compiles a high‑level Datalog interpreter written in Scala via Lightweight Modular Staging to generate specialized C code, keeping the interpreter’s… | ||
| Graph IRs for Impure Higher-Order Languages: Making Aggressive Optimizations Af... | OOPSLA 2023 | 2023-10-23 |
A typed graph IR combines reachability types with an effect system to compute precise, flow-sensitive effect dependencies without CFA by doing type-based… | ||
| Partially Evaluating Symbolic Interpreters for All | PEPM 2022 | 2022-01-17 |
Builds staged symbolic interpreters with Lightweight Modular Staging (LMS) to compile concolic and call‑chain backward symbolic execution for an LLVM‑style IR… | ||
| On-Stack Replacement for Program Generators and Source-to-Source Compilers | GPCE 2021 | 2021-10-17 |
Implements a source-level OSR pattern that swaps loop bodies at iteration boundaries so generated C can start with a fast-to-compile version and trampoline to… | ||
| HACCLE: Metaprogramming for Secure Multi-Party Computation | GPCE 2021 | 2021-10-17 |
HACCLE is a compiler toolchain that embeds a DSL (Harpoon) in Scala, uses LMS metaprogramming to lower code to a protocol‑independent acyclic circuit IR (HIR)… | ||
| Reachability Types: Tracking Aliasing and Separation in Higher-Order Functional Programs | OOPSLA 2021 | 2021-10-17 |
New type system lambda assigns reachability qualifiers to expressions to track exact alias sets, enforces separation for higher-order functions with function… | ||
| Compiling Symbolic Execution with Staging and Algebraic Effects | OOPSLA 2020 | 2020-11-15 |
Claims a first Futamura projection for symbolic interpreters and shows a pipeline that stages a definitional interpreter (Scala + Freer monads + LMS) to… | ||
| Flare & Lantern: Accelerators for Spark and Deep Learning | Scala Days Lausanne 2019 | 2019-06-11 |
Two systems that convert high‑level Scala workloads into low‑level code and claim concrete speedups: Flare compiles Spark SQL and dataflow into native kernels… | ||
| Flare: Scale Up Spark with Native Compilation and Set Your Data on Fire | Scala Days Copenhagen 2017 | 2017-05-30 |
Flare compiles Catalyst query plans to native C and runs them with NUMA-aware scheduling and data layouts, turning Spark SQL jobs that took ~110 seconds on a 2… | ||
| How types can turn a SQL interpreter into a SQL compiler | Strange Loop 2014 | 2014-09-17 |
A 3,000–4,000 line Scala prototype called LegoBase generates low-level C and achieves up to >10x (peak) speedups versus commercial DBs and up to 20x versus… | ||
| nothing matches | ||