A New Match Compiler for Standard ML of New Jersey
summary
Replaces a 30‑year‑old match compiler with a reimplementation that builds an and/or tree, extracts a decision tree via an ordered frontier worklist, then emits compiler AST; supports modern SML/NJ internals and ties into the LLVM backend work done earlier. Implementation lives on GitHub, focuses on tunable heuristics for frontier ordering to reduce redundancy, and is production‑ready—shipped Dec 2021 in the development branch and in release 21.22.1.
AI-written summary · about
chapters (5)
- 0:00Start
- 2:18Implementation Strategies for Pattern Matching
- 8:45Building And-Or Trees
- 10:25Extracting a Decision Tree
- 14:15Generating Abstract Syntax
related talks
34mModernizing Standard ML of New Jersey: A Status Report
29mMsML: A Proposal for a successor ML
29mPredicate Dispatch
31mRange-Analysis-Based Optimization for SML/NJ
25mNice to Meet You: Synthesizing Practical MLIR Abstract Transformers
08mCompiling pattern matching to in-place modifications
15mA compilation method for dynamic typing in ML
21mFlow-Analysis-Based Closure Optimization
