We present an embedded Quantum Lambda Calculus in Haskell. This embedding is intrinsically typed, enforces linearity without needing Haskell’s linear functions, allows classical control and non-linear use of classical bits, reuses the host binders to provide named binders in the guest, and is isomorphic to a first-order De Bruijn representation.