ML 2025
as the organisers put it
The 8th International Conference on Machine Learning and Intelligent Systems (MLIS 2026) will be held in November 25-28, 2026 Sanya, Hainan, China.
| title | author | length |
|---|---|---|
| From CakeML to Proof Checking, and Back Again | Yong Kiam Tan | 43m |
CakeML now comprises about 750,000 lines of code (over a million including auxiliaries) and delivers a formally verified compiler from a high‑level ML-like… | ||
| LunarML: From Standard ML to Scripting Languages | Mizuki Arata | 29m |
LunarML is a Standard ML ’97 compiler that actually compiles itself and runs HaMLet, targeting Lua and JavaScript backends. It implements the full language… | ||
| MsML: A Proposal for a successor ML | David MacQueen | 29m |
MsML proposes a compact successor dialect of Standard ML used as the target for a planned reimplementation of the SML/NJ front end, claiming fewer legacy… | ||
| A typed approach to ontology manipulation (experience report) | Davide Camino, Andrea Zito, Viviana Bono, Lorenzo Bafunno, Lorenzo Pasini, Emanuele Rovaretto | 32m |
Presents a practical pipeline that uses the statically typed XML language CDuce to parse RDF/XML, convert the Europeana fashion thesaurus into OWL-style… | ||
| Compositional Deep Argument Flattening | Martin Elsman | 30m |
Presents a compositional mechanism that uncurries and unboxes nested and curried arguments across module boundaries, implemented as argument transformers in… | ||
| Implicit modules, a middle step towards modular implicits | Samuel Vivien, Didier Rémy | 28m |
Claims a working implementation and formalization of modular implicits prototype for OCaml: a module-elaboration engine that synthesizes first-class module… | ||
| Freezing Bidirectional Typing (Extended Abstract) | Wenhao Tang, Shengyi Jiang, Sam Lindley, Bruno C. d. S. Oliveira | 29m |
Frost implements bidirectional information flow between function and argument types, using skeletons with ghosts to pass partial type shapes both ways; a… | ||
| A Core Language for Extended Pattern Matching and Binding Boolean Expressions | Arthur Charguéraud, Yanni Lefki | 30m |
Presents a small core language that encodes guarded patterns, active/view deconstructors, and Rust-style if-let chains by treating pattern tests as binding… | ||
| Range-Analysis-Based Optimization for SML/NJ | John Reppy, Byron Zhong | 31m |
Range analysis runs on SML/NJ’s CPS IR using extended SSA in CPS and interval constraints to prove when overflow and array-bounds checks are unnecessary, with… | ||
| nothing matches | ||