How Idris Encodes Domain Logic in the Type System
Idris’s dependent types let you model domain constraints as types, catching rule violations before the program runs. This post walks through the concepts, concrete examples, and practical trade‑offs.
Functional-Programming
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.
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.