diff --git a/Data/Compression/Huffman.hs b/Data/Compression/Huffman.hs
--- a/Data/Compression/Huffman.hs
+++ b/Data/Compression/Huffman.hs
@@ -12,7 +12,7 @@
 import Data.List (intercalate)
 import Control.Arrow (first,second)
 import qualified Data.PriorityQueue.FingerTree as PQ
-import Data.Sequence as S
+import Data.Sequence as S hiding (Empty)
 
 data Bit = Zero | One
 
diff --git a/huffman.cabal b/huffman.cabal
--- a/huffman.cabal
+++ b/huffman.cabal
@@ -1,7 +1,8 @@
+Cabal-Version:   3.0
 Name:		huffman
-Version:	1.0.1
+Version:	1.0.2
 License-File:	LICENSE
-License:	BSD3
+License:	BSD-2-Clause
 Author:		Maxime Henrion
 Copyright:	2010, Maxime Henrion
 Maintainer:	Maxime Henrion <mhenrion@gmail.com>
@@ -9,14 +10,13 @@
 Category:	Data, Compression
 Synopsis:	Pure Haskell implementation of the Huffman encoding algorithm
 Description:
-	A simple and pure Haskell implementation of the Huffman encoding
-	algorithm.
-	.
-	The @huffman@ function provides the original O(n log n) algorithm
-	implemented with a priority queue.  If the input symbols are sorted
-	by probability, the O(n) @huffmanSorted@ function can be used instead.
+  A simple and pure Haskell implementation of the Huffman encoding
+  algorithm.
+  .
+  The @huffman@ function provides the original O(n log n) algorithm
+  implemented with a priority queue.  If the input symbols are sorted
+  by probability, the O(n) @huffmanSorted@ function can be used instead.
 Build-Type:	Simple
-Cabal-Version:	>= 1.6
 Tested-with:	GHC ==6.12
 
 Source-Repository head
@@ -24,6 +24,7 @@
   Location:		http://bitbucket.org/mux/huffman/
 
 Library
+  Default-Language:     Haskell2010
   Build-Depends:	base >= 3 && < 5, containers, fingertree
   Exposed-Modules:	Data.Compression.Huffman
   GHC-Options:		-Wall -O2 -funbox-strict-fields