Patrick Bahr
where else to find them
no profile links on file
what they talk about
all 4 in the filters
where they keep going back
- ICFP2 editions2022–2023
all 4 in the filters
on a stage with
all 6 in the filters
who talks about the same things
- Rasmus Ejlers Møgelberg4 talks
- Deepak Garg18 talks
- Daan Leijen16 talks
- Troels Henriksen16 talks
- Anton Lorenzen8 talks
- Lars Birkedal35 talks
| title | conference | date |
|---|---|---|
| The Calculated Typer (Functional Pearl) | Haskell 2025 | 2025-10-16 |
Derives type checkers mechanically from a behavioural semantics by solving an inequality spec with equational, fold-based calculation and fold fusion to turn… | ||
| Asynchronous Reactive Programming with Modal Types in Haskell | PADL 2024 | 2024-01-15 |
Async Rattus is an embedded FRP library plus a GHC compiler plugin that enforces modal typing, performs clock inference, and elaborates user stubs into… | ||
| Modal FRP for all: Functional reactive programming without space leaks in Haskel... | ICFP 2023 | 2023-09-04 |
A modal FRP language Ratus is implemented as a Haskell library plus a GHC plugin that enforces stricter typing: a later modality for time-shifted values and a… | ||
| Asynchronous Modal FRP | ICFP 2023 | 2023-09-04 |
Async RaTT is a new modal language that compiles complete programs to machines consuming asynchronous input channels and emitting outputs, using an exist-later… | ||
| Calculating Compilers for Concurrency | ICFP 2023 | 2023-09-04 |
Paper shows a method that turns a high‑level choice trees semantics into a correct-by-construction compiler by adding a codensity construction, yielding… | ||
| Monadic Compiler Calculation (Functional Pearl) | ICFP 2022 | 2022-09-11 |
Derives a correct compiler from a correctness specification by calculating definitions during the proof, using the partiality monad to make divergence explicit… | ||
| Diamonds Are Not Forever: Liveness in Reactive Programming with Guarded Recursion | POPL 2021 | 2021-01-17 |
A new language called Lively RaTT combines guarded recursion with an inductive until type (e.g. diamond = unit until a) by treating the temporal circle… | ||
| nothing matches | ||