diff --git a/src/Language/Haskell/TH/ReifyMany.hs b/src/Language/Haskell/TH/ReifyMany.hs
--- a/src/Language/Haskell/TH/ReifyMany.hs
+++ b/src/Language/Haskell/TH/ReifyMany.hs
@@ -1,4 +1,4 @@
--- | @th-transitive@ provides functions for recursively reifying top
+-- | @th-reify-many@ provides functions for recursively reifying top
 -- level declarations.  The main intended use case is for enumerating
 -- the names of datatypes reachable from an initial datatype, and
 -- passing these names to some function which generates instances.
@@ -69,7 +69,7 @@
     infos <- reifyManyTyCons recurse initial
     return (map fst infos)
 
--- | Like 'reifyMany', but specialized for transitively enumerating
+-- | Like 'reifyMany', but specialized for recursively enumerating
 -- type constructor declarations, omitting 'PrimTyConI'.
 --
 -- In order to have this behave like 'reifyManyWithoutInstances', but
@@ -97,7 +97,7 @@
     recurse' (name, TyConI dec) = recurse (name, dec)
     recurse' (_, PrimTyConI {}) = return (False, [])
     recurse' (_, info) = do
-        report True $ "Unexpected info type in getTyConsTransitively: " ++ show info
+        report True $ "Unexpected info type in reifyManyTyCons: " ++ show info
         return (False, [])
 
 -- | Starting from a set of initial top level declarations, specified
@@ -150,6 +150,6 @@
                 State.when (not (null filtered)) $ reportError (show filtered)
                 return (isDataDec dec, concatMap typeConcreteNames filtered)
         recurse _ = return (False, [])
-    infos <- getTyConsTransitively recurse initial
+    infos <- reifyManyTyCons recurse initial
     return (map fst infos)
 -}
diff --git a/th-reify-many.cabal b/th-reify-many.cabal
--- a/th-reify-many.cabal
+++ b/th-reify-many.cabal
@@ -1,8 +1,8 @@
 name:              th-reify-many
-version:           0.1.1
+version:           0.1.2
 synopsis:          Recurseively reify template haskell datatype info
 
-description:       @th-transitive@ provides functions for recursively reifying top
+description:       @th-reify-many@ provides functions for recursively reifying top
                    level declarations.  The main intended use case is for enumerating
                    the names of datatypes reachable from an initial datatype, and
                    passing these names to some function which generates instances.