diff --git a/sets.cabal b/sets.cabal
--- a/sets.cabal
+++ b/sets.cabal
@@ -1,20 +1,20 @@
 Name:                   sets
-Version:                0.0.1
+Version:                0.0.1.1
 Author:                 Athan Clark <athan.clark@gmail.com>
 Maintainer:             Athan Clark <athan.clark@gmail.com>
 License:                MIT
 License-File:           LICENSE
-Synopsis:               Various set designs in Haskell
--- Description:
+Synopsis:               Various set implementations in Haskell
+Description:            This also includes overloaded functions for common set operations. See @Data.Set.Class@.
 Cabal-Version:          >= 1.10
 Build-Type:             Simple
+Category:               Data, Math
 
 Library
   Default-Language:     Haskell2010
   HS-Source-Dirs:       src
   GHC-Options:          -Wall
   Exposed-Modules:      Data.Set.Class
-                        Data.Set.Class.Types
                         Data.Set.Unordered.Unique
                         Data.Set.Unordered.Many
                         Data.Set.Ordered.Unique
@@ -44,4 +44,4 @@
 
 Source-Repository head
   Type:                 git
-  Location:              https://github.com/athanclark/sets.git
+  Location:             https://github.com/athanclark/sets.git
diff --git a/src/Data/Set/Class.hs b/src/Data/Set/Class.hs
--- a/src/Data/Set/Class.hs
+++ b/src/Data/Set/Class.hs
@@ -13,8 +13,7 @@
 -- we don't have to use the qualified versions of each function.
 
 module Data.Set.Class
-  ( module X
-  , HasUnion (..)
+  ( HasUnion (..)
   , HasDifference (..)
   , HasIntersection (..)
   , HasComplement (..)
@@ -27,9 +26,10 @@
   , HasSize (..)
   , CanBeSubset (..)
   , CanBeProperSubset (..)
+  , Union (..)
+  , Intersection (..)
   ) where
 
-import Data.Set.Class.Types as X
 import Prelude (Eq (..), Ord, Int, Bool (..), (&&), (||), ($), (.), not, const)
 import Data.Foldable as Fold
 import Data.Monoid as Monoid
@@ -52,6 +52,9 @@
 import qualified Data.Set.Unordered.Unique as UU
 import qualified Data.Set.Ordered.Unique.Finite as OUF
 
+
+newtype Union a = Union {unUnion :: a}
+newtype Intersection a = Intersection {unIntersection :: a}
 
 class HasUnion s where
   union :: s -> s -> s
diff --git a/src/Data/Set/Class/Types.hs b/src/Data/Set/Class/Types.hs
deleted file mode 100644
--- a/src/Data/Set/Class/Types.hs
+++ /dev/null
@@ -1,12 +0,0 @@
-{-# LANGUAGE
-    GeneralizedNewtypeDeriving
-  , StandaloneDeriving
-  #-}
-
-module Data.Set.Class.Types where
-
--- | These types are used for @Monoid@ and @Commutative@ instances for sets.
-
-newtype Union a = Union {fromUnion :: a}
-
-newtype Intersection a = Intersection {fromIntersection :: a}