Daan Leijen
where else to find them
what they talk about
all 5 in the filters
where they keep going back
- ICFP3 editions2022–2025
- PLDI Workshop Honoring Andreas Podelski3 editions2024–2026
- OOPSLA2 editions2022–2023
all 8 in the filters
on a stage with
all 19 in the filters
who talks about the same things
- Anton Lorenzen8 talks
- Sam Lindley27 talks
- Wouter Swierstra10 talks
- Deepak Garg18 talks
- Steve Zdancewic19 talks
- Michel Steuwer17 talks
| title | conference | date |
|---|---|---|
| Syntactic Implicit Parameters with Static Overloading | PLDI 2026 | 2026-06-15 |
Presents a simple, orthogonal design that combines syntactic implicit parameters and static overloading, formalizes coherence and gives a sound, complete… | ||
| First-Order Laziness | ICFP 2025 | 2025-10-12 |
Proposes replacing thunk closures with lazy constructors that are defunctionalized first‑order values, implemented in Koka; evaluation happens on pattern match… | ||
| Principal Type Inference under a Prefix: A Fresh Look at Static Overloading | PLDI 2025 | 2025-06-16 |
A new rule set, HMQ (type inference under a prefix), replaces HM guessing with fresh type variables plus composable prefixes as solvable constraints, yielding… | ||
| The Functional Essence of Imperative Binary Search Trees | PLDI 2024 | 2024-06-24 |
Functional algorithms introduce a new first-class constructor context primitive and use Koka’s reuse-aware reference counting to implement tail-call, in-place… | ||
| Continuing WebAssembly with Effect Handlers | OOPSLA 2023 | 2023-10-23 |
WasmFX extends WebAssembly with WasmFX adds three instructions to create, suspend and resume continuations and with typed one-shot continuations that fit… | ||
| Exploring Perceus For OCaml | Higher-order, Typed, Inferred, Strict: ML Family Workshop 2023 | 2023-09-08 |
Prototype implements Perceus as an OCaml 4.14 backend and replaces the runtime GC so no GC runs in benchmarks; exceptions and mutable refs are not yet… | ||
| Getting Productive in Research | PLMW @ ICFP 2023 | 2023-09-04 |
Panel lays out concrete moves: get at least one detailed research letter from someone who knows your work—letters are the most important factor for grad… | ||
| Diversity, equality, and inclusion at ICFP | ICFP 2023 | 2023-09-04 |
ICFP creates a new coordinated diversity effort with a standing committee, a long-term mentoring program that currently matches about 300 mentees and 200… | ||
| FP²: Fully in-Place Functional Programming | ICFP 2023 | 2023-09-04 |
Formal system proves a large class of pure functions can run with no allocation or deallocation and constant stack space when their arguments are unique, and… | ||
| Tail Recursion Modulo Context: An Equational Approach | POPL 2023 | 2023-01-15 |
Generalizes tail recursion modulo cons into a general TRMC algorithm derived from an equational specification, requiring four instantiation operations and… | ||
| First-class Names for Effect Handlers | OOPSLA 2022 | 2022-12-05 |
Claim: treating first-class handler names as values plus scoped effects with rank-2 polymorphism prevents name-escaping without new language primitives. Paper… | ||
| What About the Integer Numbers? | ML 2022 | 2022-09-15 |
Argues for fast hardware support for proper integers and presents three novel tricks for tagged integers, including the sofa technique that performs a… | ||
| Reference Counting with Frame Limited Reuse | ICFP 2022 | 2022-09-11 |
Defines Perceus garbage-free refcounting that inserts precise increment/drop ops so objects free exactly when unreachable, adds a new drop-guided reuse… | ||
| Effect Handlers in Haskell, Evidently | Haskell 2020 | 2020-08-27 |
Presents a Haskell library called consort.ev.f that implements the evidence-passing translation from polymorphic algebraic effects to plain lambda calculus… | ||
| nothing matches | ||