Type Inhabitation in Lean: Why “Hello {name}” Can Become a Theorem

The article explains type inhabitation in Lean, a proof assistant where types can encode logical properties, ensuring invalid states are unrepresentable. It illustrates how programs and proofs converge, with types like Nat and True being inhabited, while False is uninhabited.