diff --git a/ixset.cabal b/ixset.cabal
--- a/ixset.cabal
+++ b/ixset.cabal
@@ -1,5 +1,5 @@
 Name:                ixset
-Version:             1.0.1
+Version:             1.0.2
 Synopsis:            Efficient relational queries on Haskell sets. 
 Description:         
     Create and query sets that are indexed by multiple indices.
@@ -8,7 +8,7 @@
 Author:              Happstack team, HAppS LLC
 Maintainer:          Happstack team <happs@googlegroups.com>
 homepage:            http://happstack.com
-Category:            Web, Distributed Computing
+Category:            Data Structures
 Build-Type:          Simple
 Cabal-Version:       >= 1.6
 
diff --git a/src/Data/IxSet.hs b/src/Data/IxSet.hs
--- a/src/Data/IxSet.hs
+++ b/src/Data/IxSet.hs
@@ -358,11 +358,9 @@
                                                              appT (appT (conT ''Map) (conT n)) 
                                                                       (appT (conT ''Set) typeCon))) `appE` 
                                     (varE 'flattenWithCalcs `appE` varE calName)
-               in do i <- instanceD' (fullContext) 
+               in do i <- instanceD (fullContext)
                           (conT ''Indexable `appT` typeCon)
-                          [d| empty :: IxSet a
-                              empty = ixSet $(listE (map mkEntryPoint entryPoints))
-                            |]
+                          [valD (varP 'empty) (normalB [| ixSet $(listE (map mkEntryPoint entryPoints)) |]) []]
                      let ixType = appT (conT ''IxSet) typeCon
                      ixType' <- tySynD (mkName ixset) binders ixType
                      return $ [i, ixType']  -- ++ d