Refinement types for Haskell

  title={Refinement types for Haskell},
  author={Niki Vazou and Eric L. Seidel and Ranjit Jhala and Dimitrios Vytiniotis and Simon L. Peyton Jones},
We present LiquidHaskell (, an automatic verifier for Haskell. LiquidHaskell uses Refinement types, a restricted form of dependent types where relationships between values are encoded by decorating types with logical predicates drawn from an efficiently SMT decidable theory (of arithmetic and uninterpreted functions.) In this talk, we will describe the key ingredients of LiquidHaskell. First, we will present a rapid overview of refinement types, including SMT… CONTINUE READING


Publications citing this paper.


Publications referenced by this paper.
Showing 1-9 of 9 references

Hybrid type checking

POPL • 2006
View 20 Excerpts
Highly Influenced

Idris: general purpose programming with dependent types

PLPV • 2013
View 5 Excerpts
Highly Influenced

Refinement Types for Secure Implementations

2008 21st IEEE Computer Security Foundations Symposium • 2008
View 12 Excerpts
Highly Influenced

Towards a practical programming language based on dependent type theory

U. Norell
PhD thesis, Chalmers • 2007
View 4 Excerpts
Highly Influenced

Coq’Art: The Calculus of Inductive Constructions

Y. Bertot, P. Castéran
Springer Verlag • 2004
View 5 Excerpts
Highly Influenced

Extended Static Checking for Java

MPC • 2004
View 3 Excerpts
Highly Influenced

Cayenne - A Language with Dependent Types

Advanced Functional Programming • 1998
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…