Oliver Bračevac
where else to find them
what they talk about
all 4 in the filters
where they keep going back
- OOPSLA5 editions2020–2025
all 4 in the filters
on a stage with
all 11 in the filters
who talks about the same things
- Yuyan Bao8 talks
- Songlin Jia6 talks
- Tiark Rompf24 talks
- Guannan Wei21 talks
- Jonathan Immanuel Brachthäuser22 talks
- Yuxuan Jiang5 talks
| title | conference | date |
|---|---|---|
| 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… | ||
| What's in the Box: Ergonomic and Expressive Capture Tracking over Generic Data(…) | OOPSLA 2025 | 2025-10-16 |
Claims a new calculus System Capless with existential and universal capture-set quantification and a named mechanism rcaps that lets generic boxed capabilities… | ||
| System Capybara: Capture Tracking for Ownership and Borrowing | The Scala Workshop 2025 | 2025-10-12 |
System Capybara extends capture checking to track ownership and borrowing by adding access-mode-qualified captures (read vs owned), enforcing separation and… | ||
| Capture Checking - A New Approach to Effect Safety in Scala | Scala Days 2025 Lausanne | 2025-08-19 |
Capture Checking adds capability tracking into Scala’s type system and turns runtime resource-leak crashes (for example returning a file handle from a scoped… | ||
| 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… | ||
| 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)… | ||
| 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… | ||
| 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… | ||
| nothing matches | ||