diff --git a/ChangeLog b/ChangeLog
--- a/ChangeLog
+++ b/ChangeLog
@@ -1,2 +1,3 @@
+0.9.2: Fixed some very small errors
 0.9.1: Fixed some typos in the docs
 0.9: Initial version
diff --git a/Data/TASequence/BinaryTree.hs b/Data/TASequence/BinaryTree.hs
--- a/Data/TASequence/BinaryTree.hs
+++ b/Data/TASequence/BinaryTree.hs
@@ -15,9 +15,9 @@
 -- elements and then nodes are '><'.
 --
 -----------------------------------------------------------------------------
-module Data.TASequence.BinaryTree(module Data.TASequence.Class, BinaryTree) where
+module Data.TASequence.BinaryTree(module Data.TASequence, BinaryTree) where
 
-import  Data.TASequence.Class
+import  Data.TASequence
 
 data BinaryTree c x y where
   Empty :: BinaryTree c x x
diff --git a/Data/TASequence/Class.hs b/Data/TASequence/Class.hs
--- a/Data/TASequence/Class.hs
+++ b/Data/TASequence/Class.hs
@@ -4,7 +4,7 @@
 
 -----------------------------------------------------------------------------
 -- |
--- Module      :  Data.TASequence.Class
+-- Module      :  Data.TASequence
 -- Copyright   :  (c) Atze van der Ploeg 2014
 -- License     :  BSD-style
 -- Maintainer  :  atzeus@gmail.org
@@ -37,7 +37,7 @@
 -- Paper: <http://homepages.cwi.nl/~ploeg/zseq.pdf>
 -- Talk : <http://www.youtube.com/watch?v=_XoI65Rxmss>
 -----------------------------------------------------------------------------
-module Data.TASequence.Class(TASequence(..), TAViewL(..), TAViewR(..)) where
+module Data.TASequence(TASequence(..), TAViewL(..), TAViewR(..)) where
 
 import Control.Category
 import Prelude hiding ((.),id)
diff --git a/Data/TASequence/ConsList.hs b/Data/TASequence/ConsList.hs
--- a/Data/TASequence/ConsList.hs
+++ b/Data/TASequence/ConsList.hs
@@ -14,8 +14,8 @@
 -- A type aligned sequence, a head-tail list, with worst case constant time: '<|', and 'tviewl'.
 --
 -----------------------------------------------------------------------------
-module Data.TASequence.ConsList(module Data.TASequence.Class,ConsList(..)) where
-import Data.TASequence.Class
+module Data.TASequence.ConsList(module Data.TASequence,ConsList(..)) where
+import Data.TASequence
 
 data ConsList c x y where
   CNil :: ConsList c x x
diff --git a/Data/TASequence/FastCatQueue.hs b/Data/TASequence/FastCatQueue.hs
--- a/Data/TASequence/FastCatQueue.hs
+++ b/Data/TASequence/FastCatQueue.hs
@@ -12,9 +12,9 @@
 -- A type aligned sequence, a catanable queue, with worst case constant time: '><', '|>', '<|' and 'tviewl'.
 --
 -----------------------------------------------------------------------------
-module Data.TASequence.FastCatQueue(module Data.TASequence.Class, FastTCQueue) where
+module Data.TASequence.FastCatQueue(module Data.TASequence, FastTCQueue) where
 
-import Data.TASequence.Class
+import Data.TASequence
 import Data.TASequence.FastQueue
 import Data.TASequence.ToCatQueue
 
diff --git a/Data/TASequence/FastQueue.hs b/Data/TASequence/FastQueue.hs
--- a/Data/TASequence/FastQueue.hs
+++ b/Data/TASequence/FastQueue.hs
@@ -17,9 +17,9 @@
 --
 -----------------------------------------------------------------------------
 
-module Data.TASequence.FastQueue(FastQueue) where
+module Data.TASequence.FastQueue(module Data.TASequence, FastQueue) where
 
-import Data.TASequence.Class
+import Data.TASequence
 import Data.TASequence.ConsList
 import Data.TASequence.SnocList
 
diff --git a/Data/TASequence/FingerTree.hs b/Data/TASequence/FingerTree.hs
--- a/Data/TASequence/FingerTree.hs
+++ b/Data/TASequence/FingerTree.hs
@@ -19,11 +19,11 @@
 --   Ralf Hinze and Ross Paterson. in Journal of Functional Programming16:2 (2006), pages 197-217.
 --
 -----------------------------------------------------------------------------
-module Data.TASequence.FingerTree (module Data.TASequence.Class, FingerTree ) where
+module Data.TASequence.FingerTree (module Data.TASequence, FingerTree ) where
 
 
 
-import Data.TASequence.Class
+import Data.TASequence
 
 
 data FingerTree r a b where
diff --git a/Data/TASequence/Queue.hs b/Data/TASequence/Queue.hs
--- a/Data/TASequence/Queue.hs
+++ b/Data/TASequence/Queue.hs
@@ -19,9 +19,9 @@
 -- section 8.4: Queues based on implicit recursive slowdown
 --
 -----------------------------------------------------------------------------
-module Data.TASequence.Queue(module Data.TASequence.Class,Queue)  where
+module Data.TASequence.Queue(module Data.TASequence,Queue)  where
 
-import Data.TASequence.Class
+import Data.TASequence
 
 data P c a b where
   (:*) :: c a w -> c w b -> P c a b
diff --git a/Data/TASequence/SnocList.hs b/Data/TASequence/SnocList.hs
--- a/Data/TASequence/SnocList.hs
+++ b/Data/TASequence/SnocList.hs
@@ -14,9 +14,9 @@
 --
 -----------------------------------------------------------------------------
 
-module Data.TASequence.SnocList(module Data.TASequence.Class,SnocList(..))  where
+module Data.TASequence.SnocList(module Data.TASequence,SnocList(..))  where
 
-import Data.TASequence.Class
+import Data.TASequence
 
 data SnocList c x y where
   SNil :: SnocList c x x
diff --git a/Data/TASequence/ToCatQueue.hs b/Data/TASequence/ToCatQueue.hs
--- a/Data/TASequence/ToCatQueue.hs
+++ b/Data/TASequence/ToCatQueue.hs
@@ -19,10 +19,10 @@
 --
 -----------------------------------------------------------------------------
 
-module Data.TASequence.ToCatQueue(ToCatQueue) where
+module Data.TASequence.ToCatQueue(module Data.TASequence,ToCatQueue) where
 
 
-import Data.TASequence.Class
+import Data.TASequence
 
 -- | The catenable queue type. The first type argument is the 
 -- type of the queue we use (|>)
diff --git a/type-aligned.cabal b/type-aligned.cabal
--- a/type-aligned.cabal
+++ b/type-aligned.cabal
@@ -1,5 +1,5 @@
 Name:                type-aligned
-Version:             0.9.1
+Version:             0.9.2
 Synopsis:	         Various type-aligned sequence data structures.
 Description:         Various data structures for type aligned sequences: heterogeneous sequences where the types enforce the element order.
 License:             BSD3