diff --git a/README.rst b/README.rst
index fab1b16..d228806 100644
--- a/README.rst
+++ b/README.rst
@@ -238,11 +238,11 @@ Syntax Reference
 
 ``b"some literal"``     A bytes literal. Using bytes literals and regular
                         expressions allows your grammar to parse binary files.
-						Note that all literals and regular expressions must be
-						of the same type within a grammar. In grammars that
-						process bytestrings, you should make the grammar string
-						an ``r"""string"""`` so that byte literals like ``\xff``
-						work correctly.
+                        Note that all literals and regular expressions must be
+                        of the same type within a grammar. In grammars that
+                        process bytestrings, you should make the grammar string
+                        an ``r"""string"""`` so that byte literals like ``\xff``
+                        work correctly.
 
 [space]                 Sequences are made out of space- or tab-delimited
                         things. ``a b c`` matches spots where those 3
@@ -441,8 +441,11 @@ Niceties
 
 Version History
 ===============
-
 (Next release)
+  * ...
+
+0.10.0
+  * Fix infinite recursion in __eq__ in some cases. (FelisNivalis)
   * Improve error message in left-recursive rules. (lucaswiman)
   * Add support for range ``{min,max}`` repetition expressions (righthandabacus)
   * Fix bug in ``*`` and ``+`` for token grammars (lucaswiman)
diff --git a/setup.py b/setup.py
index e5c84c6..b410429 100644
--- a/setup.py
+++ b/setup.py
@@ -7,9 +7,10 @@
 
 setup(
     name='parsimonious',
-    version='0.9.0',
+    version='0.10.0',
     description='(Soon to be) the fastest pure-Python PEG parser I could muster',
     long_description=long_description,
+    long_description_content_type='text/x-rst',
     author='Erik Rose',
     author_email='erikrose@grinchcentral.com',
     license='MIT',