Diagram of type variables being unified during inference.

How HM Type Inference Derives Types Without Annotations

A deep dive into the Hindley‑Milner algorithm, showing how it infers types, handles polymorphism, and powers languages like Haskell and ML.

May 16, 2026 · 7 min · 1308 words · martinuke0
Illustration of a parser combinator tree building a DSL.

Designing Domain Specific Languages with Parser Combinators

A deep dive into building DSLs with parser combinators, covering fundamentals, design patterns, and real‑world library choices.

May 15, 2026 · 9 min · 1757 words · martinuke0
Feedback