equational-reasoning

Proof assistant for Haskell using DataKinds & PolyKinds

Version on this page:	0.6.0.3
LTS Haskell 23.5:	0.7.1.0
Stackage Nightly 2025-01-21:	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.3@sha256:a59f45b15118add889948c3a3b25ed8cc324e01c088616302a5265db9ac451c8,1772

Module documentation for 0.6.0.3

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-16.31(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.