GaloisInc/cryptol
1
1
Fork 0
mirror of https://github.com/GaloisInc/cryptol.git synced 2024-12-17 13:01:31 +03:00
Code Issues Projects Releases Wiki Activity

Fix compiler warnings

Browse Source
This commit is contained in:
Brian Huffman 2017-03-09 10:27:20 -08:00
parent fddcd60d10
commit fd4415803a
6 changed files with 7 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/Cryptol/TypeCheck/Infer.hs
View File

@ -27,7 +27,7 @@ import Cryptol.TypeCheck.Kind(checkType,checkSchema,checkTySyn,
checkNewtype) checkNewtype)
import Cryptol.TypeCheck.Instantiate import Cryptol.TypeCheck.Instantiate
import Cryptol.TypeCheck.Depends import Cryptol.TypeCheck.Depends
import Cryptol.TypeCheck.Subst (listSubst,apSubst,fvs,(@@)) import Cryptol.TypeCheck.Subst (listSubst,apSubst,(@@))
import Cryptol.TypeCheck.Solver.InfNat(genLog) import Cryptol.TypeCheck.Solver.InfNat(genLog)
import Cryptol.Utils.Ident import Cryptol.Utils.Ident
import Cryptol.Utils.Panic(panic) import Cryptol.Utils.Panic(panic)

1
src/Cryptol/TypeCheck/InferTypes.hs
View File

@ -20,7 +20,6 @@ module Cryptol.TypeCheck.InferTypes where
import Cryptol.TypeCheck.AST import Cryptol.TypeCheck.AST
import Cryptol.TypeCheck.Subst import Cryptol.TypeCheck.Subst
import Cryptol.TypeCheck.TypeMap
import Cryptol.Parser.Position import Cryptol.Parser.Position
import qualified Cryptol.Parser.AST as P import qualified Cryptol.Parser.AST as P
import Cryptol.Utils.PP import Cryptol.Utils.PP

4
src/Cryptol/TypeCheck/Sanity.hs
View File

@ -16,11 +16,11 @@ module Cryptol.TypeCheck.Sanity
import Cryptol.TypeCheck.AST import Cryptol.TypeCheck.AST
import Cryptol.TypeCheck.Subst(apSubst, fvs, singleSubst) import Cryptol.TypeCheck.Subst (apSubst, singleSubst)
import Cryptol.Utils.Ident import Cryptol.Utils.Ident
import qualified Data.Set as Set import qualified Data.Set as Set
import Data.List(sort, sortBy) import Data.List (sort, sortBy)
import Data.Function (on) import Data.Function (on)
import MonadLib import MonadLib
import qualified Control.Applicative as A import qualified Control.Applicative as A

2
src/Cryptol/TypeCheck/SimpType.hs
View File

@ -3,7 +3,7 @@ module Cryptol.TypeCheck.SimpType where
import Control.Applicative((<|>)) import Control.Applicative((<|>))
import Cryptol.TypeCheck.Type hiding import Cryptol.TypeCheck.Type hiding
(tAdd,tSub,tMul,tDiv,tMod,tExp,tMin,tMax,tWidth,tLenFromThen,tLenFromThenTo) (tSub,tMul,tDiv,tMod,tExp,tMin,tWidth,tLenFromThen,tLenFromThenTo)
import Cryptol.TypeCheck.TypePat import Cryptol.TypeCheck.TypePat
import Cryptol.TypeCheck.Solver.InfNat import Cryptol.TypeCheck.Solver.InfNat
import Control.Monad(msum,guard) import Control.Monad(msum,guard)

2
src/Cryptol/TypeCheck/SimpleSolver.hs
View File

@ -2,7 +2,7 @@
module Cryptol.TypeCheck.SimpleSolver ( simplify , simplifyStep) where module Cryptol.TypeCheck.SimpleSolver ( simplify , simplifyStep) where
import Cryptol.TypeCheck.Type hiding import Cryptol.TypeCheck.Type hiding
( tAdd, tSub, tMul, tDiv, tMod, tExp, tMin, tMax, tWidth ( tSub, tMul, tDiv, tMod, tExp, tMin, tWidth
, tLenFromThen, tLenFromThenTo) , tLenFromThen, tLenFromThenTo)
import Cryptol.TypeCheck.Solver.Types import Cryptol.TypeCheck.Solver.Types
import Cryptol.TypeCheck.Solver.Numeric.Fin(cryIsFinType) import Cryptol.TypeCheck.Solver.Numeric.Fin(cryIsFinType)

4
src/Cryptol/TypeCheck/Solve.hs
View File

@ -21,7 +21,7 @@ import Cryptol.TypeCheck.PP(pp)
import Cryptol.TypeCheck.AST import Cryptol.TypeCheck.AST
import Cryptol.TypeCheck.Monad import Cryptol.TypeCheck.Monad
import Cryptol.TypeCheck.Subst import Cryptol.TypeCheck.Subst
(apSubst,fvs,singleSubst, isEmptySubst, substToList, (apSubst, singleSubst, isEmptySubst, substToList,
emptySubst,Subst,listSubst, (@@), Subst, emptySubst,Subst,listSubst, (@@), Subst,
apSubstMaybe, substBinds) apSubstMaybe, substBinds)
import qualified Cryptol.TypeCheck.SimpleSolver as Simplify import qualified Cryptol.TypeCheck.SimpleSolver as Simplify
@ -358,7 +358,7 @@ computeImprovements s gs =
Right ints <- Num.getIntervals s Right ints <- Num.getIntervals s
return (Just (ints,su)) return (Just (ints,su))
case res of case res of
Just (ints,su) -> return (Right su) -- ? Just (_ints, su) -> return (Right su) -- ?
{- {-
| isEmptySubst su | isEmptySubst su
, (x,t) : _ <- mapMaybe (improveByDefn ints) gs -> , (x,t) : _ <- mapMaybe (improveByDefn ints) gs ->