diff --git a/src/Language/Haskell/TypeTree.hs b/src/Language/Haskell/TypeTree.hs
--- a/src/Language/Haskell/TypeTree.hs
+++ b/src/Language/Haskell/TypeTree.hs
@@ -143,9 +143,8 @@
 
 -- | Build a "type tree" of the given datatype.
 --
--- Concrete types will appear in the tree as 'ConL'. Unbound variables
--- will appear as 'VarL'. If the datastructure is recursive, occurrences
--- of the node after the first will be wrapped in 'Recursive'.
+-- Occurrences of a given node after the first will be wrapped in
+-- 'Recursive' and have no children.
 ttReify :: IsDatatype t => t -> Q (Tree Leaf)
 ttReify = ttReifyOpts defaultOpts
 
diff --git a/type-tree.cabal b/type-tree.cabal
--- a/type-tree.cabal
+++ b/type-tree.cabal
@@ -1,5 +1,5 @@
 name:               type-tree
-version:            0.1.0.0
+version:            0.1.0.1
 synopsis:           Tree representations of datatypes
 description:        @type-tree@ provides TH splices for generating tree representations of
                     the types contained in datatypes. This is useful for, for example,
@@ -17,6 +17,10 @@
 
 custom-setup
   setup-depends: base == 4.*, Cabal, cabal-doctest >= 1 && < 1.1
+
+source-repository head
+  type:     git
+  location: https://github.com/pikajude/type-tree.git
 
 library
   exposed-modules:    Language.Haskell.TypeTree