diff --git a/Text/Regex/PDeriv/ByteString/LeftToRightD.lhs b/Text/Regex/PDeriv/ByteString/LeftToRightD.lhs
--- a/Text/Regex/PDeriv/ByteString/LeftToRightD.lhs
+++ b/Text/Regex/PDeriv/ByteString/LeftToRightD.lhs
@@ -131,9 +131,9 @@
 
 > type NFAStates = [ Int ]
 
-> type DPat0Table = IM.IntMap ( Int       -- ^ the next DFA state
->                             , NFAStates -- ^ the next NFA states
->                             , IM.IntMap [Int -> Binder -> Binder] -- ^ the transition function : position -> current_binders -> next_binders
+> type DPat0Table = IM.IntMap ( Int       -- the next DFA state
+>                             , NFAStates -- the next NFA states
+>                             , IM.IntMap [Int -> Binder -> Binder] -- the transition function : position -> current_binders -> next_binders
 >                             ) -- deterministic: one output state and one update function
 
 > buildDPat0Table :: Pat -> (DPat0Table, [Int])
diff --git a/regex-pderiv.cabal b/regex-pderiv.cabal
--- a/regex-pderiv.cabal
+++ b/regex-pderiv.cabal
@@ -1,5 +1,5 @@
 Name:                   regex-pderiv
-Version:                0.0.8
+Version:                0.0.8.1
 License:                BSD3
 License-File:           LICENSE
 Copyright:              Copyright (c) 2010, Kenny Zhuo Ming Lu and Martin Sulzmann