diff --git a/ChangeLog b/ChangeLog
--- a/ChangeLog
+++ b/ChangeLog
@@ -1,1 +1,2 @@
+0.9.1: Fixed some typos in the docs
 0.9: Initial version
diff --git a/Data/TASequence/Class.hs b/Data/TASequence/Class.hs
--- a/Data/TASequence/Class.hs
+++ b/Data/TASequence/Class.hs
@@ -28,7 +28,7 @@
 -- the last element has type (c y b), for some y.
 --
 -- The simplest type aligned sequence data structure is a list, see "Data.TASequence.ConsList". The other modules
--- give various other type aligned sequence data structures.
+-- give various other type aligned sequence data structures. The data structure "Data.TASequence.FastCatQueue" supports the most operations in worst case constant time.
 --
 --
 -- See the paper Reflection without Remorse: Revealing a hidden sequence to speed up Monadic Reflection, Atze van der Ploeg and Oleg Kiselyov, Haskell Symposium 2014
diff --git a/Data/TASequence/FastQueue.hs b/Data/TASequence/FastQueue.hs
--- a/Data/TASequence/FastQueue.hs
+++ b/Data/TASequence/FastQueue.hs
@@ -17,7 +17,7 @@
 --
 -----------------------------------------------------------------------------
 
-module Data.TASequence.FastQueue where
+module Data.TASequence.FastQueue(FastQueue) where
 
 import Data.TASequence.Class
 import Data.TASequence.ConsList
diff --git a/Data/TASequence/FingerTree.hs b/Data/TASequence/FingerTree.hs
--- a/Data/TASequence/FingerTree.hs
+++ b/Data/TASequence/FingerTree.hs
@@ -13,7 +13,7 @@
 -- Stability   :  provisional
 -- Portability :  portable
 --
--- A type aligned sequence, a catanable deque, with amortized /O(log n)/ case constant time: '><','<|',|>', 'tviewl' and 'tviewr'.
+-- A type aligned sequence, a catanable deque, with amortized /O(log n)/  constant time: '><','<|','|>', 'tviewl' and 'tviewr'.
 --
 -- Based on:  "Finger trees: a simple general-purpose data structure"
 --   Ralf Hinze and Ross Paterson. in Journal of Functional Programming16:2 (2006), pages 197-217.
diff --git a/Data/TASequence/Queue.hs b/Data/TASequence/Queue.hs
--- a/Data/TASequence/Queue.hs
+++ b/Data/TASequence/Queue.hs
@@ -11,7 +11,7 @@
 -- Stability   :  provisional
 -- Portability :  portable
 --
--- A type aligned sequence, a queue, with amortized case constant time: '|>', and 'tviewl'.
+-- A type aligned sequence, a queue, with amortized constant time: '|>', and 'tviewl'.
 --
 -- A simplified version of Okasaki's implicit recursive
 -- slowdown queues. 
diff --git a/Data/TASequence/ToCatQueue.hs b/Data/TASequence/ToCatQueue.hs
--- a/Data/TASequence/ToCatQueue.hs
+++ b/Data/TASequence/ToCatQueue.hs
@@ -13,7 +13,7 @@
 --
 -- A purely functional catenable queue representation with
 -- that turns takes a purely functional queue and turns in it into
--- a catenable queue, i.e. with the same complexity for (><) as for (|>)
+-- a catenable queue, i.e. with the same complexity for '><' as for '|>'
 -- Based on Purely functional data structures by Chris Okasaki 
 -- section 7.2: Catenable lists
 --
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
+Version:             0.9.1
 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