Ningning Xie
where else to find them
what they talk about
all 7 in the filters
where they keep going back
all 11 in the filters
on a stage with
all 24 in the filters
who talks about the same things
- Nicolas Wu25 talks
- Daniel Hillerström11 talks
- Jeremy Yallop12 talks
- Yizhou Zhang13 talks
- Sam Lindley27 talks
- Jonathan Immanuel Brachthäuser22 talks
| title | conference | date |
|---|---|---|
| Type Inference Techniques: Implementation and Formalization, Better Together | WITS 2026 | 2026-01-17 |
Argues that informal compiler hacks need formal proofs and demonstrates this with two concrete cases: scope checks for high‑rank polymorphism implemented via… | ||
| Handling Scope Checks: A Comparative Framework for Dynamic Scope Extrusion Checks | POPL 2026 | 2026-01-11 |
Compares three concrete dynamic checks—lazy vs eager and a new Cause-for-Concern (C4C) check—and gives a formal calculus for evaluating them with effect… | ||
| Extensible Data Types with Ad-Hoc Polymorphism | POPL 2026 | 2026-01-11 |
Combines row polymorphism and type classes to let rows carry constraints like all constraint and to fold over fields with a new primitive end induction, while… | ||
| Chair's report | Haskell 2025 | 2025-10-16 |
Program committee reports 19 submissions across categories: 12 regular papers, 4 functional pearls, 1 experiment report and 2 demos, with each paper getting at… | ||
| Welcome | Haskell 2025 | 2025-10-16 |
Session frames types and monads as the historical themes and contrasts free monads and freer monads with a concrete claim: monadic structure resists static… | ||
| Smart Handlers: Handling the selection monad | HOPE 2025 | 2025-10-12 |
Introduces selection monad ideas into algebraic effect handlers to add choice continuations that compute future losses; prototypes in a Haskell-like Huscoll… | ||
| Practical Type Inference with Levels | PLDI 2025 | 2025-06-16 |
Formalizes the implementation trick called levels for Hindley‑Milner style systems, covering generalization, local data types, and higher‑rank polymorphism… | ||
| Handling the Selection Monad | PLDI 2025 | 2025-06-16 |
Designs effect handlers that expose loss continuations derived from the selection monad, letting handlers observe per-choice losses and resume computations… | ||
| Effect Handlers for Choice-Based Learning | LAFI 2024 | 2024-01-14 |
Combines algebraic effects and handlers with loss continuations to make choice points first-class for optimizing decisions. Shows a Haskell effect-handler… | ||
| Haskell for choice-based learning | Haskell 2023 | 2023-09-08 |
Claims that choice-based learning is implementable by combining algebraic effects and handlers with the selection monad, so optimizers become handlers that… | ||
| Infix-Extensible Record Types for Tabular Data | TyDe 2023 | 2023-09-04 |
A row-polymorphic record calculus that adds scoped labels and first-class labels and rows plus record concatenation, with a Hindley-Milner–style inference… | ||
| MacoCaml: Staging Composable and Compilable Macros | ICFP 2023 | 2023-09-04 |
MacoCaml implements compile‑time code generation inside the OCaml compiler, treating macros as compile-time bindings and using quotation/splice staging so… | ||
| Staging with Class: A Specification for Typed Template Haskell | YOW! Melbourne 2022 | 2022-12-08 |
Proposes staged type class constraints that mark when a type-class dictionary lives in code so elaboration emits staged dictionaries as Code values, implements… | ||
| Applicative Intersection Types | APLAS 2022 | 2022-12-05 |
Two calculi for intersection types with an explicit merge operator: the first admits an unrestricted merge, proves type soundness but yields non-deterministic… | ||
| 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… | ||
| Staging with Class: A Specification for Typed Template Haskell | POPL 2022 | 2022-01-16 |
Shows that Template Haskell’s interaction with overloading is unsound: splicing well-typed code can produce missing-dictionary errors. Proposes staged type… | ||
| 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… | ||
| Effect Handlers, Evidently | ICFP 2020 | 2020-08-23 |
Presents an evidence-passing translation that elaborates polymorphic algebraic effects into polymorphic lambda calculus, with a proof of soundness and… | ||
| nothing matches | ||