2000 character limit reached
Functional Pearl: Theorem Proving for All (Equational Reasoning in Liquid Haskell) (1806.03541v1)
Published 9 Jun 2018 in cs.PL
Abstract: Equational reasoning is one of the key features of pure functional languages such as Haskell. To date, however, such reasoning always took place externally to Haskell, either manually on paper, or mechanised in a theorem prover. This article shows how equational reasoning can be performed directly and seamlessly within Haskell itself, and be checked using Liquid Haskell. In particular, language learners --- to whom external theorem provers are out of reach --- can benefit from having their proofs mechanically checked. Concretely, we show how the equational proofs and derivations from Graham's textbook can be recast as proofs in Haskell (spoiler: they look essentially the same).
- Niki Vazou (20 papers)
- Joachim Breitner (16 papers)
- Will Kunkel (1 paper)
- David Van Horn (44 papers)
- Graham Hutton (1 paper)