ML Family Workshop 2026
as the organisers put it
ML is a large family of programming languages that includes Standard ML, OCaml, F#, CakeML, SML#, Manticore, MetaOCaml, JoCaml, Alice ML, Dependent ML, Flow Caml, Reason ML, Flix, MaPLe, and many others. All ML languages, besides a great deal of syntax, share several fundamental traits. They are all higher-order, mostly pure, and typed, with algebraic and other data types. Their type systems inherit from Hindley-Milner. The development of these languages has inspired a large amount of computer science research and influenced many programming languages, including Haskell, Scala, Rust, Cloju ...
who it's for
ML language researchers, functional programmers, compiler engineers, language designers, testing researchers, tooling and IDE developers, systems and runtime engineers
topics
property-based testing monad syntax; generator metaprogramming and synthesis; incremental property-based testing; self-tagging integer representation; polymorphic wrap/unwrap boundaries; compiled serialized-data traversal; traversal effect inference; layout optimization for serialized data; cursor-passing low-level code; Pratt-style macro parser; multiple binding spaces in macros; C FFI generation via macros
| title | author | length |
|---|---|---|
| Testing Incomplete Programs in OCaml | Pablo Benario Figueroa, Éric Tanter | 26m |
Testing frameworks get a third verdict called incomplete that distinguishes unfinished code from real failures; small edits to Alcotest and QCheck make them… | ||
| Language Support for Property-Based Testing | Harrison Goldstein | 28m |
Argues that ergonomic property-based testing needs three language features: monad syntax for generators (lets libraries swap seed-passing, seed-splitting, or… | ||
| Self-Tagging Numbers | John Reppy, Ben Wakefield, Byron Zhong | 36m |
Extends float self‑tagging to SML/NJ by applying a reversible bit transform — left rotate by three and XOR with 6 — to make common 64‑bit integers… | ||
| Functional Programming with Serialized Data | Michael Vollmer | 32m |
Gibbon compiles a subset of Haskell/ML into code that operates directly on serialized bytes, claiming safe, pointer-free traversals by enforcing symbolic… | ||
| The Rhombus Programming Language | Matthew Flatt | 59m |
Rhombus v1.0 is a Racket-based language that keeps Racket’s macro power but replaces s‑expressions with shrubbery notation, adds multiple binding spaces… | ||
| nothing matches | ||