Ohad Kammar
where else to find them
what they talk about
all 5 in the filters
where they keep going back
all 7 in the filters
on a stage with
all 27 in the filters
who talks about the same things
- Liam O'Connor7 talks
- Xueying Qin3 talks
- Michel Steuwer17 talks
- Sharon Shoham13 talks
- Nicolas Wu25 talks
- Gabriel Scherer12 talks
| title | conference | date |
|---|---|---|
| Typed Abstractions for Causal Probabilistic Programming | LAFI 2026 | 2026-01-11 |
A Haskell library reimplements Cairo’s causal features with concrete types, extracting a cosmonad (a reader monad transformer over a probability monad) to… | ||
| An Equational Axiomatization of Dynamic Threads via Algebraic Effects: Presheaves on(…) | POPL 2026 | 2026-01-11 |
Paper gives a concrete equational axiomatization for dynamic threads: a parameterized algebraic theory (using presheaves and strong monads) that encodes… | ||
| First-class Algebraic Presentations with Elaborator Reflection (Extended Abstract) | TyDe 2024 | 2024-09-06 |
Library for Idris 2 that reinterprets fragments of host syntax at compile time to give user-definable deeply embedded many-sorted algebras without changing… | ||
| Paella: algebraic effects with parameters and their handlers | HOPE 2024 | 2024-09-02 |
Library implements algebraic effects as computation trees indexed by worlds, claiming handlers that safely support dynamically allocated full ground reference… | ||
| A Denotational Approach to Release/Acquire Concurrency | GALOP 2024 | 2024-01-14 |
Presents a directionally adequate denotational semantics for Release/Acquire memory using Brookes-style trace semantics adapted to a view-based machine; traces… | ||
| Shoggoth - A Formal Foundation for Strategic Rewriting | POPL 2024 | 2024-01-14 |
Provides a formal denotational semantics for System S and a big-step operational semantics that explicitly models divergence, proves computational soundness… | ||
| Semantic foundations of potential-synthesis for expected amortised-cost analysis | HOPE 2023 | 2023-09-04 |
Ongoing work builds a semantic stack that synthesises potential functions for randomized data structures and guarantees amortised-cost bounds correct by… | ||
| Modular Construction of Multi-sorted Free Extensions | PEPM 2023 | 2023-01-16 |
Defines how to build combined free extensions by composing existing frexes and gives three modular constructions: a concrete involutive algebra frex (covers… | ||
| An Algebraic Theory for Shared-State Concurrency | APLAS 2022 | 2022-12-05 |
Presents a concrete monadic denotational model for a higher‑order language with shared‑state interleaving concurrency, proving a representation theorem that… | ||
| Normalization by Evaluation with Free Extensions (Extended Abstract) | TyDe 2022 | 2022-09-11 |
Claim: augmenting normalization-by-evaluation with free extensions (frex) produces a single generic NbE algorithm for simply typed lambda calculus with… | ||
| Idris2-Table: Evaluating dependently-typed tables with... (Extended Abstract) | TyDe 2022 | 2022-09-11 |
Built an Idris 2 library that encodes table schemas as dependent types and implements the Brown Benchmark for Table Types examples and programs, covering… | ||
| Fully Abstract Models for Effectful λ-Calculi via Category-Theoretic Logica | POPL 2022 | 2022-01-16 |
Construction takes a model of Moggi’s computational λ-calculus with sums, effect operations and primitives and produces an adequate, fully abstract refinement… | ||
| Frex: indexing modulo equations with free extensions (Extended Abstract) | TyDe 2020 | 2020-08-23 |
An extensible Idris2 library implements equality-by-normalization for indices using free extensions, with a user tier (frexlets) and a developer tier (core… | ||
| Frex: Free Extensions for Normalization-by-Evaluation | PEPM 2020 | 2020-01-20 |
Frex is a library that constructs free extension semantic domains to get normalization by evaluation for arbitrary algebraic theories; it ships solver specs… | ||
| nothing matches | ||