Marcos Grandury
where else to find them
what they talk about
where they keep going back
no series more than once — all 1 in the filters
on a stage with
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Verifying Graph Algorithms in Separation Logic: A Case for an Algebraic Approach | ICFP 2025 | 2025-10-12 |
Graphs become a partial commutative monoid so they support join-based decomposition; structure-preserving PCM morphisms distribute over joins and let proofs… | ||
| nothing matches | ||