free-theorems: Automatic generation of free theorems.
The free-theorems library allows to automatically generate free theorems from Haskell type expressions. It supports nearly all Haskell 98 types except of type constructor classes, and in addition it can also handle higher-rank functions. Free theorems are generated for three different sublanguages of Haskell, a basic one corresponding to the polymorphic lambda-calculus of Girard-Reynolds, an extension of that allowing for recursion and errors, and finally a sublanguage additionally allowing seq. In the last two sublanguages, also inequational free theorems may be derived in addition to classical equational results.
[Skip to Readme]
|Versions [RSS]||0.2, 0.2.1, 0.3, 0.3.1, 0.3.1.1, 0.3.1.2, 0.3.1.3, 0.3.2.0, 0.3.2.1|
|Dependencies||base (>=1), containers (>=0.1.0.1), haskell-src (>=1.0), mtl (>=1.0), pretty (>=126.96.36.199), syb (>=0.1.0.0) [details]|
|Uploaded||by JoachimBreitner at 2022-12-21T12:50:49Z|
|Reverse Dependencies||3 direct, 0 indirect [details]|
|Downloads||6438 total (16 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs available [build log]
Last success reported on 2022-12-21 [all 1 reports]