Matías Toro
where else to find them
no profile links on file
what they talk about
where they keep going back
- OOPSLA4 editions2022–2025
on a stage with
all 13 in the filters
who talks about the same things
- Wenjia Ye5 talks
- Éric Tanter12 talks
- Koen Jacobs3 talks
- Nicolas Tabareau14 talks
- Eric Giovannini2 talks
- John Peter Campora III5 talks
| title | conference | date |
|---|---|---|
| Flexible and Expressive Typed Path Patterns for GQL | OOPSLA 2025 | 2025-10-16 |
Defines FPPC — a formal type calculus for a core GQL fragment that adds property filters and imprecise (unknown) types, and statically flags queries that are… | ||
| Robust Dynamic Embedding for Gradual Typing | ICFP 2025 | 2025-10-12 |
Defines Robust Dynamic Embedding as a new adequacy criterion: if a dynamic component semantically satisfies a static type then its embedding ascribed to that… | ||
| Taming Unsoundness with Gradual Abstract Interpretation | UNSOUND 2024 | 2024-10-20 |
Proposes that optimistic but unsound assumptions in abstract interpretation become safe by automatically inserting runtime checks so analysis results are sound… | ||
| Merging Gradual Typing | OOPSLA 2024 | 2024-10-20 |
A new λM⋆ calculus combines gradual typing with an intersection-based merge operator, gives a typed-driven runtime (no separate cast calculus), and formalizes… | ||
| A Gradual Probabilistic Lambda Calculus | OOPSLA 2023 | 2023-10-23 |
Defines GPLC, a gradual probabilistic lambda calculus with probabilistic types and a binary choice operator, and elaborates programs to a target TPLC with… | ||
| Plausible sealing for gradual parametricity | OOPSLA 2022 | 2022-12-05 |
Proposes plausible sealing: postpone sealing decisions by inserting “maybe-seal” evidence so runtime, not static imprecision, decides whether a value is… | ||
| nothing matches | ||