Richard A. Eisenberg
where else to find them
what they talk about
all 6 in the filters
where they keep going back
- POPL3 editions2021–2025
- Haskell2 editions2020–2025
- Haskell Symposium2 editions2021–2022
all 10 in the filters
on a stage with
all 27 in the filters
who talks about the same things
- Aleksander Boruch-Gruszecki9 talks
- Stephanie Weirich14 talks
- Stephen Dolan13 talks
- Steve Zdancewic19 talks
- Ondřej Lhoták11 talks
- Edward Lee10 talks
| title | conference | date |
|---|---|---|
| Taming the Flat Float Array Optimization: Tracking Separability in the Type System | OCaml Workshop 2025 | 2025-10-17 |
Extends the type/kind system to track three-valued separability axis so the compiler knows whether a type is definitely non-float, definitely float, or… | ||
| A Tale of Two Lambdas: A Haskeller's Journey into OCaml | Haskell 2025 | 2025-10-16 |
Compares concrete tradeoffs: Haskell keeps purity and a heavy optimizer while OCaml favors mutation and predictable performance; Jane Street runs roughly 80… | ||
| Invited Talk: Type inference in OCaml and GHC using Levels | WITS 2025 | 2025-01-25 |
Claim: both OCaml and GHC implement let-generalization using lexical levels on types or levels on variables, and those levels also power other checks (escape… | ||
| Data Race Freedom à la Mode | POPL 2025 | 2025-01-19 |
DRFcaml extends OCaml's type system with new mode axes (contention and portability) to statically guarantee data-race freedom for multi-threaded OCaml while… | ||
| A Non-allocating Option | OCaml 2024 | 2024-09-07 |
Adds a new optional type or_null with constructors This and Null that uses the all-zero bit pattern as a non-allocating None, keeps legacy option unchanged… | ||
| Layout Polymorphism: Using static computation to allow efficient polymorphism over... | Higher-order, Typed, Inferred, Strict: ML Family Workshop 2023 | 2023-09-08 |
Design introduces unboxed layouts for OCaml (32‑ and 64‑bit floats, 64‑bit ints, product layouts) and compiles polymorphic code by layout monomorphisation… | ||
| Unboxed types for OCaml | ML 2022 | 2022-09-15 |
Proposal adds unboxed types to OCaml to eliminate pointer boxing and heavy allocation (example: a pair of 32-bit ints on 64-bit needing many words and… | ||
| Eiger: Auditable, executable, flexible legal regulations | Haskell Symposium 2022 | 2022-09-15 |
Eiger implements a domain-specific language embedded in Haskell that encodes regulations as dependency graphs of facts, pairs a domain expert with an engineer… | ||
| Linearly Qualified Types: Generic Inference for Capabilities and Uniqueness | ICFP 2022 | 2022-09-11 |
Adds implicit linear constraints as qualified types and implements a constraint generation and inference algorithm that extends GHCs solver, desugaring the… | ||
| Provably Correct, Asymptotically Efficient, Higher-Order Reverse-Mode Automatic | POPL 2022 | 2022-01-16 |
Claims a source to source transformation that produces dual numbers then generalizes to multi dual numbers and a compact symbolic delta representation… | ||
| Seeking Stability by being Lazy and Shallow: Lazy and shallow instantiation | Haskell Symposium 2021 | 2021-08-26 |
Formalizing a type-system family parameterized by eager vs lazy and deep vs shallow instantiation, the work proves stability properties (type-preserving let… | ||
| A Graded Dependent Type System with a Usage-Aware Semantics | POPL 2021 | 2021-01-17 |
Presents Grad, a dependent type calculus with natural-number grades and separate demand contexts for terms and types, plus a heap-based reduction using graded… | ||
| Composing Effects into Tasks and Workflows | Haskell 2020 | 2020-08-27 |
Combines effect handlers with arrow-like structures to build a composable workflow library that separates configuration time and process time. Implements a… | ||
| Stitch: The Sound Type-Indexed Type Checker (Functional Pearl) | Haskell 2020 | 2020-08-27 |
Stitch is a full STLC interpreter with parser, length-indexed AST, type checker, evaluator, common-subexpression elimination and a REPL, implemented in Haskell… | ||
| Kinds are Calling Conventions | ICFP 2020 | 2020-08-23 |
An intermediate language encodes runtime representation, arity and evaluation strategy inside kinds so multi-argument calls compile statically even under… | ||
| A Practical Introduction to Haskell GADTs | LambdaConf 2015 | 2015-05-22 |
Claim: GADTs let the compiler assume different types in different pattern branches so invariants live in types, reducing unsafeCoerce. Workshop builds a simply… | ||
| nothing matches | ||