Liquid Haskell
- type theory
- languages
Liquid Haskell adds refinement-style specifications to Haskell programs, expressing logical predicates alongside ordinary types. Automated reasoning through SMT solving helps check that definitions satisfy the supported predicates and assumptions. The system connects functional programming with verification of properties such as bounds or relationships among values. Its guarantees depend on the logic, treatment of termination, imported specifications and trusted components. It is not the same mechanism as Haskell’s ordinary type inference, nor does adding an annotation automatically establish a property without a successful check. **Timeline anchor:** 1 January 2014 CE. Approximate. **References:** [Source 1](https://en.wikipedia.org/wiki/Refinement_type).
Sources
On other timelines
- LiquidHaskell applies predicate refinements to Haskell on Type theory · foundations, languages, proof assistants and program logics by @athan