🌿 Haskell

Theory

Haskell = $\lambda$‑calculus + syntax + static polymorphic types + laziness.

• Purely functional – every expression is referentially transparent.
• Lazy evaluation – compute values only when needed. Enables infinite data like [1..].
• Static typing with inference – the compiler deduces principal types.
• First‑class functions – pass/return functions freely.

Pillars

• ✏️ Syntax & Equations – concise pattern‑driven definitions.
• 🛡️ Type System – ::, algebraic datatypes, type classes.
• 🔄 Recursion & Pattern Matching – primary control mechanism.
• 🔧 Higher‑Order Functions – map, filter, fold, etc.
• 🌲 Algebraic Data Types – user data models (product, sum, recursive).