Cabalize

diff --git a/ExFindExtended.hs b/ExFindExtended.hs
index 3b295ed..9cdf0f4 100644 (file)
--- a/ExFindExtended.hs
+++ b/ExFindExtended.hs
@@ -2,7 +2,7 @@ module ExFindExtended (TypVar(..),Typ(..),TermVar(..),Term,AbsTerm(..),testTerm,
 
 import Prelude hiding (Either(..))
 import qualified Prelude as E (Either(..))
-import List
+import Data.List
 import qualified Data.Map as Map
 import Control.Monad
 import M

diff --git a/Setup.hs b/Setup.hs
new file mode 100644 (file)
index 0000000..64b897b
--- /dev/null
+++ b/Setup.hs
@@ -0,0 +1,5 @@
+#!/usr/bin/runhaskell
+
+import Distribution.Simple
+
+main = defaultMainWithHooks simpleUserHooks

diff --git a/polyfix.cabal b/polyfix.cabal
new file mode 100644 (file)
index 0000000..2895434
--- /dev/null
+++ b/polyfix.cabal
@@ -0,0 +1,40 @@
+name:           polyfix
+version:        0.1
+license:        PublicDomain
+author:         Daniel Seidel, Joachim Breitner
+maintainer:     seideld@tcs.inf.tu-dresden.de
+synopsis:       Counter examples to Free Theorems
+description:
+       Given a Free Theorem, this program calculates a term for which the
+        Free Theorem does not hold if a strictness requirement is relaxed.
+        .
+        It also includes a simple Free Theorem deriver.
+category:       Language
+build-type:    Simple
+cabal-version:  >= 1.2
+
+extra-source-files:
+    TestItExt.hs
+
+library
+    build-depends:
+        base >= 1.0
+      , mtl >= 1.0
+      , haskell-src >= 1.0
+      , haskell-src-exts >= 0.3.9
+      , pretty >= 1.0.0.0
+      , containers >= 0.1.0.1
+      , HUnit >= 1.2
+    exposed-modules:
+        ExFindExtended
+        SimpleFT
+        ParseType
+    other-modules:
+        Expr
+        M
+
+executable polyfix.cgi
+    main-is:
+        polyfix-cgi.hs
+    build-depends:
+        xhtml, cgi, utf8-string, free-theorems >= 0.2.1