diff --git a/Data/Graph/Inductive/Monad.hs b/Data/Graph/Inductive/Monad.hs
index 67400ab..4622676 100644
--- a/Data/Graph/Inductive/Monad.hs
+++ b/Data/Graph/Inductive/Monad.hs
@@ -20,8 +20,6 @@ module Data.Graph.Inductive.Monad(
 
 import Data.Graph.Inductive.Graph
 
-{-# ANN module "HLint: ignore Redundant lambda" #-}
-
 ----------------------------------------------------------------------
 -- MONADIC GRAPH CLASS
 ----------------------------------------------------------------------
diff --git a/Data/Graph/Inductive/Query/Dominators.hs b/Data/Graph/Inductive/Query/Dominators.hs
index f95ad7d..1ddb11e 100644
--- a/Data/Graph/Inductive/Query/Dominators.hs
+++ b/Data/Graph/Inductive/Query/Dominators.hs
@@ -21,7 +21,6 @@ import           Data.Maybe (mapMaybe)
 import           Data.Tree                      (Tree (..))
 import qualified Data.Tree                      as T
 
-{-# ANN iDom "HLint: ignore Use ***" #-}
 -- | return immediate dominators for each reachable node of a graph, given a root
 iDom :: (Graph gr) => gr a b -> Node -> [(Node,Node)]
 iDom g root = let (result, toNode, _) = idomWork g root