cryptol-3.3.0: src/Cryptol/TypeCheck/Infer.hs
-- |
-- Module : Cryptol.TypeCheck.Infer
-- Copyright : (c) 2013-2016 Galois, Inc.
-- License : BSD3
-- Maintainer : cryptol@galois.com
-- Stability : provisional
-- Portability : portable
--
-- Assumes that the `NoPat` pass has been run.
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE PatternGuards #-}
{-# LANGUAGE RecursiveDo #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE BlockArguments #-}
-- See Note [-Wincomplete-uni-patterns and irrefutable patterns] in Cryptol.TypeCheck.TypePat
{-# OPTIONS_GHC -Wno-incomplete-uni-patterns #-}
{-# OPTIONS_GHC -Wno-unrecognised-pragmas #-}
{-# HLINT ignore "Redundant <$>" #-}
{-# HLINT ignore "Redundant <&>" #-}
module Cryptol.TypeCheck.Infer
( checkE
, checkSigB
, inferTopModule
, inferBinds
, checkTopDecls
)
where
import Data.Text(Text)
import qualified Data.Text as Text
import Cryptol.ModuleSystem.Name (lookupPrimDecl,nameLoc, nameIdent)
import Cryptol.Parser.Position
import qualified Cryptol.Parser.AST as P
import qualified Cryptol.ModuleSystem.Exports as P
import Cryptol.TypeCheck.AST hiding (tSub,tMul,tExp)
import Cryptol.TypeCheck.Monad
import Cryptol.TypeCheck.Error
import Cryptol.TypeCheck.Solve
import Cryptol.TypeCheck.SimpType(tMul)
import Cryptol.TypeCheck.Kind(checkType,checkSchema,checkTySyn,
checkPropSyn,checkNewtype,checkEnum,
checkParameterType,
checkPrimType,
checkParameterConstraints,
checkPropGuards)
import Cryptol.TypeCheck.Instantiate
import Cryptol.TypeCheck.Subst (listSubst,apSubst,(@@),isEmptySubst)
import Cryptol.TypeCheck.Unify(rootPath)
import Cryptol.TypeCheck.Module
import Cryptol.TypeCheck.FFI
import Cryptol.TypeCheck.FFI.FFIType
import Cryptol.Utils.Ident
import Cryptol.Utils.Panic(panic)
import Cryptol.Utils.RecordMap
import Cryptol.IR.TraverseNames(mapNames)
import Cryptol.Utils.PP (pp)
import qualified Data.Map as Map
import Data.Map (Map)
import qualified Data.Set as Set
import Data.List(foldl', sortBy, groupBy, partition)
import Data.Either(partitionEithers)
import Data.Maybe(isJust, fromMaybe, mapMaybe, maybeToList)
import Data.Ratio(numerator,denominator)
import Data.Traversable(forM)
import Data.Function(on)
import Control.Monad(zipWithM, unless, foldM, forM_, mplus, zipWithM,
unless, foldM, forM_, mplus, when)
-- import Debug.Trace
-- import Cryptol.TypeCheck.PP
inferTopModule :: P.Module Name -> InferM TCTopEntity
inferTopModule m =
case P.mDef m of
P.NormalModule ds ->
do newModuleScope (maybeToList (thing <$> P.mDocTop m)) (thing (P.mName m)) (P.exportedDecls ds) (P.mInScope m)
checkTopDecls ds
proveModuleTopLevel
endModule
P.FunctorInstance f as inst ->
do mb <- doFunctorInst
(P.ImpTop <$> P.mName m) f as inst (P.mInScope m) (thing <$> P.mDocTop m)
case mb of
Just mo -> pure mo
Nothing -> panic "inferModule" ["Didnt' get a module"]
P.InterfaceModule sig ->
do newTopSignatureScope (thing (P.mName m))
checkSignature sig
endTopSignature
-- | Construct a Prelude primitive in the parsed AST.
mkPrim :: String -> InferM (P.Expr Name)
mkPrim str =
do nm <- mkPrim' str
return (P.EVar nm)
-- | Construct a Prelude primitive in the parsed AST.
mkPrim' :: String -> InferM Name
mkPrim' str =
do prims <- getPrimMap
return (lookupPrimDecl (prelPrim (Text.pack str)) prims)
desugarLiteral :: P.Literal -> InferM (P.Expr Name)
desugarLiteral lit =
do l <- curRange
numberPrim <- mkPrim "number"
fracPrim <- mkPrim "fraction"
let named (x,y) = P.NamedInst
P.Named { name = Located l (packIdent x), value = y }
number fs = P.EAppT numberPrim (map named fs)
tBits n = P.TSeq (P.TNum n) P.TBit
return $ case lit of
P.ECNum num info ->
number $ [ ("val", P.TNum num) ] ++ case info of
P.BinLit _ n -> [ ("rep", tBits (1 * toInteger n)) ]
P.OctLit _ n -> [ ("rep", tBits (3 * toInteger n)) ]
P.HexLit _ n -> [ ("rep", tBits (4 * toInteger n)) ]
P.DecLit _ -> [ ]
P.PolyLit _n -> [ ("rep", P.TSeq P.TWild P.TBit) ]
P.ECFrac fr info ->
let arg f = P.PosInst (P.TNum (f fr))
rnd = P.PosInst (P.TNum (case info of
P.DecFrac _ -> 0
P.BinFrac _ -> 1
P.OctFrac _ -> 1
P.HexFrac _ -> 1))
in P.EAppT fracPrim [ arg numerator, arg denominator, rnd ]
P.ECChar c ->
number [ ("val", P.TNum (toInteger (fromEnum c)))
, ("rep", tBits (8 :: Integer)) ]
P.ECString s ->
P.ETyped (P.EList [ P.ELit (P.ECChar c) | c <- s ])
(P.TSeq P.TWild (P.TSeq (P.TNum 8) P.TBit))
-- | Infer the type of an expression with an explicit instantiation.
appTys :: P.Expr Name -> [TypeArg] -> TypeWithSource -> InferM Expr
appTys expr ts tGoal =
case expr of
P.EVar x ->
do res <- lookupVar x
(e',t) <- case res of
ExtVar s -> instantiateWith x (EVar x) s ts
CurSCC e t -> do checkNoParams ts
return (e,t)
checkHasType t tGoal
return e'
P.ELit l -> do e <- desugarLiteral l
appTys e ts tGoal
P.EAppT e fs -> appTys e (map uncheckedTypeArg fs ++ ts) tGoal
-- Here is an example of why this might be useful:
-- f ` { x = T } where type T = ...
P.EWhere e ds ->
do (e1,ds1) <- checkLocalDecls ds (appTys e ts tGoal)
pure (EWhere e1 ds1)
P.ELocated e r ->
do e' <- inRange r (appTys e ts tGoal)
cs <- getCallStacks
if cs then pure (ELocated r e') else pure e'
P.EGenerate {} -> mono
P.ETuple {} -> mono
P.ERecord {} -> mono
P.EUpd {} -> mono
P.ESel {} -> mono
P.EList {} -> mono
P.EFromTo {} -> mono
P.EFromToBy {} -> mono
P.EFromToDownBy {} -> mono
P.EFromToLessThan {} -> mono
P.EInfFrom {} -> mono
P.EComp {} -> mono
P.EApp {} -> mono
P.EIf {} -> mono
P.ETyped {} -> mono
P.ETypeVal {} -> mono
P.EFun {} -> mono
P.ESplit {} -> mono
P.EPrefix {} -> mono
P.ECase {} -> mono
P.EParens e -> appTys e ts tGoal
P.EInfix a op _ b -> appTys (P.EVar (thing op) `P.EApp` a `P.EApp` b) ts tGoal
where mono = do e' <- checkE expr tGoal
checkNoParams ts
return e'
checkNoParams :: [TypeArg] -> InferM ()
checkNoParams ts =
case pos of
p : _ -> do r <- case tyArgType p of
Unchecked t | Just r <- getLoc t -> pure r
_ -> curRange
inRange r (recordError TooManyPositionalTypeParams)
_ -> mapM_ badNamed named
where
badNamed l =
case tyArgName l of
Just i -> recordError (UndefinedTypeParameter i)
Nothing -> return ()
(named,pos) = partition (isJust . tyArgName) ts
checkTypeOfKind :: P.Type Name -> Kind -> InferM Type
checkTypeOfKind ty k = checkType ty (Just k)
-- | Infer the type of an expression, and translate it to a fully elaborated
-- core term.
checkE :: P.Expr Name -> TypeWithSource -> InferM Expr
checkE expr tGoal =
case expr of
P.EVar x ->
do res <- lookupVar x
(e',t) <- case res of
ExtVar s -> instantiateWith x (EVar x) s []
CurSCC e t -> return (e, t)
checkHasType t tGoal
return e'
P.EGenerate e ->
do prim <- mkPrim "generate"
checkE (P.EApp prim e) tGoal
P.ELit l@(P.ECNum _ (P.DecLit _)) ->
do e <- desugarLiteral l
-- NOTE: When 'l' is a decimal literal, 'desugarLiteral' does
-- not generate an instantiation for the 'rep' type argument
-- of the 'number' primitive. Therefore we explicitly
-- instantiate 'rep' to 'tGoal' in this case to avoid
-- generating an unnecessary unification variable.
loc <- curRange
let arg = TypeArg { tyArgName = Just (Located loc (packIdent "rep"))
, tyArgType = Checked (twsType tGoal)
}
appTys e [arg] tGoal
P.ELit l -> (`checkE` tGoal) =<< desugarLiteral l
P.ETuple es ->
do etys <- expectTuple (length es) tGoal
let mkTGoal n t e = WithSource t (TypeOfTupleField n) (getLoc e)
es' <- zipWithM checkE es (zipWith3 mkTGoal [1..] etys es)
return (ETuple es')
P.ERecord fs ->
do es <- expectRec fs tGoal
let checkField f (e,t) =
checkE e (WithSource t (TypeOfRecordField f) (getLoc e))
es' <- traverseRecordMap checkField es
return (ERec es')
P.EUpd x fs -> checkRecUpd x fs tGoal
P.ESel e l ->
do let src = selSrc l
t <- newType src KType
e' <- checkE e (WithSource t src (getLoc expr))
f <- newHasGoal l t (twsType tGoal)
return (hasDoSelect f e')
P.EList [] ->
do (len,a) <- expectSeq tGoal
expectFin 0 (WithSource len LenOfSeq (getLoc expr))
return (EList [] a)
P.EList es ->
do (len,a) <- expectSeq tGoal
expectFin (length es) (WithSource len LenOfSeq (getLoc expr))
let checkElem e = checkE e (WithSource a TypeOfSeqElement (getLoc e))
es' <- mapM checkElem es
return (EList es' a)
P.EFromToBy isStrict t1 t2 t3 mety
| isStrict ->
do l <- curRange
let fs = [("first",t1),("bound",t2),("stride",t3)] ++
case mety of
Just ety -> [("a",ety)]
Nothing -> []
prim <- mkPrim "fromToByLessThan"
let e' = P.EAppT prim
[ P.NamedInst P.Named{ name = Located l (packIdent x), value = y }
| (x,y) <- fs
]
checkE e' tGoal
| otherwise ->
do l <- curRange
let fs = [("first",t1),("last",t2),("stride",t3)] ++
case mety of
Just ety -> [("a",ety)]
Nothing -> []
prim <- mkPrim "fromToBy"
let e' = P.EAppT prim
[ P.NamedInst P.Named{ name = Located l (packIdent x), value = y }
| (x,y) <- fs
]
checkE e' tGoal
P.EFromToDownBy isStrict t1 t2 t3 mety
| isStrict ->
do l <- curRange
let fs = [("first",t1),("bound",t2),("stride",t3)] ++
case mety of
Just ety -> [("a",ety)]
Nothing -> []
prim <- mkPrim "fromToDownByGreaterThan"
let e' = P.EAppT prim
[ P.NamedInst P.Named{ name = Located l (packIdent x), value = y }
| (x,y) <- fs
]
checkE e' tGoal
| otherwise ->
do l <- curRange
let fs = [("first",t1),("last",t2),("stride",t3)] ++
case mety of
Just ety -> [("a",ety)]
Nothing -> []
prim <- mkPrim "fromToDownBy"
let e' = P.EAppT prim
[ P.NamedInst P.Named{ name = Located l (packIdent x), value = y }
| (x,y) <- fs
]
checkE e' tGoal
P.EFromToLessThan t1 t2 mety ->
do l <- curRange
let fs0 =
case mety of
Just ety -> [("a", ety)]
Nothing -> []
let fs = [("first", t1), ("bound", t2)] ++ fs0
prim <- mkPrim "fromToLessThan"
let e' = P.EAppT prim
[ P.NamedInst P.Named { name = Located l (packIdent x), value = y }
| (x,y) <- fs
]
checkE e' tGoal
P.EFromTo t1 mbt2 t3 mety ->
do l <- curRange
let fs0 =
case mety of
Just ety -> [("a", ety)]
Nothing -> []
let (c,fs) =
case mbt2 of
Nothing ->
("fromTo", ("last", t3) : fs0)
Just t2 ->
("fromThenTo", ("next",t2) : ("last",t3) : fs0)
prim <- mkPrim c
let e' = P.EAppT prim
[ P.NamedInst P.Named { name = Located l (packIdent x), value = y }
| (x,y) <- ("first",t1) : fs
]
checkE e' tGoal
P.EInfFrom e1 Nothing ->
do prim <- mkPrim "infFrom"
checkE (P.EApp prim e1) tGoal
P.EInfFrom e1 (Just e2) ->
do prim <- mkPrim "infFromThen"
checkE (P.EApp (P.EApp prim e1) e2) tGoal
P.EComp e mss ->
do (mss', dss, ts) <- unzip3 `fmap` zipWithM inferCArm [ 1 .. ] mss
(len,a) <- expectSeq tGoal
inferred <- smallest ts
ctrs <- unify (WithSource len LenOfSeq (getLoc expr)) inferred
newGoals CtComprehension ctrs
ds <- combineMaps dss
e' <- withMonoTypes ds (checkE e
(WithSource a TypeOfSeqElement (getLoc e)))
return (EComp len a e' mss')
where
-- the renamer should have made these checks already?
combineMaps ms = if null bad
then return (Map.unions ms)
else panic "combineMaps" $ "Multiple definitions"
: map show bad
where
bad = do m <- ms
duplicates [ a { thing = x } | (x,a) <- Map.toList m ]
duplicates = mapMaybe multiple
. groupBy ((==) `on` thing)
. sortBy (compare `on` thing)
where
multiple xs@(x : _ : _) = Just (thing x, map srcRange xs)
multiple _ = Nothing
P.EAppT e fs -> appTys e (map uncheckedTypeArg fs) tGoal
P.EApp e1 e2 ->
do let argSrc = TypeOfArg noArgDescr
t1 <- newType argSrc KType
e1' <- checkE e1
(WithSource (tFun t1 (twsType tGoal)) FunApp (getLoc e1))
e2' <- checkE e2 (WithSource t1 argSrc (getLoc e2))
return (EApp e1' e2')
P.EIf e1 e2 e3 ->
do e1' <- checkE e1 (WithSource tBit TypeOfIfCondExpr (getLoc e1))
e2' <- checkE e2 tGoal
e3' <- checkE e3 tGoal
return (EIf e1' e2' e3')
P.EWhere e ds ->
do (e1,ds1) <- checkLocalDecls ds (checkE e tGoal)
pure (EWhere e1 ds1)
P.ETyped e t ->
do tSig <- checkTypeOfKind t KType
e' <- checkE e (WithSource tSig TypeFromUserAnnotation (getLoc expr))
checkHasType tSig tGoal
return e'
P.ETypeVal t ->
do l <- curRange
prim <- mkPrim "number"
checkE (P.EAppT prim
[P.NamedInst
P.Named { name = Located l (packIdent "val")
, value = t }]) tGoal
P.EFun desc ps e -> checkFun desc ps e tGoal
P.ELocated e r ->
do e' <- inRange r (checkE e tGoal)
cs <- getCallStacks
if cs then pure (ELocated r e') else pure e'
P.ESplit e ->
do prim <- mkPrim "splitAt"
checkE (P.EApp prim e) tGoal
P.EInfix a op _ b -> checkE (P.EVar (thing op) `P.EApp` a `P.EApp` b) tGoal
P.EPrefix op e ->
do prim <- mkPrim case op of
P.PrefixNeg -> "negate"
P.PrefixComplement -> "complement"
checkE (P.EApp prim e) tGoal
P.ECase e as ->
do et <- newType CasedExpression KType
alts <- forM as \a -> checkCaseAlt a et tGoal
rng <- curRange
e1 <- checkE e (WithSource et CasedExpression (Just rng))
-- Check for overlapping cases that follow default patterns, e.g.,
--
-- enum Foo = A | B
-- f : Foo -> Bit
-- f l =
-- case l of
-- _ -> True
-- B -> False
--
-- In this example, the `B` case overlaps the catch-all `_` case.
let defltAltAndOthers = dropWhile (\(_,x,_) -> isJust x) alts
defltAlt <-
case defltAltAndOthers of
[] ->
pure Nothing
defltAlt@(_,defltPat,_):otherAlts -> do
unless (null otherAlts) $
recordError $
OverlappingPat defltPat [ r | (r,_,_) <- defltAltAndOthers ]
pure (Just defltAlt)
-- Check that there are no overlapping patterns among the case
-- alternatives, e.g.,
--
-- enum Foo = A | B
-- g : Foo -> Bit
-- g l =
-- case l of
-- A -> True
-- B -> True
-- B -> False
--
-- In this example, the two `B` cases overlap.
let mp1 = Map.fromListWith (++) [ (x,[(r,y)]) | (r,x,y) <- alts ]
forM_ (Map.toList mp1) \(mb,cs) ->
case cs of
[_] -> pure ()
_ -> recordError (OverlappingPat mb [ r | (r,_) <- cs ])
-- Check that the type of the scrutinee is unambiguously an enum.
et' <- applySubst et
cons <- case getLoc e of
Just r -> inRange r (expectEnum et')
Nothing -> expectEnum et'
-- Check that the case expression covers all possible constructors.
-- If there is a default case, there is no need to check anything,
-- since the default case will catch any constructors that weren't
-- explicitly matched on.
case defltAlt of
Just _ -> pure ()
Nothing ->
let uncoveredCons =
filter
(\con -> Map.notMember (Just (nameIdent (ecName con))) mp1)
cons in
unless (null uncoveredCons) $
recordError $ UncoveredConPat $ map ecName uncoveredCons
let dflt = fmap (\(_,_,y) -> y) defltAlt
let arms = Map.fromList [ (i,a) | (_,Just i, a) <- alts ]
pure (ECase e1 arms dflt)
P.EParens e -> checkE e tGoal
checkCaseAlt ::
P.CaseAlt Name -> Type -> TypeWithSource ->
InferM (Range, Maybe Ident, CaseAlt)
checkCaseAlt (P.CaseAlt pat e) srcT resT =
case pat of
P.PCon c ps ->
inRange (srcRange c) $
do (_tArgs,_pArgs,fTs,cresT) <- instantiatePCon (thing c)
-- XXX: should we store these somewhere?
let have = length ps
need = length fTs
unless (have == need) (recordError (InvalidConPat have need))
let expect = WithSource
{ twsType = srcT
, twsRange = Just (srcRange c)
, twsSource = ConPat
}
newGoals CtExactType =<< unify expect cresT
xs <- zipWithM checkNested ps fTs
e1 <- withMonoTypes (Map.fromList xs) (checkE e resT)
pure (srcRange c, Just (nameIdent (thing c)), mkAlt xs e1)
P.PVar x ->
do let xty = (thing x, Located (srcRange x) srcT)
e1 <- withMonoType xty (checkE e resT)
pure (srcRange x, Nothing, mkAlt [xty] e1)
P.PLocated p r -> inRange r (checkCaseAlt (P.CaseAlt p e) srcT resT)
P.PTyped p t ->
do t1 <- checkType t (Just KType)
rng <- curRange
newGoals CtExactType =<<
unify (WithSource t1 TypeFromUserAnnotation (Just rng)) srcT
checkCaseAlt (P.CaseAlt p e) t1 resT
_ -> panic "checkCaseAlt" ["Unexpected pattern"]
where
checkNested p ty =
case p of
P.PVar x -> pure (thing x, Located (srcRange x) ty)
P.PLocated p1 r -> inRange r (checkNested p1 ty)
P.PTyped p1 t ->
do t1 <- checkType t (Just KType)
rng <- curRange
newGoals CtExactType =<<
unify (WithSource t1 TypeFromUserAnnotation (Just rng)) ty
checkNested p1 t1
_ -> panic "checkNested" ["Unexpected pattern"]
mkAlt xs = CaseAlt [ (x, thing t) | (x,t) <- xs ]
checkRecUpd ::
Maybe (P.Expr Name) -> [ P.UpdField Name ] -> TypeWithSource -> InferM Expr
checkRecUpd mb fs tGoal =
case mb of
-- { _ | fs } ~~> \r -> { r | fs }
Nothing ->
do r <- newLocalName NSValue (packIdent "r")
let p = P.PVar Located { srcRange = nameLoc r, thing = r }
fe = P.EFun P.emptyFunDesc [p] (P.EUpd (Just (P.EVar r)) fs)
checkE fe tGoal
Just e ->
do e1 <- checkE e tGoal
fst <$> foldM doUpd (e1, getLoc e) fs
where
doUpd (e,eloc) (P.UpdField how sels v) =
case sels of
[l] ->
case how of
P.UpdSet ->
do let src = selSrc s
ft <- newType src KType
v1 <- checkE v (WithSource ft src eloc)
d <- newHasGoal s (twsType tGoal) ft
pure (hasDoSet d e v1, eloc `rCombMaybe` getLoc v)
P.UpdFun ->
do let src = selSrc s
ft <- newType src KType
v1 <- checkE v (WithSource (tFun ft ft) src eloc)
-- XXX: ^ may be used a different src?
d <- newHasGoal s (twsType tGoal) ft
tmp <- newLocalName NSValue (packIdent "rf")
let e' = EVar tmp
pure ( hasDoSet d e' (EApp v1 (hasDoSelect d e'))
`EWhere`
[ NonRecursive
Decl { dName = tmp
, dSignature = tMono (twsType tGoal)
, dDefinition = DExpr e
, dPragmas = []
, dInfix = False
, dFixity = Nothing
, dDoc = Nothing
} ]
, eloc `rCombMaybe` getLoc v )
where s = thing l
_ -> panic "checkRecUpd/doUpd" [ "Expected exactly 1 field label"
, "Got: " ++ show (length sels)
]
expectSeq :: TypeWithSource -> InferM (Type,Type)
expectSeq tGoal@(WithSource ty src rng) =
case ty of
TUser _ _ ty' ->
expectSeq (WithSource ty' src rng)
TCon (TC TCSeq) [a,b] ->
return (a,b)
TVar _ ->
do tys@(a,b) <- genTys
newGoals CtExactType =<< unify tGoal (tSeq a b)
return tys
_ ->
do tys@(a,b) <- genTys
recordErrorLoc rng (TypeMismatch src rootPath ty (tSeq a b))
return tys
where
genTys =
do a <- newType LenOfSeq KNum
b <- newType TypeOfSeqElement KType
return (a,b)
expectTuple :: Int -> TypeWithSource -> InferM [Type]
expectTuple n tGoal@(WithSource ty src rng) =
case ty of
TUser _ _ ty' ->
expectTuple n (WithSource ty' src rng)
TCon (TC (TCTuple n')) tys | n == n' ->
return tys
TVar _ ->
do tys <- genTys
newGoals CtExactType =<< unify tGoal (tTuple tys)
return tys
_ ->
do tys <- genTys
recordErrorLoc rng (TypeMismatch src rootPath ty (tTuple tys))
return tys
where
genTys =forM [ 0 .. n - 1 ] $ \ i -> newType (TypeOfTupleField i) KType
expectRec ::
RecordMap Ident (Range, a) ->
TypeWithSource ->
InferM (RecordMap Ident (a, Type))
expectRec fs tGoal@(WithSource ty src rng) =
case ty of
TUser _ _ ty' ->
expectRec fs (WithSource ty' src rng)
TRec ls
| Right r <- zipRecords (\_ (_rng,v) t -> (v,t)) fs ls -> pure r
_ ->
do res <- traverseRecordMap
(\nm (_rng,v) ->
do t <- newType (TypeOfRecordField nm) KType
return (v, t))
fs
let tys = fmap snd res
case ty of
TVar TVFree{} -> do ps <- unify tGoal (TRec tys)
newGoals CtExactType ps
_ -> recordErrorLoc rng (TypeMismatch src rootPath ty (TRec tys))
return res
-- | Retrieve the constructors from a type that is expected to be unambiguously
-- an enum, throwing an error if this is not the case.
expectEnum :: Type -> InferM [EnumCon]
expectEnum ty =
case tIsNominal ty of
Just (nt, _)
| Enum ecs <- ntDef nt
-> pure ecs
_ -> do
recordError (EnumTypeMismatch ty)
pure []
expectFin :: Int -> TypeWithSource -> InferM ()
expectFin n tGoal@(WithSource ty src rng) =
case ty of
TUser _ _ ty' ->
expectFin n (WithSource ty' src rng)
TCon (TC (TCNum n')) [] | toInteger n == n' ->
return ()
_ -> newGoals CtExactType =<< unify tGoal (tNum n)
expectFun :: Maybe Name -> Int -> TypeWithSource -> InferM ([Type],Type)
expectFun mbN n (WithSource ty0 src rng) = go [] n ty0
where
go tys arity ty
| arity > 0 =
case ty of
TUser _ _ ty' ->
go tys arity ty'
TCon (TC TCFun) [a,b] ->
go (a:tys) (arity - 1) b
_ ->
do args <- genArgs arity
res <- newType TypeOfRes KType
case ty of
TVar TVFree{} ->
do ps <- unify (WithSource ty src rng) (foldr tFun res args)
newGoals CtExactType ps
_ -> recordErrorLoc rng
(TypeMismatch src rootPath ty (foldr tFun res args))
return (reverse tys ++ args, res)
| otherwise =
return (reverse tys, ty)
genArgs arity = forM [ 1 .. arity ] $
\ ix -> newType (TypeOfArg (ArgDescr mbN (Just ix))) KType
checkHasType :: Type -> TypeWithSource -> InferM ()
checkHasType inferredType tGoal =
do ps <- unify tGoal inferredType
case ps of
[] -> return ()
_ -> newGoals CtExactType ps
-- | Check that the number of named parameters in a binding is compatible with
-- the type signature. This specifically catches the case where there
-- are more named parameters in the binding than the type would imply.
checkBindParams :: P.Bind Name -> TypeWithSource -> InferM ()
checkBindParams b (WithSource ty0 _src _) = case P.bParams b of
P.PatternParams nbps -> go (length nbps) 0 ty0
P.DroppedParams _ i -> go i 0 ty0
where
-- if the signature implies more parameters than we have available, we'll defer
-- this check, since the function body itself may be a lambda
go bindArity _ _ | bindArity <= 0 = return ()
go bindArity tyArity ty = case ty of
TUser _ _ ty' -> go bindArity tyArity ty'
TCon (TC TCFun) [_,y] -> go (bindArity-1) (tyArity+1) y
-- signature may imply any number of additional parameters given a free type
TVar TVFree{} -> return ()
_ -> when (bindArity > 0) $
recordErrorLoc (P.bindHeaderLoc b)
(TooManyParams (thing (P.bName b)) ty0 (bindArity + tyArity) tyArity)
checkFun ::
P.FunDesc Name -> [P.Pattern Name] ->
P.Expr Name -> TypeWithSource -> InferM Expr
checkFun _ [] e tGoal = checkE e tGoal
checkFun (P.FunDesc fun offset) ps e tGoal =
inNewScope
do let descs = [ TypeOfArg (ArgDescr fun (Just n)) | n <- [ 1 + offset .. ] ]
(tys,tRes) <- expectFun fun (length ps) tGoal
let srcs = zipWith3 WithSource tys descs (map getLoc ps)
largs <- sequence (zipWith checkP ps srcs)
let ds = Map.fromList [ (thing x, x { thing = t }) | (x,t) <- zip largs tys ]
e1 <- withMonoTypes ds
(checkE e (WithSource tRes (twsSource tGoal) (twsRange tGoal)))
let args = [ (thing x, t) | (x,t) <- zip largs tys ]
return (foldr (\(x,t) b -> EAbs x t b) e1 args)
{-| The type the is the smallest of all -}
smallest :: [Type] -> InferM Type
smallest [] = newType LenOfSeq KNum
smallest [t] = return t
smallest ts = do a <- newType LenOfSeq KNum
newGoals CtComprehension [ a =#= foldr1 tMin ts ]
return a
checkP :: P.Pattern Name -> TypeWithSource -> InferM (Located Name)
checkP p tGoal@(WithSource _ src rng0) =
do (x, t) <- inferP p
ps <- unify tGoal (thing t)
let rngMb = getLoc p `mplus` rng0
rng = fromMaybe emptyRange rngMb
let mkErr = recordErrorLoc rngMb . UnsolvedGoals . (:[])
. Goal (CtPattern src) rng
mapM_ mkErr ps
return (Located (srcRange t) x)
{-| Infer the type of a pattern. Assumes that the pattern will be just
a variable. -}
inferP :: P.Pattern Name -> InferM (Name, Located Type)
inferP pat =
case pat of
P.PVar x0 ->
do a <- inRange (srcRange x0) (newType (DefinitionOf (thing x0)) KType)
return (thing x0, x0 { thing = a })
P.PTyped p t ->
do tSig <- checkTypeOfKind t KType
ln <- checkP p (WithSource tSig TypeFromUserAnnotation (getLoc t))
return (thing ln, ln { thing = tSig })
_ -> tcPanic "inferP" [ "Unexpected pattern:", show pat ]
-- | Infer the type of one match in a list comprehension.
inferMatch :: P.Match Name -> InferM (Match, Name, Located Type, Type)
inferMatch (P.Match p e) =
do (x,t) <- inferP p
n <- newType LenOfCompGen KNum
e' <- checkE e (WithSource (tSeq n (thing t)) GeneratorOfListComp
(getLoc e))
return (From x n (thing t) e', x, t, n)
inferMatch (P.MatchLet b)
| P.bMono b =
do let rng = srcRange (P.bName b)
a <- inRange rng (newType (DefinitionOf (thing (P.bName b))) KType)
b1 <- checkMonoB b a
return (Let b1, dName b1, Located (srcRange (P.bName b)) a, tNum (1::Int))
| otherwise = tcPanic "inferMatch"
[ "Unexpected polymorphic match let:", show b ]
-- | Infer the type of one arm of a list comprehension.
inferCArm :: Int -> [P.Match Name] -> InferM
( [Match]
, Map Name (Located Type)-- defined vars
, Type -- length of sequence
)
inferCArm _ [] = panic "inferCArm" [ "Empty comprehension arm" ]
inferCArm _ [m] =
do (m1, x, t, n) <- inferMatch m
return ([m1], Map.singleton x t, n)
inferCArm armNum (m : ms) =
do (m1, x, t, n) <- inferMatch m
(ms', ds, n') <- withMonoType (x,t) (inferCArm armNum ms)
newGoals CtComprehension [ pFin n' ]
return (m1 : ms', Map.insertWith (\_ old -> old) x t ds, tMul n n')
{- | @inferBinds isTopLevel isRec binds@ performs inference for a
strongly-connected component of 'P.Bind's.
If any of the members of the recursive group are already marked
as monomorphic, then we don't do generalization.
If @isTopLevel@ is true,
any bindings without type signatures will be generalized. If it is
false, and the mono-binds flag is enabled, no bindings without type
signatures will be generalized, but bindings with signatures will
be unaffected.
-}
inferBinds :: Bool -> Bool -> [P.Bind Name] -> InferM [Decl]
inferBinds isTopLevel isRec binds =
do -- when mono-binds is enabled, and we're not checking top-level
-- declarations, mark all bindings lacking signatures as monomorphic
monoBinds <- getMonoBinds
let (sigs,noSigs) = partition (isJust . P.bSignature) binds
monos = sigs ++ [ b { P.bMono = True } | b <- noSigs ]
binds' | any P.bMono binds = monos
| monoBinds && not isTopLevel = monos
| otherwise = binds
check exprMap =
{- Guess type is here, because while we check user supplied signatures
we may generate additional constraints. For example, `x - y` would
generate an additional constraint `x >= y`. -}
do (newEnv,todos) <- unzip `fmap` mapM (guessType exprMap) binds'
let otherEnv = filter isExt newEnv
let (sigsAndMonos,noSigGen) = partitionEithers todos
let prepGen = collectGoals
$ do bs <- sequence noSigGen
simplifyAllConstraints
return bs
if isRec
then
-- First we check the bindings with no signatures
-- that need to be generalized.
do (bs1,cs) <- withVarTypes newEnv prepGen
-- We add these to the environment, so their fvs are
-- not generalized.
genCs <- withVarTypes otherEnv (generalize bs1 cs)
-- Then we do all the rest,
-- using the newly inferred poly types.
let newEnv' = map toExt bs1 ++ otherEnv
done <- withVarTypes newEnv' (sequence sigsAndMonos)
return (done,genCs)
else
do done <- sequence sigsAndMonos
(bs1, cs) <- prepGen
genCs <- generalize bs1 cs
return (done,genCs)
rec
let exprMap = Map.fromList (map monoUse genBs)
(doneBs, genBs) <- check exprMap
simplifyAllConstraints
return (doneBs ++ genBs)
where
toExt d = (dName d, ExtVar (dSignature d))
isExt (_,y) = case y of
ExtVar _ -> True
_ -> False
monoUse d = (x, withQs)
where
x = dName d
as = sVars (dSignature d)
qs = sProps (dSignature d)
appT e a = ETApp e (TVar (tpVar a))
appP e _ = EProofApp e
withTys = foldl' appT (EVar x) as
withQs = foldl' appP withTys qs
{- | Come up with a type for recursive calls to a function, and decide
how we are going to be checking the binding.
Returns: (Name, type or schema, computation to check binding)
The `exprMap` is a thunk where we can lookup the final expressions
and we should be careful not to force it.
-}
guessType :: Map Name Expr -> P.Bind Name ->
InferM ( (Name, VarType)
, Either (InferM Decl) -- no generalization
(InferM Decl) -- generalize these
)
guessType exprMap b@(P.Bind { .. }) =
case bSignature of
Just s ->
do let wildOk = case thing bDef of
P.DForeign {} -> NoWildCards
P.DPrim -> NoWildCards
P.DImpl i -> case i of
P.DExpr {} -> AllowWildCards
P.DPropGuards {} -> NoWildCards
s1 <- checkSchema wildOk s
return ((name, ExtVar (fst s1)), Left (checkSigB b s1))
Nothing
| bMono ->
do t <- newType (DefinitionOf name) KType
let schema = Forall [] [] t
return ((name, ExtVar schema), Left (checkMonoB b t))
| otherwise ->
do t <- newType (DefinitionOf name) KType
let noWay = tcPanic "guessType" [ "Missing expression for:" ,
show name ]
expr = Map.findWithDefault noWay name exprMap
return ((name, CurSCC expr t), Right (checkMonoB b t))
where
name = thing bName
{- | The inputs should be declarations with monomorphic types
(i.e., of the form `Forall [] [] t`). -}
generalize :: [Decl] -> [Goal] -> InferM [Decl]
{- This may happen because we have monomorphic bindings.
In this case we may get some goal, due to the monomorphic bindings,
but the group of components is empty. -}
generalize [] gs0 =
do addGoals gs0
return []
generalize bs0 gs0 =
do {- First, we apply the accumulating substitution to the goals
and the inferred types, to ensure that we have the most up
to date information. -}
gs <- applySubstGoals gs0
bs <- forM bs0 $ \b -> do s <- applySubst (dSignature b)
return b { dSignature = s }
-- Next, we figure out which of the free variables need to be generalized
-- Variables apearing in the types of monomorphic bindings should
-- not be generalizedr.
let goalFVS g = Set.filter isFreeTV $ fvs $ goal g
inGoals = Set.unions $ map goalFVS gs
inSigs = Set.filter isFreeTV $ fvs $ map dSignature bs
candidates = (Set.union inGoals inSigs)
asmpVs <- varsWithAsmps
let gen0 = Set.difference candidates asmpVs
stays g = any (`Set.member` gen0) $ Set.toList $ goalFVS g
(here0,later) = partition stays gs
addGoals later -- these ones we keep around for to solve later
let maybeAmbig = Set.toList (Set.difference gen0 inSigs)
{- See if we might be able to default some of the potentially ambiguous
variables using the constraints that will be part of the newly
generalized schema. -}
let (as0,here1,defSu,ws,errs) = defaultAndSimplify maybeAmbig here0
extendSubst defSu
mapM_ recordWarning ws
mapM_ recordError errs
let here = map goal here1
{- This is the variables we'll be generalizing:
* any ones that survived the defaulting
* and vars in the inferred types that do not appear anywhere else. -}
let as = sortBy numFst
$ as0 ++ Set.toList (Set.difference inSigs asmpVs)
asPs = [ TParam { tpUnique = x
, tpKind = k
, tpFlav = TPUnifyVar
, tpInfo = i
}
| TVFree x k _ i <- as
]
{- Finally, we replace free variables with bound ones, and fix-up
the definitions as needed to reflect that we are now working
with polymorphic things. For example, apply each occurrence to the
type parameters. -}
totSu <- getSubst
let
su = listSubst (zip as (map (TVar . tpVar) asPs)) @@ totSu
qs = concatMap (pSplitAnd . apSubst su) here
genE e = foldr ETAbs (foldr EProofAbs (apSubst su e) qs) asPs
genB d = d { dDefinition = case dDefinition d of
DExpr e -> DExpr (genE e)
DPrim -> DPrim
DForeign t me -> DForeign t (genE <$> me)
, dSignature = Forall asPs qs
$ apSubst su $ sType $ dSignature d
}
return (map genB bs)
where
numFst x y = case (kindOf x, kindOf y) of
(KNum, KNum) -> EQ
(KNum, _) -> LT
(_,KNum) -> GT
_ -> EQ
-- | Check a monomorphic binding.
checkMonoB :: P.Bind Name -> Type -> InferM Decl
checkMonoB b t =
inRangeMb (getLoc b) $
case thing (P.bDef b) of
P.DPrim -> panic "checkMonoB" ["Primitive with no signature?"]
P.DForeign _ -> panic "checkMonoB" ["Foreign with no signature?"]
P.DImpl i ->
case i of
P.DExpr e ->
do let nm = thing (P.bName b)
let tGoal = WithSource t (DefinitionOf nm) (getLoc b)
checkBindParams b tGoal
e1 <- checkFun (P.FunDesc (Just nm) 0) (P.bindParams b) e tGoal
let f = thing (P.bName b)
return Decl { dName = f
, dSignature = Forall [] [] t
, dDefinition = DExpr e1
, dPragmas = P.bPragmas b
, dInfix = P.bInfix b
, dFixity = P.bFixity b
, dDoc = thing <$> P.bDoc b
}
-- The pass in Cryptol.Parser.ExpandPropGuards ensures that by the time
-- we reach this code, all definitions that use constraint guards will
-- have a type signature, so this case should be unreachable.
P.DPropGuards _ ->
tcPanic "checkMonoB"
[ "Used constraint guards without a signature at "
, show . pp $ P.bName b ]
-- XXX: Do we really need to do the defaulting business in two different places?
checkSigB :: P.Bind Name -> (Schema,[Goal]) -> InferM Decl
checkSigB b (Forall as asmps0 t0, validSchema) =
case thing (P.bDef b) of
-- XXX what should we do with validSchema in this case?
P.DPrim ->
return Decl
{ dName = name
, dSignature = Forall as asmps0 t0
, dDefinition = DPrim
, dPragmas = P.bPragmas b
, dInfix = P.bInfix b
, dFixity = P.bFixity b
, dDoc = thing <$> P.bDoc b
}
P.DForeign mi -> do
(asmps, t, me) <-
case mi of
Just i -> fmap Just <$> checkImpl i
Nothing -> pure (asmps0, t0, Nothing)
let loc = getLoc b
src = DefinitionOf name
inRangeMb loc do
-- Ensure all type params are of kind #
forM_ as \a ->
when (tpKind a /= KNum) $
recordErrorLoc loc $ UnsupportedFFIKind src a $ tpKind a
withTParams as do
ffiFunType <-
case toFFIFunType (Forall as asmps t) of
Right (props, ffiFunType) -> ffiFunType <$ do
ffiGoals <- traverse (newGoal (CtFFI name)) props
proveImplication True (Just name) as asmps $
validSchema ++ ffiGoals
Left err -> do
recordErrorLoc loc $ UnsupportedFFIType src err
-- Just a placeholder type
pure FFIFunType
{ ffiTParams = as, ffiArgTypes = []
, ffiRetType = FFITuple [] }
pure Decl { dName = thing (P.bName b)
, dSignature = Forall as asmps t
, dDefinition = DForeign ffiFunType me
, dPragmas = P.bPragmas b
, dInfix = P.bInfix b
, dFixity = P.bFixity b
, dDoc = thing <$> P.bDoc b
}
P.DImpl i -> do
(asmps, t, expr) <- checkImpl i
return Decl
{ dName = name
, dSignature = Forall as asmps t
, dDefinition = DExpr expr
, dPragmas = P.bPragmas b
, dInfix = P.bInfix b
, dFixity = P.bFixity b
, dDoc = thing <$> P.bDoc b
}
where
name = thing (P.bName b)
checkImpl :: P.BindImpl Name -> InferM ([Prop], Type, Expr)
checkImpl i =
inRangeMb (getLoc b) $
withTParams as $
case i of
P.DExpr e0 -> do
(t, asmps, e2) <- checkBindDefExpr [] asmps0 e0
pure ( asmps
, t
, foldr ETAbs (foldr EProofAbs e2 asmps) as
)
P.DPropGuards cases0 -> inRangeMb (getLoc cases0) $ do
asmps1 <- applySubstPreds asmps0
t1 <- applySubst t0
cases1 <- mapM (checkPropGuardCase asmps1) cases0
-- If we recorded any errors when type-checking the constraint guards,
-- then abort early. We don't want to check exhaustivity if there are
-- malformed constraints, as these can cause panics elsewhere during
-- exhaustivity checking (see the `issue{1593,1693}` test cases).
abortIfErrors
exh <- checkExhaustive (P.bName b) as asmps1 (map fst cases1)
unless exh $
-- didn't prove exhaustive i.e. none of the guarding props
-- necessarily hold
recordWarning (NonExhaustivePropGuards name)
pure ( asmps1
, t1
, foldr ETAbs
(foldr EProofAbs
(ePropGuards cases1 t1)
asmps1)
as
)
checkBindDefExpr ::
[Prop] -> [Prop] -> P.Expr Name -> InferM (Type, [Prop], Expr)
checkBindDefExpr asmpsSign asmps1 e0 = do
(e1,cs0) <- collectGoals $ do
let nm = thing (P.bName b)
tGoal = WithSource t0 (DefinitionOf nm) (getLoc b)
checkBindParams b tGoal
e1 <- checkFun (P.FunDesc (Just nm) 0) (P.bindParams b) e0 tGoal
addGoals validSchema
() <- simplifyAllConstraints -- XXX: using `asmps` also?
return e1
asmps2 <- applySubstPreds asmps1
cs <- applySubstGoals cs0
let findKeep vs keep todo =
let stays (_,cvs) = not $ Set.null $ Set.intersection vs cvs
(yes,perhaps) = partition stays todo
(stayPs,newVars) = unzip yes
in case stayPs of
[] -> (keep,map fst todo)
_ -> findKeep (Set.unions (vs:newVars)) (stayPs ++ keep) perhaps
let -- if a goal mentions any of these variables, we'll commit to
-- solving it now.
stickyVars = Set.fromList (map tpVar as) `Set.union` fvs asmps2
(stay,leave) = findKeep stickyVars []
[ (c, fvs c) | c <- cs ]
addGoals leave
-- includes asmpsSign for the sake of implication, but doesn't actually
-- include them in the resulting asmps
su <- proveImplication True (Just (thing (P.bName b))) as (asmpsSign <> asmps2) stay
extendSubst su
let asmps = concatMap pSplitAnd (apSubst su asmps2)
t <- applySubst t0
e2 <- applySubst e1
pure (t, asmps, e2)
{- |
Given a DPropGuards of the form
@
f : {...} A
f | (B1, B2) => ...
| (C1, C2, C2) => ...
@
we check that it is exhaustive by trying to prove the following
implications:
@
A /\ ~B1 => C1 /\ C2 /\ C3
A /\ ~B2 => C1 /\ C2 /\ C3
@
The implications were derive by the following general algorithm:
- Find that @(C1, C2, C3)@ is the guard that has the most conjuncts, so we
will keep it on the RHS of the generated implications in order to minimize
the number of implications we need to check.
- Negate @(B1, B2)@ which yields @(~B1) \/ (~B2)@. This is a disjunction, so
we need to consider a branch for each disjunct --- one branch gets the
assumption @~B1@ and another branch gets the assumption @~B2@. Each
branch's implications need to be proven independently.
- If the solver fails to prove any subgoal, but with an error indicating
the subgoal may be provable (i.e. the attempt was terminated due to some partial
heuristic), then pick the next-longest guard as the RHS and re-start. e.g.:
@
A /\ ~C1 => B1 /\ B2
A /\ ~C2 => B1 /\ B2
A /\ ~C3 => B1 /\ B2
@
Note that this is sound because the first step (choosing a guard as the RHS)
is heuristic: we can always choose to rewrite @P \/ Q@
into either @~P => Q@ or @~Q => P@.
-}
checkExhaustive :: Located Name -> [TParam] -> [Prop] -> [[Prop]] -> InferM Bool
checkExhaustive name as asmps guards =
go (sortBy cmpByLonger guards) 0
where
pluck i xs = case splitAt i xs of
(_, []) -> Nothing
(ys,x:xs') -> Just (x, ys ++ xs')
-- if starting with the longest guard fails with a 'ProofUnknown' result,
-- then re-try with the next guard in descending order.
-- NB: in the worst case this is quadratic in the number of guard predicates, but
-- in practice we expect this number to be low
go [] _ = pure False -- XXX: we should check the asmps are unsatisfiable
go goals i = case pluck i goals of
Just (goalp, rest) ->
do ok <- doGoals (theAlts rest) (map toGoal goalp)
case ok of
ProofSuccess -> pure True
ProofFail -> pure False
ProofUnknown -> go goals (i+1)
Nothing -> pure False
cmpByLonger props1 props2 = compare (length props2) (length props1)
-- reversed, so that longest is first
theAlts :: [[Prop]] -> [[Prop]]
theAlts = map concat . sequence . map chooseNeg
-- Choose one of the things to negate
chooseNeg ps =
case ps of
[] -> []
p : qs -> (pNegNumeric p ++ qs) : [ p : alts | alts <- chooseNeg qs ]
-- Try to validate all cases
doGoals todo gs =
case todo of
[] -> pure ProofSuccess
alt : more ->
do ok <- canProve (asmps ++ alt) gs
case ok of
ProofSuccess -> doGoals more gs
ProofFail -> pure ProofFail
ProofUnknown -> pure ProofUnknown
toGoal :: Prop -> Goal
toGoal prop =
Goal
{ goalSource = CtPropGuardsExhaustive (thing name)
, goalRange = srcRange name
, goal = prop
}
maybeSolvable :: Error -> Bool
maybeSolvable err = case err of
UnsolvedDelayedCt{} -> True
UnsolvedGoals{} -> True
_ -> False
canProve :: [Prop] -> [Goal] -> InferM ProofResult
canProve asmps' goals =
do res <- tryProveImplication (Just (thing name)) as asmps' goals
case res of
Left errs | all maybeSolvable errs -> return ProofUnknown
Left{} -> return ProofFail
Right{} -> return ProofSuccess
data ProofResult =
ProofSuccess
-- ^ Proof attempt was successful.
| ProofFail
-- ^ Proof attempt failed, and goal is most likely not provable.
| ProofUnknown
-- ^ Proof attempt failed due to incomplete heuristics, goal may
-- still be provable.
{- | Generate type-checked syntax for the code in a PropGuard. For example,
consider the following (pre–type-checked) syntax for a guard:
@
f : {n, a} (Zero a) => [n]a
f | n == 1 => f(n == 1)
| ...
f(n == 2) : {n, a} (Zero a, n == 1) => [n] a
f(n == 2) = ...
@
This function will type-check the `n == 1` constraint in the guard as well
as the f(n == 1) application on the right-hand side of the guard. This function
is responsible for ensuring that f(n == 1) is applied to the appropriate number
of type and proof arguments, so the type-checked syntax will look something
like:
@
f : {n, a} (Zero a) => [n]a
f | n == 1 => f(n == 1)`{n, a} <Zero a> <n == 1>
| ...
@
Note that 'checkPropGuardCase' does not validate anything about the
(automatically generated) functions corresponding to guards (e.g., f(n == 1)).
These guard functions will be validated when the bodies of these functions are
type-checked, assuming "Cryptol.Parser.ExpandPropGuards" did its job correctly.
-}
checkPropGuardCase ::
[Prop]
{- ^ The constraints from the type signature. -} ->
P.PropGuardCase Name
{- ^ The guard itself. -} ->
InferM ([Prop],Expr)
{- ^ The type-checked guard constraints and right-hand side expression. -}
checkPropGuardCase asmps (P.PropGuardCase guards e0) =
do -- First, validate the constraints in the guard.
ps <- checkPropGuards guards
-- Next, take the application of the guard function on the right-hand side
-- and decompose it into the name of the function `eV`, the type arguments
-- `ts`, and the value arguments `es`.
--
-- To do this, we kind-check all of the type arguments...
tys <- mapM (`checkType` Nothing) ts
let -- ...then apply the guard function to the kind-checked types...
rhsTs = foldl ETApp (getV eV) tys
-- ...then apply that to the constraints from the type signature
-- (`asmps`) and the constraints in the guard (`ps`). Note that `asmps`
-- is guaranteed to contain all of the non-guard constraints in scope,
-- as numeric constraint guards can only be used in top-level (i.e.,
-- non-local) functions...
rhsPs = foldl (\e _p -> EProofApp e) rhsTs (asmps ++ ps)
-- ...finally, apply that to the value arguments. If `ExpandPropGuards`
-- did its job correctly, all value arguments should be variables.
rhs = foldl EApp rhsPs (map getV es)
pure (ps,rhs)
where
(e1,es) = P.asEApps e0
(eV,ts) = case e1 of
P.EAppT ex1 tis -> (ex1, map getT tis)
_ -> (e1, [])
getV ex =
case ex of
P.EVar x -> EVar x
_ -> bad "Expression is not a variable."
getT ti =
case ti of
P.PosInst t -> t
P.NamedInst {} -> bad "Unexpected NamedInst"
bad msg = panic "checkPropGuardCase" [msg]
--------------------------------------------------------------------------------
--------------------------------------------------------------------------------
checkLocalDecls :: [P.Decl Name] -> InferM a -> InferM (a,[DeclGroup])
checkLocalDecls ds0 k =
do newLocalScope
forM_ ds0 \d -> checkDecl False d Nothing
a <- k
(ds,_tySyns) <- endLocalScope
pure (a,ds)
checkTopDecls :: [P.TopDecl Name] -> InferM ()
checkTopDecls = mapM_ checkTopDecl
where
checkTopDecl decl =
case decl of
P.Decl tl -> checkDecl True (P.tlValue tl) (thing <$> P.tlDoc tl)
P.TDNewtype tl ->
do t <- checkNewtype (P.tlValue tl) (thing <$> P.tlDoc tl)
addNominal t
P.TDEnum tl ->
do t <- checkEnum (P.tlValue tl) (thing <$> P.tlDoc tl)
addNominal t
P.DPrimType tl ->
do t <- checkPrimType (P.tlValue tl) (thing <$> P.tlDoc tl)
addNominal t
P.DInterfaceConstraint _ cs ->
inRange (srcRange cs)
do cs1 <- checkParameterConstraints [ cs { thing = c } | c <- thing cs ]
addParameterConstraints cs1
P.DModule tl ->
selectorScope
case P.mDef m of
P.NormalModule ds ->
do newSubmoduleScope (thing (P.mName m))
(maybeToList (thing <$> P.tlDoc tl))
(P.exportedDecls ds)
(P.mInScope m)
checkTopDecls ds
proveModuleTopLevel
endSubmodule
P.FunctorInstance f as inst ->
do let doc = thing <$> P.tlDoc tl
_ <- doFunctorInst
(P.ImpNested <$> P.mName m) f as inst (P.mInScope m) doc
pure ()
P.InterfaceModule sig ->
do let doc = thing <$> P.tlDoc tl
inRange (srcRange (P.mName m))
do newSignatureScope (thing (P.mName m)) doc
checkSignature sig
endSignature
where P.NestedModule m = P.tlValue tl
P.DModParam p ->
inRange (srcRange (P.mpSignature p))
do let binds = P.mpRenaming p
suMap = Map.fromList [ (y,x) | (x,y) <- Map.toList binds ]
actualName x = Map.findWithDefault x x suMap
ips <- lookupSignature (thing (P.mpSignature p))
let actualTys = [ mapNames actualName mp
| mp <- Map.elems (mpnTypes ips) ]
actualTS = [ mapNames actualName ts
| ts <- Map.elems (mpnTySyn ips)
]
actualCtrs = [ mapNames actualName prop
| prop <- mpnConstraints ips ]
actualVals = [ mapNames actualName vp
| vp <- Map.elems (mpnFuns ips) ]
param =
ModParam
{ mpName = P.mpName p
, mpIface = thing (P.mpSignature p)
, mpQual = P.mpAs p
, mpParameters =
ModParamNames
{ mpnTypes = Map.fromList [ (mtpName tp, tp)
| tp <- actualTys ]
, mpnTySyn = Map.fromList [ (tsName ts, ts)
| ts <- actualTS ]
, mpnConstraints = actualCtrs
, mpnFuns = Map.fromList [ (mvpName vp, vp)
| vp <- actualVals ]
, mpnDoc = thing <$> P.mpDoc p
}
}
mapM_ addParamType actualTys
addParameterConstraints actualCtrs
mapM_ addParamFun actualVals
mapM_ addTySyn actualTS
addModParam param
P.DImport {} -> pure ()
P.Include {} -> bad "Include"
P.DParamDecl {} -> bad "DParamDecl"
bad x = panic "checkTopDecl" [ x ]
checkSignature :: P.Signature Name -> InferM ()
checkSignature sig =
do forM_ (P.sigTypeParams sig) \pt ->
addParamType =<< checkParameterType pt
mapM_ checkSigDecl (P.sigDecls sig)
addParameterConstraints =<<
checkParameterConstraints (P.sigConstraints sig)
forM_ (P.sigFunParams sig) \f ->
addParamFun =<< checkParameterFun f
proveModuleTopLevel
checkSigDecl :: P.SigDecl Name -> InferM ()
checkSigDecl decl =
case decl of
P.SigTySyn ts mbD ->
addTySyn =<< checkTySyn ts mbD
P.SigPropSyn ps mbD ->
addTySyn =<< checkPropSyn ps mbD
checkDecl :: Bool -> P.Decl Name -> Maybe Text -> InferM ()
checkDecl isTopLevel d mbDoc =
case d of
P.DBind c ->
do ~[b] <- inferBinds isTopLevel False [c]
addDecls (NonRecursive b)
P.DRec bs ->
do bs1 <- inferBinds isTopLevel True bs
addDecls (Recursive bs1)
P.DType t ->
do t1 <- checkTySyn t mbDoc
addTySyn t1
P.DProp t ->
do t1 <- checkPropSyn t mbDoc
addTySyn t1
P.DLocated d' r -> inRange r (checkDecl isTopLevel d' mbDoc)
P.DSignature {} -> bad "DSignature"
P.DFixity {} -> bad "DFixity"
P.DPragma {} -> bad "DPragma"
P.DPatBind {} -> bad "DPatBind"
where
bad x = panic "checkDecl" [x]
checkParameterFun :: P.ParameterFun Name -> InferM ModVParam
checkParameterFun x =
do (s,gs) <- checkSchema NoWildCards (P.pfSchema x)
su <- proveImplication False (Just (thing (P.pfName x)))
(sVars s) (sProps s) gs
unless (isEmptySubst su) $
panic "checkParameterFun" ["Subst not empty??"]
let n = thing (P.pfName x)
return ModVParam { mvpName = n
, mvpType = s
, mvpDoc = thing <$> P.pfDoc x
, mvpFixity = P.pfFixity x
}
tcPanic :: String -> [String] -> a
tcPanic l msg = panic ("[TypeCheck] " ++ l) msg