equational-reasoning

Proof assistant for Haskell using DataKinds & PolyKinds

Version on this page:	0.6.0.1
LTS Haskell 24.23:	0.7.1.0
Stackage Nightly 2025-12-10:	0.7.1.0
Latest on Hackage:	0.7.1.0

See all snapshots equational-reasoning appears in

BSD-3-Clause licensed by Hiromi ISHII

Maintained by konn.jinro_at_gmail.com

This version can be pinned in stack with:equational-reasoning-0.6.0.1@sha256:8a1422fb4a79f19d3e95e73f721aa764968e12768b5e2d2e2940e2db71d2e452,1737

Module documentation for 0.6.0.1

Proof
- Proof.Equational
- Proof.Propositional
  - Proof.Propositional.Empty
  - Proof.Propositional.Inhabited

Depends on 6 packages(full list with versions):

base, containers, template-haskell, th-desugar, th-extras, void

Used by 4 packages in lts-15.5(full list with versions):

ghc-typelits-presburger, singletons-presburger, sized, type-natural

A simple convenient library to write equational / preorder proof as in Agda. Since 0.6.0.0, this no longer depends on singletons package, and the Proof.Induction module goes to equational-reasoning-induction package.