Live briefing
Everything about Liquid Haskell
Liquid Haskell is a program verifier for the programming language Haskell which allows specifying correctness properties by using refinement types. Properties are verified using a satisfiability modulo theories (SMT) solver which is SMTLIB2-compliant, such as the Z3 Theorem Prover. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Liquid HaskellA 5-minute orientation
- Pick up a classic book: Bulletin of the United States Army Medical DepartmentThe most-reprinted book on the subject
- Read the landmark paper: Liquidate your assets: reasoning about resource usage in liquid HaskellCited 31 times
- Go sideways: Refinement typeA closely related topic
- Go sideways: F* (programming language)A closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
No outline available.
🏆 Landmark papers (most cited)
Liquidate your assets: reasoning about resource usage in liquid Haskell
Verifying replicated data types with typeclass refinements in Liquid Haskell
An Introduction to Liquid Haskell
A tale of two provers: verifying monoidal string matching in liquid Haskell and Coq
Theorem proving for all: equational reasoning in liquid Haskell (functional pearl)
📚 Books worth reading
Bulletin of the United States Army Medical DepartmentUnited States. Army Medical Service. · 1944- 📕Earnings and profitsHaskell Edelstein · 1975
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Refinement type In type theory, a refinement type is a type endowed with a predicate which is assumed to hold for any element of the refined type. Refinement types can…
- F* (programming language) F* (pronounced F star) is a high-level, multi-paradigm, functional and object-oriented programming language inspired by the languages ML, Caml, and OCaml…
- Haskell Haskell (/ˈhæskəl/) is a general-purpose, statically typed, purely functional programming language with type inference and lazy evaluation. Haskell pioneered…
- Runtime predictive analysis Runtime predictive analysis (or predictive analysis) is a runtime verification technique in computer science for detecting property violations in program…
- Formal methods In computer science, formal methods are mathematically rigorous techniques for the specification, development, analysis, and verification of software and…
- Extended static checking Extended static checking (ESC) is a collective name in computer science for a range of techniques for statically checking the correctness of various program…
- WxHaskell wxHaskell is a portable and native graphical user interface (GUI) library for the programming language Haskell, built on wxWidgets. It is often used by…
- Z3 Theorem Prover Z3, also known as the Z3 Theorem Prover, is a satisfiability modulo theories (SMT) solver developed by Microsoft. Z3 was developed in the Research in Software…