diff --git a/accelerate-fourier.cabal b/accelerate-fourier.cabal
--- a/accelerate-fourier.cabal
+++ b/accelerate-fourier.cabal
@@ -1,10 +1,10 @@
 Name:             accelerate-fourier
-Version:          0.0
+Version:          0.0.1
 License:          BSD3
 License-File:     LICENSE
 Author:           Henning Thielemann <haskell@henning-thielemann.de>
 Maintainer:       Henning Thielemann <haskell@henning-thielemann.de>
-Homepage:         http://code.haskell.org/~thielema/accelerate-fourier/
+Homepage:         http://hub.darcs.net/thielema/accelerate-fourier/
 Category:         Math
 Synopsis:         Fast Fourier transform and convolution using the Accelerate framework
 Description:
@@ -14,7 +14,7 @@
   but it does not contain low-level optimizations.
   .
   * For CUDA specific optimizations please see
-    @cufft@ and @accelerate-fft@ and @accelerate-cufft@ packages.
+    @cufft@ and @accelerate-cufft@ and @accelerate-fft@ packages.
   .
   * For CPU specific optimizations cf. @accelerate-fftw@ package.
 Tested-With:      GHC==7.8.3
@@ -22,24 +22,24 @@
 Build-Type:       Simple
 
 Source-Repository this
-  Tag:         0.0
+  Tag:         0.0.1
   Type:        darcs
-  Location:    http://code.haskell.org/~thielema/accelerate-fourier/
+  Location:    http://hub.darcs.net/thielema/accelerate-fourier/
 
 Source-Repository head
   Type:        darcs
-  Location:    http://code.haskell.org/~thielema/accelerate-fourier/
+  Location:    http://hub.darcs.net/thielema/accelerate-fourier/
 
 Library
   Build-Depends:
-    accelerate-arithmetic >=0.0.1 && <0.1,
+    accelerate-arithmetic >=0.1 && <0.2,
     accelerate-utility >=0.1 && <0.2,
     accelerate >=0.15 && <0.16,
     containers >=0.5 && <0.6,
-    transformers >=0.3 && <0.5,
+    transformers >=0.3 && <0.6,
     utility-ht >=0.0.8 && <0.1,
-    QuickCheck >=2.4 && <2.8,
-    base >=4.5 && <4.8
+    QuickCheck >=2.4 && <3,
+    base >=4.5 && <4.9
 
   GHC-Options:      -Wall -fwarn-missing-import-lists
   Hs-Source-Dirs:   src
diff --git a/src/Data/Array/Accelerate/Convolution/Private.hs b/src/Data/Array/Accelerate/Convolution/Private.hs
--- a/src/Data/Array/Accelerate/Convolution/Private.hs
+++ b/src/Data/Array/Accelerate/Convolution/Private.hs
@@ -10,6 +10,8 @@
            (:.)((:.)), Slice, Shape,
            (!), (?), (&&*), (<*), (<=*), )
 
+import Prelude (Int, )
+
 
 type Transform2 sh a =
    Acc (Array sh a) ->
diff --git a/src/Data/Array/Accelerate/Fourier/Adhoc.hs b/src/Data/Array/Accelerate/Fourier/Adhoc.hs
--- a/src/Data/Array/Accelerate/Fourier/Adhoc.hs
+++ b/src/Data/Array/Accelerate/Fourier/Adhoc.hs
@@ -36,8 +36,8 @@
 import Data.Array.Accelerate.Fourier.Utility (scaleDown, )
 import Data.Array.Accelerate.Fourier.Sign (Sign, )
 
-import qualified Data.Array.Accelerate.Arithmetic.LinearAlgebra as LinAlg
-import Data.Array.Accelerate.Arithmetic.LinearAlgebra
+import qualified Data.Array.Accelerate.LinearAlgebra as LinAlg
+import Data.Array.Accelerate.LinearAlgebra
           (zipExtrudedVectorWith, zipExtrudedMatrixWith, )
 
 import qualified Data.Array.Accelerate.Utility.Sliced as Sliced
diff --git a/src/Data/Array/Accelerate/Fourier/Planned.hs b/src/Data/Array/Accelerate/Fourier/Planned.hs
--- a/src/Data/Array/Accelerate/Fourier/Planned.hs
+++ b/src/Data/Array/Accelerate/Fourier/Planned.hs
@@ -62,8 +62,8 @@
 import Data.Array.Accelerate.Fourier.Utility (scaleDown, )
 import Data.Array.Accelerate.Fourier.Sign (Sign(Sign))
 
-import qualified Data.Array.Accelerate.Arithmetic.LinearAlgebra as LinAlg
-import Data.Array.Accelerate.Arithmetic.LinearAlgebra
+import qualified Data.Array.Accelerate.LinearAlgebra as LinAlg
+import Data.Array.Accelerate.LinearAlgebra
           (zipExtrudedVectorWith, zipExtrudedMatrixWith, )
 
 import qualified Data.Array.Accelerate.Utility.Lift.Exp as Exp
diff --git a/src/Data/Array/Accelerate/Fourier/Preprocessed.hs b/src/Data/Array/Accelerate/Fourier/Preprocessed.hs
--- a/src/Data/Array/Accelerate/Fourier/Preprocessed.hs
+++ b/src/Data/Array/Accelerate/Fourier/Preprocessed.hs
@@ -36,8 +36,8 @@
            SubTransformTriple(SubTransformTriple),
            Transform, PairTransform, )
 
-import qualified Data.Array.Accelerate.Arithmetic.LinearAlgebra as LinAlg
-import Data.Array.Accelerate.Arithmetic.LinearAlgebra (zipExtrudedVectorWith, )
+import qualified Data.Array.Accelerate.LinearAlgebra as LinAlg
+import Data.Array.Accelerate.LinearAlgebra (zipExtrudedVectorWith, )
 import Data.Array.Accelerate.Data.Complex (Complex, )
 
 import qualified Data.Array.Accelerate.Utility.Sliced as Sliced
diff --git a/src/Data/Array/Accelerate/Fourier/Private.hs b/src/Data/Array/Accelerate/Fourier/Private.hs
--- a/src/Data/Array/Accelerate/Fourier/Private.hs
+++ b/src/Data/Array/Accelerate/Fourier/Private.hs
@@ -10,8 +10,8 @@
 import qualified Data.Array.Accelerate.Utility.Sliced as Sliced
 import qualified Data.Array.Accelerate.Utility.Sliced1 as Sliced1
 
-import qualified Data.Array.Accelerate.Arithmetic.LinearAlgebra as LinAlg
-import Data.Array.Accelerate.Arithmetic.LinearAlgebra (zipExtrudedVectorWith, )
+import qualified Data.Array.Accelerate.LinearAlgebra as LinAlg
+import Data.Array.Accelerate.LinearAlgebra (zipExtrudedVectorWith, )
 
 import qualified Data.Array.Accelerate.Utility.Lift.Exp as Exp
 import Data.Array.Accelerate.Utility.Lift.Exp (expr)
@@ -20,7 +20,7 @@
 import Data.Array.Accelerate.Data.Complex (Complex((:+)), )
 import Data.Array.Accelerate
           (Exp, Acc, Array, DIM1, DIM2, IsNum, IsFloating, Elt,
-           Z(Z), (:.)((:.)), Slice, Shape, (!), (?), (==*), (<*), )
+           Z(Z), (:.)((:.)), Slice, Shape, (!), (?), (==*), (>*), )
 
 
 type Transform sh a = Acc (Array sh a) -> Acc (Array sh a)
@@ -427,5 +427,5 @@
    A.generate (A.index1 padLen) $
    \ix ->
       let k = A.unindex1 ix
-          sk = A.fromIntegral (2*k <* padLen ? (k, k-padLen))
+          sk = A.fromIntegral (padLen >* 2*k ? (k, k-padLen))
       in  Sign.cis sign (pi*sk*sk/lenFloat)
diff --git a/src/Data/Array/Accelerate/Fourier/Real.hs b/src/Data/Array/Accelerate/Fourier/Real.hs
--- a/src/Data/Array/Accelerate/Fourier/Real.hs
+++ b/src/Data/Array/Accelerate/Fourier/Real.hs
@@ -28,7 +28,7 @@
 import qualified Data.Array.Accelerate.Utility.Lift.Exp as Exp
 import Data.Array.Accelerate.Utility.Lift.Exp (expr)
 
-import Data.Array.Accelerate.Arithmetic.LinearAlgebra (zipExtrudedVectorWith, )
+import Data.Array.Accelerate.LinearAlgebra (zipExtrudedVectorWith, )
 
 import qualified Data.Array.Accelerate.Data.Complex as Complex
 import Data.Array.Accelerate.Data.Complex (Complex((:+)), )
diff --git a/src/Data/Array/Accelerate/Permutation.hs b/src/Data/Array/Accelerate/Permutation.hs
--- a/src/Data/Array/Accelerate/Permutation.hs
+++ b/src/Data/Array/Accelerate/Permutation.hs
@@ -6,7 +6,7 @@
 module Data.Array.Accelerate.Permutation where
 
 import qualified Data.Array.Accelerate.NumberTheory as NumberTheory
-import qualified Data.Array.Accelerate.Arithmetic.LinearAlgebra as LinAlg
+import qualified Data.Array.Accelerate.LinearAlgebra as LinAlg
 
 import qualified Data.Array.Accelerate.Utility.Lift.Exp as Exp
 import Data.Array.Accelerate.Utility.Lift.Exp (expr)
diff --git a/test/Test/Data/Array/Accelerate/Fourier.hs b/test/Test/Data/Array/Accelerate/Fourier.hs
--- a/test/Test/Data/Array/Accelerate/Fourier.hs
+++ b/test/Test/Data/Array/Accelerate/Fourier.hs
@@ -17,7 +17,7 @@
           (Acc, Exp, Array, DIM1, DIM2, DIM3, Z(Z), (:.)((:.)),
            (<=*), (==*),(&&*), )
 
-import qualified Data.Array.Accelerate.Arithmetic.LinearAlgebra as LinAlg
+import qualified Data.Array.Accelerate.LinearAlgebra as LinAlg
 import qualified Data.Array.Accelerate.Utility.Sliced as Sliced
 import qualified Data.Array.Accelerate.Utility.Lift.Acc as Acc
 import qualified Data.Array.Accelerate.Utility.Lift.Exp as Exp