Move existing implementation to Compat modules

Author: thomashoneyman

src/Control/Comonad/Cofree/Class.purs renamed to src/Control/Comonad/Cofree/Class/Compat.purs

@@ -1,12 +1,12 @@
-module Control.Comonad.Cofree.Class
+module Control.Comonad.Cofree.Class.Compat
   ( class ComonadCofree
   , unwrapCofree
   ) where
 
 import Prelude
 
 import Control.Comonad (class Comonad)
-import Control.Comonad.Cofree (Cofree, tail)
+import Control.Comonad.Cofree.Compat (Cofree, tail)
 import Control.Comonad.Env.Trans (EnvT(..))
 import Control.Comonad.Store.Trans (StoreT(..))
 import Control.Comonad.Traced.Trans (TracedT(..))

src/Control/Comonad/Cofree.purs renamed to src/Control/Comonad/Cofree/Compat.purs

@@ -1,6 +1,6 @@
 -- | The _cofree comonad_ for a `Functor`.
 
-module Control.Comonad.Cofree
+module Control.Comonad.Cofree.Compat
   ( Cofree
   , deferCofree
   , mkCofree, (:<)
@@ -18,7 +18,7 @@ import Control.Alternative (class Alternative, (<|>), empty)
 import Control.Comonad (class Comonad, extract)
 import Control.Extend (class Extend)
 import Control.Lazy as Z
-import Control.Monad.Free (Free, runFreeM)
+import Control.Monad.Free.Compat (Free, runFreeM)
 import Control.Monad.Rec.Class (class MonadRec)
 import Control.Monad.State (State, StateT(..), runState, runStateT, state)
 import Data.Eq (class Eq1, eq1)

src/Control/Monad/Free/Class.purs renamed to src/Control/Monad/Free/Class/Compat.purs

@@ -1,12 +1,12 @@
-module Control.Monad.Free.Class
+module Control.Monad.Free.Class.Compat
   ( class MonadFree
   , wrapFree
   ) where
 
 import Prelude
 
 import Control.Monad.Except.Trans (ExceptT(..), runExceptT)
-import Control.Monad.Free (Free, liftF)
+import Control.Monad.Free.Compat (Free, liftF)
 import Control.Monad.Maybe.Trans (MaybeT(..), runMaybeT)
 import Control.Monad.Reader.Trans (ReaderT(..), runReaderT)
 import Control.Monad.State.Trans (StateT(..), runStateT)

src/Control/Monad/Free.purs renamed to src/Control/Monad/Free/Compat.purs

@@ -1,4 +1,4 @@
-module Control.Monad.Free
+module Control.Monad.Free.Compat
   ( Free
   , suspendF
   , wrap
@@ -17,7 +17,6 @@ import Prelude
 import Control.Apply (lift2)
 import Control.Monad.Rec.Class (class MonadRec, Step(..), tailRecM)
 import Control.Monad.Trans.Class (class MonadTrans)
-
 import Data.CatList (CatList, empty, snoc, uncons)
 import Data.Either (Either(..))
 import Data.Eq (class Eq1, eq1)
@@ -26,7 +25,6 @@ import Data.Maybe (Maybe(..))
 import Data.Ord (class Ord1, compare1)
 import Data.Traversable (class Traversable, traverse)
 import Data.Tuple (Tuple(..))
-
 import Unsafe.Coerce (unsafeCoerce)
 
 -- | The free monad for a type constructor `f`.
@@ -117,7 +115,7 @@ instance semigroupFree :: Semigroup a => Semigroup (Free f a) where
 
 instance monoidFree :: Monoid a => Monoid (Free f a) where
   mempty = pure mempty
-  
+
 -- | Lift an impure value described by the generating type constructor `f` into
 -- | the free monad.
 liftF :: forall f. f ~> Free f

src/Control/Monad/Trampoline.purs renamed to src/Control/Monad/Trampoline/Compat.purs

@@ -2,7 +2,7 @@
 -- | a monad transformer stack to avoid stack overflows in large
 -- | monadic computations.
 
-module Control.Monad.Trampoline
+module Control.Monad.Trampoline.Compat
   ( Trampoline
   , done
   , delay
@@ -11,8 +11,7 @@ module Control.Monad.Trampoline
 
 import Prelude
 
-import Control.Monad.Free (Free, liftF, runFree)
-
+import Control.Monad.Free.Compat (Free, liftF, runFree)
 
 -- | The `Trampoline` monad
 -- |