name: free-theorems
version: 0.2
license: PublicDomain
license-file: LICENSE
author: Sascha Boehme
maintainer: voigt@tcs.inf.tu-dresden.de
synopsis: Automatic generation of free theorems.
description:
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.
category: Language
tested-with: GHC==6.8.2
build-type: Simple
build-depends:
base >= 1.0
, mtl >= 1.0
, haskell-src >= 1.0
, haskell-src-exts >= 0.2.1
, pretty >= 1.0.0.0
, containers >= 0.1.0.1
exposed-modules:
Language.Haskell.FreeTheorems
Language.Haskell.FreeTheorems.Syntax
Language.Haskell.FreeTheorems.Parser.Haskell98
Language.Haskell.FreeTheorems.Parser.Hsx
Language.Haskell.FreeTheorems.Theorems
other-modules:
Language.Haskell.FreeTheorems.BasicSyntax
Language.Haskell.FreeTheorems.ValidSyntax
Language.Haskell.FreeTheorems.NameStores
Language.Haskell.FreeTheorems.Frontend
Language.Haskell.FreeTheorems.Frontend.Error
Language.Haskell.FreeTheorems.Frontend.TypeExpressions
Language.Haskell.FreeTheorems.Frontend.CheckLocal
Language.Haskell.FreeTheorems.Frontend.CheckGlobal
Language.Haskell.FreeTheorems.LanguageSubsets
Language.Haskell.FreeTheorems.Intermediate
Language.Haskell.FreeTheorems.Unfold
Language.Haskell.FreeTheorems.PrettyBase
Language.Haskell.FreeTheorems.PrettyTypes
Language.Haskell.FreeTheorems.PrettyTheorems
hs-source-dirs: src
extensions: Generics, DeriveDataTypeable, Rank2Types, PatternSignatures