diff --git a/CaseBi.hs b/CaseBi.hs
--- a/CaseBi.hs
+++ b/CaseBi.hs
@@ -69,7 +69,7 @@
      then getBFst' (def, (V.unsafeSlice 0 (V.length vec `quot` 2) vec)) l 
      else getBFst' (def, (V.unsafeSlice (V.length vec `quot` 2) (V.length vec - (V.length vec `quot` 2)) vec)) l 
  | otherwise = snd (V.unsafeIndex vec 0)
-{-# INLINE getBFst' #-}
+{-# NOINLINE getBFst' #-}
                    
 -- | The function that uses special realization of the binary search to effectively transform the 'V.Vector' @a@ to 'V.Vector' @b@ instead of simply use 
 --
@@ -138,7 +138,7 @@
 sortFst :: (Ord a) => [(a, b)] -> [(a, b)]
 sortFst xs = if null xs then [] else sortFst (filter (\(x, _) -> compare x (fst (head xs)) == LT) xs) ++ filter (\(x, _) -> x == (fst (head xs))) xs ++ 
   sortFst (filter (\(x, _) -> compare x (fst (head xs)) == GT) xs)
-{-# INLINE sortFst #-}           
+{-# NOINLINE sortFst #-}           
 
 -- | Function that prepares the list of @(a, b)@ tuples representing the 
 --
diff --git a/CaseBi/Unboxed.hs b/CaseBi/Unboxed.hs
--- a/CaseBi/Unboxed.hs
+++ b/CaseBi/Unboxed.hs
@@ -41,7 +41,7 @@
   then getBFst' (def, (V.unsafeSlice 0 (V.length vec `quot` 2) vec)) l 
   else getBFst' (def, (V.unsafeSlice (V.length vec `quot` 2) (V.length vec - (V.length vec `quot` 2)) vec)) l 
                       | otherwise = snd (V.unsafeIndex vec 0)
-{-# INLINE getBFst' #-}
+{-# NOINLINE getBFst' #-}
                    
 -- | A variant of the 'CaseBi.getBFstV' that operates on the unboxed 'V.Vector'.
 -- 
@@ -65,7 +65,7 @@
 sortFst :: (Ord a, Unbox a, Unbox b) => [(a, b)] -> [(a, b)]
 sortFst xs = if null xs then [] else sortFst (filter (\(x, _) -> compare x (fst (head xs)) == LT) xs) ++ filter (\(x, _) -> x == (fst (head xs))) xs ++ 
   sortFst (filter (\(x, _) -> compare x (fst (head xs)) == GT) xs)
-{-# INLINE sortFst #-}           
+{-# NOINLINE sortFst #-}           
 
 -- | A variant of the 'CaseBi.sortFstV' that operates on the unboxed 'V.Vector'.
 --
diff --git a/ChangeLog.md b/ChangeLog.md
--- a/ChangeLog.md
+++ b/ChangeLog.md
@@ -40,3 +40,7 @@
 
 * Second version. Added a new module CaseBi.Unboxed with functions that operate on the unboxed vectors.
 
+## 0.3.0.0 -- 2020-10-29
+
+* Third version. Changed inlining policies so that ghc -ddump-lint does not produce warnings. 
+
diff --git a/mmsyn2.cabal b/mmsyn2.cabal
--- a/mmsyn2.cabal
+++ b/mmsyn2.cabal
@@ -2,7 +2,7 @@
 -- see http://haskell.org/cabal/users-guide/
 
 name:                mmsyn2
-version:             0.2.0.0
+version:             0.3.0.0
 synopsis:            The library that can be used for multiple (Ord a) => a -> b transformations
 description:         The library that can be used for optimization or another representation of multiple (Ord a) => a -> b transformations
 homepage:            https://oleksandrzhabenko.github.io/mmsyn2