diff --git a/README.md b/README.md
--- a/README.md
+++ b/README.md
@@ -19,3 +19,7 @@
 position and a bearing. Given two paths you can find their intersection using a fast
 iterative algorithm.
 
+Release Notes
+-------------
+
+Verison 0.0.2: Tided up cabal file and removed spurious dependency on Parsec.
diff --git a/geodetics.cabal b/geodetics.cabal
--- a/geodetics.cabal
+++ b/geodetics.cabal
@@ -1,5 +1,5 @@
 name:           geodetics
-version:        0.0.1
+version:        0.0.2
 cabal-version:  >= 1.10
 build-type:     Simple
 author:         Paul Johnson <paul@cogito.org.uk>
@@ -32,8 +32,7 @@
   build-depends:   
                    base >= 4.6 && < 4.7,
                    dimensional == 0.13.*,
-                   array >= 0.4,
-                   parsec >=3.1.3 && <3.2
+                   array >= 0.4
   ghc-options:     -Wall
   exposed-modules: 
                    Geodetics.Altitude,
@@ -66,12 +65,5 @@
   ghc-options:     -Wall -rtsopts
   other-modules:   
                    ArbitraryInstances,
-                   Main,
-                   Geodetics.Geodetic,
-                   Geodetics.Altitude,
-                   Geodetics.Grid,
-                   Geodetics.TransverseMercator,
-                   Geodetics.Path,
-                   Geodetics.Stereographic,
-                   Geodetics.LatLongParser
+                   Main
   Default-Language: Haskell2010