diff --git a/Data/Heap.hs b/Data/Heap.hs
--- a/Data/Heap.hs
+++ b/Data/Heap.hs
@@ -81,6 +81,7 @@
 	foldMap f (Tree _ x l r) = foldMap f l `mappend` f x `mappend` foldMap f r
 
 instance (HeapPolicy p a, Read a) => Read (Heap p a) where
+#ifndef __HADDOCK__
 #ifdef __GLASGOW_HASKELL__
 	readPrec = parens $ prec 10 $ do
 		Ident "fromList" <- lexP
@@ -92,6 +93,7 @@
 		("fromList", s) <- lex r
 		(xs, t) <- reads s
 		return (fromList xs, t)
+#endif
 #endif
 
 -- |
diff --git a/heap.cabal b/heap.cabal
--- a/heap.cabal
+++ b/heap.cabal
@@ -1,5 +1,5 @@
 Name:          heap
-Version:       0.2
+Version:       0.2.1
 Stability:     beta
 Category:      Data
 Synopsis:      Heaps in Haskell