diff --git a/src/Copar/Algorithm/Split.hs b/src/Copar/Algorithm/Split.hs
index 8a4f20944bea6f87112cabb2390adeee8a5ebfd5..b4d4ce277dd628e1015cd0bb8e676d96f984fb21 100644
--- a/src/Copar/Algorithm/Split.hs
+++ b/src/Copar/Algorithm/Split.hs
@@ -74,7 +74,7 @@ updateBlock b v0 = ask >>= \(as, _) -> lift $ do
     !pc <- (fromEdgeRef . head <$> VM.read (toSub as) x)
             >>= VM.read (lastW as)
 
-    labelsToS <- VM.read (toSub as) x >>= (mapM $ \e -> do
+    labelsToS <- VM.read (toSub as) x >>= mapM (\e -> do
       let Edge _ !lab _ = graph (encoding as) e
       return $! lab)
 
@@ -109,7 +109,7 @@ splitBlock b = ask >>= \(as, _) -> lift $ do
 
   -- We can use unsafeStatesOfBlock here, since the resulting vector is
   -- immediatly consumed and not referenced afterwards.
-  !pmc <- (possibleMajorityCandidateBy' unsafeF3) <$>
+  !pmc <- possibleMajorityCandidateBy' unsafeF3 <$>
           Partition.unsafeStatesOfBlock (partition as) b1
 
   -- the pmc occurs in b1, so b1' has to be non-empty
@@ -162,7 +162,7 @@ collectTouchedBlocks blockS = do
 
     sizeOfB <- Partition.blockSize (partition as) b
 
-    when (sizeOfB == 1) $ do
+    when (sizeOfB == 1) $
       -- We found an edge with an outgoing block that has only one state.
       modifySTRef' (size1Count as) (+1)