equational-reasoning
Proof assistant for Haskell using DataKinds & PolyKinds
| LTS Haskell 24.28: | 0.7.1.0 |
| Stackage Nightly 2026-01-19: | 0.7.1.0@rev:1 |
| Latest on Hackage: | 0.7.1.0@rev:1 |
Maintained by konn.jinro_at_gmail.com
This version can be pinned in stack with:
equational-reasoning-0.7.1.0@sha256:506f33c15a9ac8c8c0ba8f25d41d9d134933f149ac9da65559774edb727e6110,1321Module documentation for 0.7.1.0
- Proof
- Proof.Equational
- Proof.Propositional
- Proof.Propositional.Empty
- Proof.Propositional.Inhabited
Depends on 5 packages(full list with versions):
Used by 5 packages in nightly-2026-01-19(full list with versions):
Agda-style Equational Reasoning in Haskell by Data Kinds
What is this?
This library provides means to prove equations in Haskell. You can prove equations in Agda’s EqReasoning like style.
See blow for an example:
plusZeroL :: SNat m -> Zero :+: m :=: m
plusZeroL SZero = Refl
plusZeroL (SSucc m) =
start (SZero %+ (SSucc m))
=== SSucc (SZero %+ m) `because` plusSuccR SZero m
=== SSucc m `because` succCongEq (plusZeroL m)
It also provides some utility functions to use an induction.
For more detail, please read source codes!
TODOs
- Automatic generation for induction schema for any inductive types.