move GF.Devel.TC and GF.Devel.TypeCheck to GF.Compile.*

src-3.0/GF/Compile/CheckGrammar.hs

@@ -24,20 +24,19 @@
 module GF.Compile.CheckGrammar (
   showCheckModule, justCheckLTerm, allOperDependencies, topoSortOpers) where
 
-import GF.Grammar.Grammar
 import GF.Infra.Ident
 import GF.Infra.Modules
-import GF.Grammar.Refresh ----
 
-import GF.Devel.TypeCheck
+import GF.Compile.TypeCheck
-import GF.Grammar.Predef (cPredef, cPredefAbs) ---
 
+import GF.Grammar.Refresh
+import GF.Grammar.Grammar
 import GF.Grammar.PrGrammar
 import GF.Grammar.Lookup
 import GF.Grammar.LookAbs
 import GF.Grammar.Predef
 import GF.Grammar.Macros
-import GF.Grammar.ReservedWords ----
+import GF.Grammar.ReservedWords
 import GF.Grammar.PatternMatch
 import GF.Grammar.AppPredefined
 import GF.Grammar.Lockfield (isLockLabel)

src-3.0/GF/Compile/TC.hs

@@ -12,7 +12,7 @@
 -- Thierry Coquand's type checking algorithm that creates a trace
 -----------------------------------------------------------------------------
 
-module GF.Devel.TC (AExp(..),
+module GF.Compile.TC (AExp(..),
 	   Theory,
 	   checkExp,
 	   inferExp,

src-3.0/GF/Compile/TypeCheck.hs

@@ -12,7 +12,7 @@
 -- (Description of the module)
 -----------------------------------------------------------------------------
 
-module GF.Devel.TypeCheck (-- * top-level type checking functions; TC should not be called directly.
+module GF.Compile.TypeCheck (-- * top-level type checking functions; TC should not be called directly.
 		  checkContext,
 		  checkTyp,
 		  checkEquation,
@@ -26,11 +26,10 @@ import GF.Grammar.Abstract
 import GF.Grammar.Refresh
 import GF.Grammar.LookAbs
 import qualified GF.Grammar.Lookup as Lookup ---
-
-import GF.Devel.TC
-
 import GF.Grammar.Unify ---
 
+import GF.Compile.TC
+
 import Control.Monad (foldM, liftM, liftM2)
 import Data.List (nub) ---