Elias Castegren
where else to find them
what they talk about
where they keep going back
no series more than once — all 4 in the filters
on a stage with
all 12 in the filters
who talks about the same things
- David Broman8 talks
- Philipp Haller11 talks
- Tobias Wrigstad15 talks
- James Noble17 talks
- Mark Batty5 talks
- Matthew J. Parkinson11 talks
| title | conference | date |
|---|---|---|
| Trieste: A C++ DSL for Flexible Tree Rewriting (Tool paper) | SLE 2024 | 2024-10-20 |
Trieste is a C++ DSL that implements in-place subtree pattern matching to run multipass compiler pipelines, with each pass checked by dynamic well-formedness… | ||
| Concurrent Mutation must go | POCL 2024 | 2024-01-16 |
Argument: concurrent mutation causes the costly read-reclaim race so the simple claim is remove concurrent mutation for temporal safety. Evidence: survey of… | ||
| Reference Capabilities for Flexible Memory Management | OOPSLA 2023 | 2023-10-23 |
Verona organises all objects into tree-shaped regions with a window of mutability that only allows allocation and deallocation in the active region, making… | ||
| Statically Resolvable Ambiguity | POPL 2023 | 2023-01-15 |
Presents a concrete solution that proves every ambiguous program in the supported formalism can be rewritten unambiguously, with a full Coq mechanization and… | ||
| nothing matches | ||