diff --git a/Data/BffMono/Utility.hs b/Data/BffMono/Utility.hs
--- a/Data/BffMono/Utility.hs
+++ b/Data/BffMono/Utility.hs
@@ -1,3 +1,4 @@
+{-# OPTIONS_GHC -cpp #-}
 {-|
   The module provides counterparts of @..By@ functions in "Data.List"
   for monadic observations. 
@@ -6,8 +7,10 @@
     ( 
      ifM, nubByM, deleteByM, deleteFirstByM, unionByM, 
      intersectByM, elemByM, groupByM, 
-     sortByM, insertByM, maximumByM, minimumByM, 
-     traceM 
+#if __GLASGOW_HASKELL__ < 708
+     traceM, 
+#endif
+     sortByM, insertByM, maximumByM, minimumByM
      ) where 
 
 
@@ -17,8 +20,10 @@
 ifM :: Monad m => m Bool -> m a -> m a -> m a 
 ifM m x y = m >>= (\b -> if b then x else y)
 
+#if __GLASGOW_HASKELL__  < 708 
 traceM :: Monad m => m String -> m a -> m a 
 traceM m y = do { x <- m; trace x y }
+#endif 
 
 nubByM :: Monad m => (a -> a -> m Bool) -> [a] -> m [a]
 nubByM eq = f 
diff --git a/bff-mono.cabal b/bff-mono.cabal
--- a/bff-mono.cabal
+++ b/bff-mono.cabal
@@ -1,5 +1,5 @@
 name:                bff-mono
-version:             0.2.2
+version:             0.2.3
 synopsis:            "Bidirectionalization for Free" for Monomorphic Transformations
 description:         This package provides a way to make a bidirectional 
                      transformation (a getter/setter pair, or so-called lens)