This talk is a gentle introduction to refinement types describing how type directed verification is automated using an SMT solver as a black box. As the refinement type checker, we use Liquid Haskell, a Haskell extension that checks that the Haskell code satisfies the refinement types, specified as Haskell comments. We can use Liquid Haskell to verify a wide range of properties ranging from the absence of infamous software bugs (e.g., heartbleed) to list laws (e.g., append is associative).