@hackage free-theorems0.3.2.1
Automatic generation of free theorems.
Installation
Dependencies (6)
- base >=1 && <5
- containers >=0.1.0.1
- haskell-src >=1.0
- mtl >=1.0
- pretty >=1.0.0.0
- syb >=0.1.0.0 Show all…
Dependents (6)
@hackage/polyseq, @hackage/free-theorems-counterexamples, @hackage/acme-everything, @hackage/free-theorems-seq, @hackage/ftshell, @hackage/free-theorems-webui
DESCRIPTION
This library may be used to automatically generate free theorems [1,2] from Haskell type signatures. It supports Haskell 98 and additionally higher-rank functions. Beside primitive Haskell types (Int, Integer, Float, Double, Char), it already includes lists and tuples. The library provides means to add other data types.
DEPENDENCIES
See the file `free-theorems.cabal' for dependencies. Note that there, two parser libraries are listed. If only one is needed, the library is easily adjustable by commenting out the corresponding dependencies and exported modules.
INSTALL
Since this library is cabalised, it uses the standard installation process.
runhaskell Setup.lhs configure runhaskell Setup.lhs build runhaskell Setup.lhs install
USAGE
See the Haddock-generated documentation for detailed information on how to use this library.
DOCUMENTATION
If Haddock is available, documentation may be generated automatically from the sources.
runhaskell Setup.lhs haddock
[1] Philip Wadler, Theorems for free!, In Functional Programming Languages and Computer Architecture, Proceedings, 1989.
[2] Patricia Johann and Janis Voigtländer, The Impact of seq on Free Theorems-Based Program Transformations, In Fundamenta Informaticae, 2006.