Unfolding ML Datatype Declarations Without Loops
summary
Presents a technique for expanding ML-style algebraic datatype declarations into fully-defined type representations without using recursive loops or explicit fixpoints. Uses language-level transformations and type-system constructs to inline and unfold mutually recursive datatypes into non-recursive definitions, enabling simpler compilation and analysis of ML family languages.
AI-written summary · about
chapters (4)
related talks
15mA compilation method for dynamic typing in ML
32mMLstruct: Principal Type Inference in a Boolean Algebra of Structural Types
14mThe Simple Essence of Monomorphization
23mBetter Defunctionalization through Lambda Set Specialization
15mElaboration with First-Class Implicit Function Types
36mDependently Typed Multi-Stage Programming, Revisited
23mA Type Inferencer for ML in 200 Lines of Scala
21mOmnidirectional type inference for ML