{-# LANGUAGE CPP #-}
{-# LANGUAGE NondecreasingIndentation #-}
module Agda.TypeChecking.Conversion where
import Control.Monad
import Control.Monad.Reader
import Control.Monad.State
import qualified Data.List as List
import qualified Data.Map as Map
import qualified Data.Set as Set
import qualified Data.IntSet as IntSet
#if __GLASGOW_HASKELL__ <= 708
import Data.Traversable ( traverse )
#endif
import Agda.Syntax.Abstract.Views (isSet)
import Agda.Syntax.Common
import Agda.Syntax.Internal
import Agda.Syntax.Translation.InternalToAbstract (reify)
import Agda.TypeChecking.Monad
import Agda.TypeChecking.Monad.Builtin
import Agda.TypeChecking.CompiledClause (CompiledClauses'(Fail))
import Agda.TypeChecking.MetaVars
import Agda.TypeChecking.MetaVars.Occurs (killArgs,PruneResult(..),rigidVarsNotContainedIn)
import Agda.TypeChecking.Names
import Agda.TypeChecking.Reduce
import Agda.TypeChecking.Substitute
import qualified Agda.TypeChecking.SyntacticEquality as SynEq
import Agda.TypeChecking.Telescope
import Agda.TypeChecking.Constraints
import {-# SOURCE #-} Agda.TypeChecking.CheckInternal (infer)
import Agda.TypeChecking.Errors
import Agda.TypeChecking.Forcing (isForced, nextIsForced)
import Agda.TypeChecking.Free
import Agda.TypeChecking.Datatypes (getConType, getFullyAppliedConType)
import Agda.TypeChecking.Records
import Agda.TypeChecking.Pretty
import Agda.TypeChecking.Injectivity
import Agda.TypeChecking.Polarity
import Agda.TypeChecking.SizedTypes
import Agda.TypeChecking.Level
import Agda.TypeChecking.Implicit (implicitArgs)
import Agda.TypeChecking.Irrelevance
import Agda.TypeChecking.ProjectionLike (elimView)
import Agda.TypeChecking.Primitive
import Agda.Interaction.Options
import Agda.Utils.Except ( MonadError(catchError, throwError) )
import Agda.Utils.Functor
import Agda.Utils.Monad
import Agda.Utils.Maybe
import Agda.Utils.Size
import Agda.Utils.Tuple
import Agda.Utils.Lens
#include "undefined.h"
import Agda.Utils.Impossible
tryConversion :: TCM () -> TCM Bool
tryConversion = isJust <.> tryConversion'
tryConversion' :: TCM a -> TCM (Maybe a)
tryConversion' m = tryMaybe $ noConstraints m
sameVars :: Elims -> Elims -> Bool
sameVars xs ys = and $ zipWith same xs ys
where
same (Apply (Arg _ (Var n []))) (Apply (Arg _ (Var m []))) = n == m
same _ _ = False
intersectVars :: Elims -> Elims -> Maybe [Bool]
intersectVars = zipWithM areVars where
areVars (Apply u) v | isIrrelevant u = Just False
areVars (Apply (Arg _ (Var n []))) (Apply (Arg _ (Var m []))) = Just $ n /= m
areVars _ _ = Nothing
equalTerm :: Type -> Term -> Term -> TCM ()
equalTerm = compareTerm CmpEq
equalAtom :: Type -> Term -> Term -> TCM ()
equalAtom = compareAtom CmpEq
equalType :: Type -> Type -> TCM ()
equalType = compareType CmpEq
convError :: TypeError -> TCM ()
convError err = ifM ((==) Irrelevant <$> asksTC envRelevance) (return ()) $ typeError err
compareTerm :: Comparison -> Type -> Term -> Term -> TCM ()
compareTerm cmp a u v = do
reportSDoc "tc.conv.term" 10 $ sep
[ "compareTerm"
, nest 2 $ prettyTCM u <+> prettyTCM cmp <+> prettyTCM v
, nest 2 $ ":" <+> prettyTCM a
]
((u, v), equal) <- SynEq.checkSyntacticEquality u v
if equal then verboseS "profile.sharing" 20 $ tick "equal terms" else do
verboseS "profile.sharing" 20 $ tick "unequal terms"
reportSDoc "tc.conv.term" 15 $ sep
[ "compareTerm (not syntactically equal)"
, nest 2 $ prettyTCM u <+> prettyTCM cmp <+> prettyTCM v
, nest 2 $ ":" <+> prettyTCM a
]
let fallback = compareTerm' cmp a u v
unlessSubtyping cont =
if cmp == CmpEq then cont else do
ifBlockedType a (\ _ _ -> fallback) $ \ _ a -> do
caseMaybeM (isSizeType a) cont (\ _ -> fallback)
dir = fromCmp cmp
rid = flipCmp dir
case (u, v) of
(MetaV x us, MetaV y vs)
| x /= y -> unlessSubtyping $ solve1 `orelse` solve2 `orelse` compareTerm' cmp a u v
| otherwise -> fallback
where
(solve1, solve2) | x > y = (assign dir x us v, assign rid y vs u)
| otherwise = (assign rid y vs u, assign dir x us v)
(MetaV x us, _) -> unlessSubtyping $ assign dir x us v `orelse` fallback
(_, MetaV y vs) -> unlessSubtyping $ assign rid y vs u `orelse` fallback
_ -> fallback
where
assign dir x es v = do
reportSDoc "tc.conv.term.shortcut" 20 $ sep
[ "attempting shortcut"
, nest 2 $ prettyTCM (MetaV x es) <+> ":=" <+> prettyTCM v
]
ifM (isInstantiatedMeta x) patternViolation $ do
assignE dir x es v $ compareTermDir dir a
reportSDoc "tc.conv.term.shortcut" 50 $
"shortcut successful" $$ nest 2 ("result:" <+> (pretty =<< instantiate (MetaV x es)))
orelse m h = catchError m (\_ -> h)
assignE :: CompareDirection -> MetaId -> Elims -> Term -> (Term -> Term -> TCM ()) -> TCM ()
assignE dir x es v comp = assignWrapper dir x es v $ do
case allApplyElims es of
Just vs -> assignV dir x vs v
Nothing -> do
reportSDoc "tc.conv.assign" 30 $ sep
[ "assigning to projected meta "
, prettyTCM x <+> sep (map prettyTCM es) <+> text (":" ++ show dir) <+> prettyTCM v
]
etaExpandMeta [Records] x
res <- isInstantiatedMeta' x
case res of
Just u -> do
reportSDoc "tc.conv.assign" 30 $ sep
[ "seems like eta expansion instantiated meta "
, prettyTCM x <+> text (":" ++ show dir) <+> prettyTCM u
]
let w = u `applyE` es
comp w v
Nothing -> do
reportSLn "tc.conv.assign" 30 "eta expansion did not instantiate meta"
patternViolation
compareTermDir :: CompareDirection -> Type -> Term -> Term -> TCM ()
compareTermDir dir a = dirToCmp (`compareTerm'` a) dir
compareTerm' :: Comparison -> Type -> Term -> Term -> TCM ()
compareTerm' cmp a m n =
verboseBracket "tc.conv.term" 20 "compareTerm" $ do
a' <- reduce a
catchConstraint (ValueCmp cmp a' m n) $ do
reportSDoc "tc.conv.term" 30 $ fsep
[ "compareTerm", prettyTCM m, prettyTCM cmp, prettyTCM n, ":", prettyTCM a' ]
propIrr <- isPropEnabled
isSize <- isJust <$> isSizeType a'
s <- reduce $ getSort a'
mlvl <- tryMaybe primLevel
reportSDoc "tc.conv.level" 60 $ nest 2 $ sep
[ "a' =" <+> pretty a'
, "mlvl =" <+> pretty mlvl
, text $ "(Just (unEl a') == mlvl) = " ++ show (Just (unEl a') == mlvl)
]
case s of
Prop{} | propIrr -> compareIrrelevant a' m n
_ | isSize -> compareSizes cmp m n
_ -> case unEl a' of
a | Just a == mlvl -> do
a <- levelView m
b <- levelView n
equalLevel a b
a@Pi{} -> equalFun s a m n
Lam _ _ -> __IMPOSSIBLE__
Def r es -> do
isrec <- isEtaRecord r
if isrec
then do
sig <- getSignature
let ps = fromMaybe __IMPOSSIBLE__ $ allApplyElims es
isNeutral (NotBlocked _ Con{}) = return False
isNeutral (NotBlocked r (Def q _)) = do
not <$> usesCopatterns q
isNeutral _ = return True
isMeta (NotBlocked _ MetaV{}) = True
isMeta _ = False
reportSDoc "tc.conv.term" 30 $ prettyTCM a <+> "is eta record type"
m <- reduceB m
mNeutral <- isNeutral m
n <- reduceB n
nNeutral <- isNeutral n
case (m, n) of
_ | isMeta m || isMeta n ->
compareAtom cmp a' (ignoreBlocking m) (ignoreBlocking n)
_ | mNeutral && nNeutral -> do
isSing <- isSingletonRecordModuloRelevance r ps
case isSing of
Right True -> return ()
_ -> compareAtom cmp a' (ignoreBlocking m) (ignoreBlocking n)
_ -> do
(tel, m') <- etaExpandRecord r ps $ ignoreBlocking m
(_ , n') <- etaExpandRecord r ps $ ignoreBlocking n
c <- getRecordConstructor r
compareArgs (repeat $ polFromCmp cmp) [] (telePi_ tel __DUMMY_TYPE__) (Con c ConOSystem []) m' n'
else (do pathview <- pathView a'
equalPath pathview a' m n)
_ -> compareAtom cmp a' m n
where
equalFun :: Sort -> Term -> Term -> Term -> TCM ()
equalFun s a@(Pi dom b) m n | domFinite dom = do
mp <- fmap getPrimName <$> getBuiltin' builtinIsOne
case unEl $ unDom dom of
Def q [Apply phi]
| Just q == mp -> compareTermOnFace cmp (unArg phi) (El s (Pi (dom {domFinite = False}) b)) m n
_ -> equalFun s (Pi (dom{domFinite = False}) b) m n
equalFun _ (Pi dom@Dom{domInfo = info} b) m n | not $ domFinite dom = do
name <- freshName_ $ suggest (absName b) ("x" :: String)
addContext (name, dom) $ compareTerm cmp (absBody b) m' n'
where
(m',n') = raise 1 (m,n) `apply` [Arg info $ var 0]
equalFun _ _ _ _ = __IMPOSSIBLE__
equalPath :: PathView -> Type -> Term -> Term -> TCM ()
equalPath (PathType s _ l a x y) _ m n = do
name <- freshName_ ("i" :: String)
interval <- el primInterval
let (m',n') = raise 1 (m, n) `applyE` [IApply (raise 1 $ unArg x) (raise 1 $ unArg y) (var 0)]
addContext (name, defaultDom interval) $ compareTerm cmp (El (raise 1 s) $ (raise 1 $ unArg a) `apply` [argN $ var 0]) m' n'
equalPath OType{} a' m n = cmpDef a' m n
cmpDef a'@(El s ty) m n = do
mI <- getBuiltinName' builtinInterval
mIsOne <- getBuiltinName' builtinIsOne
mGlue <- getPrimitiveName' builtinGlue
mSub <- getBuiltinName' builtinSub
case ty of
Def q es | Just q == mIsOne -> return ()
Def q es | Just q == mGlue, Just args@(l:_:a:phi:_) <- allApplyElims es -> do
ty <- el' (pure $ unArg l) (pure $ unArg a)
unglue <- prim_unglue
let mkUnglue m = apply unglue $ map (setHiding Hidden) args ++ [argN m]
reportSDoc "conv.glue" 20 $ prettyTCM (ty,mkUnglue m,mkUnglue n)
compareTermOnFace cmp (unArg phi) ty m n
compareTerm cmp ty (mkUnglue m) (mkUnglue n)
Def q es | Just q == mSub, Just args@(l:a:_) <- allApplyElims es -> do
ty <- el' (pure $ unArg l) (pure $ unArg a)
out <- primSubOut
let mkOut m = apply out $ map (setHiding Hidden) args ++ [argN m]
compareTerm cmp ty (mkOut m) (mkOut n)
Def q [] | Just q == mI -> compareInterval cmp a' m n
_ -> compareAtom cmp a' m n
compareTel :: Type -> Type ->
Comparison -> Telescope -> Telescope -> TCM ()
compareTel t1 t2 cmp tel1 tel2 =
verboseBracket "tc.conv.tel" 20 "compareTel" $
catchConstraint (TelCmp t1 t2 cmp tel1 tel2) $ case (tel1, tel2) of
(EmptyTel, EmptyTel) -> return ()
(EmptyTel, _) -> bad
(_, EmptyTel) -> bad
(ExtendTel dom1 tel1, ExtendTel dom2 tel2) -> do
compareDom cmp dom1 dom2 tel1 tel2 bad bad $
compareTel t1 t2 cmp (absBody tel1) (absBody tel2)
where
bad = typeError $ UnequalTypes cmp t2 t1
etaInequal :: Comparison -> Type -> Term -> Term -> TCM ()
etaInequal cmp t m n = do
let inequal = typeError $ UnequalTerms cmp m n t
dontKnow = do
reportSDoc "tc.conv.inequal" 20 $ hsep
[ "etaInequal: postponing "
, prettyTCM m
, " != "
, prettyTCM n
]
patternViolation
flip (ifBlockedType t) (\ _ _ -> inequal) $ \ _ _ -> do
case (m, n) of
(Con{}, _) -> dontKnow
(_, Con{}) -> dontKnow
(Lam{}, _) -> dontKnow
(_, Lam{}) -> dontKnow
_ -> inequal
compareAtomDir :: CompareDirection -> Type -> Term -> Term -> TCM ()
compareAtomDir dir a = dirToCmp (`compareAtom` a) dir
computeElimHeadType :: QName -> Elims -> Elims -> TCM Type
computeElimHeadType f es es' = do
def <- getConstInfo f
if projectionArgs (theDef def) <= 0 then return $ defType def else do
let arg = case (es, es') of
(Apply arg : _, _) -> arg
(_, Apply arg : _) -> arg
_ -> __IMPOSSIBLE__
reportSDoc "tc.conv.infer" 30 $
"inferring type of internal arg: " <+> prettyTCM arg
targ <- infer $ unArg arg
reportSDoc "tc.conv.infer" 30 $
"inferred type: " <+> prettyTCM targ
fromMaybeM patternViolation $ getDefType f =<< reduce targ
compareAtom :: Comparison -> Type -> Term -> Term -> TCM ()
compareAtom cmp t m n =
verboseBracket "tc.conv.atom" 20 "compareAtom" $
catchConstraint (ValueCmp cmp t m n) $ do
reportSDoc "tc.conv.atom" 50 $
"compareAtom" <+> fsep [ prettyTCM m <+> prettyTCM cmp
, prettyTCM n
, ":" <+> prettyTCM t ]
(mb',nb') <- ifM (asksTC envCompareBlocked) ((notBlocked -*- notBlocked) <$> reduce (m,n)) $ do
mb' <- etaExpandBlocked =<< reduceB m
nb' <- etaExpandBlocked =<< reduceB n
return (mb', nb')
(mb'', nb'') <- case (ignoreBlocking mb', ignoreBlocking nb') of
(Lit _, Lit _) -> return (mb', nb')
_ -> (,) <$> traverse constructorForm mb'
<*> traverse constructorForm nb'
mb <- traverse unLevel mb''
nb <- traverse unLevel nb''
let m = ignoreBlocking mb
n = ignoreBlocking nb
postpone = addConstraint $ ValueCmp cmp t m n
checkSyntacticEquality =
ifNotM (optSyntacticEquality <$> pragmaOptions) postpone $ do
n <- normalise n
m <- normalise m
if m == n
then return ()
else postpone
dir = fromCmp cmp
rid = flipCmp dir
assign dir x es v = assignE dir x es v $ compareAtomDir dir t
reportSDoc "tc.conv.atom" 30 $
"compareAtom" <+> fsep [ prettyTCM mb <+> prettyTCM cmp
, prettyTCM nb
, ":" <+> prettyTCM t ]
reportSDoc "tc.conv.atom" 80 $
"compareAtom" <+> fsep [ (text . show) mb <+> prettyTCM cmp
, (text . show) nb
, ":" <+> (text . show) t ]
case (mb, nb) of
(NotBlocked _ (MetaV x xArgs), NotBlocked _ (MetaV y yArgs))
| x == y ->
case intersectVars xArgs yArgs of
Just kills -> do
killResult <- killArgs kills x
case killResult of
NothingToPrune -> return ()
PrunedEverything -> return ()
PrunedNothing -> postpone
PrunedSomething -> postpone
Nothing -> checkSyntacticEquality
| otherwise -> do
[p1, p2] <- mapM getMetaPriority [x,y]
let (solve1, solve2)
| (p1, x) > (p2, y) = (l1, r2)
| otherwise = (r1, l2)
where l1 = assign dir x xArgs n
r1 = assign rid y yArgs m
l2 = ifM (isInstantiatedMeta x) (compareTermDir dir t m n) l1
r2 = ifM (isInstantiatedMeta y) (compareTermDir rid t n m) r1
try m h = m `catchError_` \err -> case err of
PatternErr{} -> h
_ -> throwError err
try solve1 solve2
(NotBlocked _ (MetaV x es), _) -> assign dir x es n
(_, NotBlocked _ (MetaV x es)) -> assign rid x es m
(Blocked{}, Blocked{}) -> checkSyntacticEquality
(Blocked{}, _) -> useInjectivity (fromCmp cmp) t m n
(_, Blocked{}) -> useInjectivity (flipCmp $ fromCmp cmp) t n m
_ -> do
case (m, n) of
(Pi{}, Pi{}) -> equalFun m n
(Sort s1, Sort s2) -> compareSort CmpEq s1 s2
(Lit l1, Lit l2) | l1 == l2 -> return ()
(Var i es, Var i' es') | i == i' -> do
a <- typeOfBV i
compareElims [] [] a (var i) es es'
(Def f es, Def f' es') -> do
unlessM (bothAbsurd f f') $ do
if f /= f' then trySizeUniv cmp t m n f es f' es' else do
unless (null es && null es') $ do
unlessM (compareEtaPrims f es es') $ do
a <- computeElimHeadType f es es'
pol <- getPolarity' cmp f
compareElims pol [] a (Def f []) es es'
(Con x ci xArgs, Con y _ yArgs)
| x == y -> do
a' <- conType x t
forcedArgs <- getForcedArgs $ conName x
compareElims (repeat $ polFromCmp cmp) forcedArgs a' (Con x ci []) xArgs yArgs
_ -> etaInequal cmp t m n
where
compareEtaPrims :: QName -> Elims -> Elims -> TCM Bool
compareEtaPrims q es es' = do
munglue <- getPrimitiveName' builtin_unglue
msubout <- getPrimitiveName' builtinSubOut
case () of
_ | Just q == munglue -> compareUnglueApp q es es'
_ | Just q == msubout -> compareSubApp q es es'
_ -> return False
compareSubApp q es es' = do
let (as,bs) = splitAt 5 es; (as',bs') = splitAt 5 es'
case (allApplyElims as, allApplyElims as') of
(Just [a,bA,phi,u,x], Just [a',bA',phi',u',x']) -> do
tSub <- primSub
equalType (El Inf $ apply tSub $ [a] ++ map (setHiding NotHidden) [bA,phi,u])
(El Inf $ apply tSub $ [a] ++ map (setHiding NotHidden) [bA',phi',u'])
compareAtom cmp (El Inf $ apply tSub $ [a] ++ map (setHiding NotHidden) [bA,phi,u])
(unArg x) (unArg x')
compareElims [] [] (El (tmSort (unArg a)) (unArg bA)) (Def q as) bs bs'
return True
_ -> return False
compareUnglueApp q es es' = do
let (as,bs) = splitAt 7 es; (as',bs') = splitAt 7 es'
case (allApplyElims as, allApplyElims as') of
(Just [la,lb,bA,phi,bT,e,b], Just [la',lb',bA',phi',bT',e',b']) -> do
tGlue <- getPrimitiveTerm builtinGlue
compareAtom cmp (El (tmSort (unArg lb)) $ apply tGlue $ [la,lb] ++ map (setHiding NotHidden) [bA,phi,bT,e])
(unArg b) (unArg b')
compareElims [] [] (El (tmSort (unArg la)) (unArg bA)) (Def q as) bs bs'
return True
_ -> return False
conType c t = ifBlockedType t (\ _ _ -> patternViolation) $ \ _ t -> do
let impossible = do
reportSDoc "impossible" 10 $
"expected data/record type, found " <+> prettyTCM t
reportSDoc "impossible" 70 $ nest 2 $ "raw =" <+> pretty t
patternViolation
maybe impossible (return . snd) =<< getFullyAppliedConType c t
equalFun t1 t2 = case (t1, t2) of
(Pi dom1 b1, Pi dom2 b2) -> do
verboseBracket "tc.conv.fun" 15 "compare function types" $ do
reportSDoc "tc.conv.fun" 20 $ nest 2 $ vcat
[ "t1 =" <+> prettyTCM t1
, "t2 =" <+> prettyTCM t2 ]
compareDom cmp dom2 dom1 b1 b2 errH errR $
compareType cmp (absBody b1) (absBody b2)
where
errH = typeError $ UnequalHiding t1 t2
errR = typeError $ UnequalRelevance cmp t1 t2
_ -> __IMPOSSIBLE__
compareDom :: Free c
=> Comparison
-> Dom Type
-> Dom Type
-> Abs b
-> Abs c
-> TCM ()
-> TCM ()
-> TCM ()
-> TCM ()
compareDom cmp dom1@(Dom{domInfo = i1, unDom = a1}) dom2@(Dom{domInfo = i2, unDom = a2}) b1 b2 errH errR cont
| not (sameHiding dom1 dom2) = errH
| not $ compareRelevance cmp (getRelevance dom1) (getRelevance dom2) = errR
| otherwise = do
let r = max (getRelevance dom1) (getRelevance dom2)
dependent = (r /= Irrelevant) && isBinderUsed b2
pid <- newProblem_ $ compareType cmp a1 a2
dom <- if dependent
then (\ a -> dom1 {unDom = a}) <$> blockTypeOnProblem a1 pid
else return dom1
name <- freshName_ $ suggest b1 b2
addContext (name, dom) $ cont
stealConstraints pid
compareRelevance :: Comparison -> Relevance -> Relevance -> Bool
compareRelevance CmpEq = (==)
compareRelevance CmpLeq = (<=)
antiUnify :: ProblemId -> Type -> Term -> Term -> TCM Term
antiUnify pid a u v = do
((u, v), eq) <- SynEq.checkSyntacticEquality u v
if eq then return u else do
(u, v) <- reduce (u, v)
case (u, v) of
(Pi ua ub, Pi va vb) -> do
wa0 <- antiUnifyType pid (unDom ua) (unDom va)
let wa = wa0 <$ ua
wb <- addContext wa $ antiUnifyType pid (unAbs ub) (unAbs vb)
return $ Pi wa (wb <$ ub)
(Lam i u, Lam _ v) ->
case unEl a of
Pi a b -> Lam i . (<$ u) <$> addContext a (antiUnify pid (unAbs b) (unAbs u) (unAbs v))
_ -> fallback
(Var i us, Var j vs) | i == j -> maybeGiveUp $ do
a <- typeOfBV i
antiUnifyElims pid a (var i) us vs
(Con x ci us, Con y _ vs) | x == y -> maybeGiveUp $ do
a <- maybe patternViolation (return . snd) =<< getConType x a
antiUnifyElims pid a (Con x ci []) us vs
(Def f us, Def g vs) | f == g, length us == length vs -> maybeGiveUp $ do
a <- computeElimHeadType f us vs
antiUnifyElims pid a (Def f []) us vs
_ -> fallback
where
fallback = blockTermOnProblem a u pid
maybeGiveUp m = m `catchError_` \ err ->
case err of
PatternErr{} -> fallback
_ -> throwError err
antiUnifyType :: ProblemId -> Type -> Type -> TCM Type
antiUnifyType pid (El s a) (El _ b) = El s <$> antiUnify pid (sort s) a b
antiUnifyElims :: ProblemId -> Type -> Term -> Elims -> Elims -> TCM Term
antiUnifyElims pid a self [] [] = return self
antiUnifyElims pid a self (Proj o f : es1) (Proj _ g : es2) | f == g = do
res <- projectTyped self a o f
case res of
Just (_, self, a) -> antiUnifyElims pid a self es1 es2
Nothing -> patternViolation
antiUnifyElims pid a self (Apply u : es1) (Apply v : es2) = do
case unEl a of
Pi a b -> do
w <- antiUnify pid (unDom a) (unArg u) (unArg v)
antiUnifyElims pid (b `lazyAbsApp` w) (apply self [w <$ u]) es1 es2
_ -> patternViolation
antiUnifyElims _ _ _ _ _ = patternViolation
compareElims :: [Polarity] -> [IsForced] -> Type -> Term -> [Elim] -> [Elim] -> TCM ()
compareElims pols0 fors0 a v els01 els02 = catchConstraint (ElimCmp pols0 fors0 a v els01 els02) $ do
let v1 = applyE v els01
v2 = applyE v els02
failure = typeError $ UnequalTerms CmpEq v1 v2 a
unless (null els01) $ do
reportSDoc "tc.conv.elim" 25 $ "compareElims" $$ do
nest 2 $ vcat
[ "a =" <+> prettyTCM a
, "pols0 (truncated to 10) =" <+> sep (map prettyTCM $ take 10 pols0)
, "fors0 (truncated to 10) =" <+> sep (map prettyTCM $ take 10 fors0)
, "v =" <+> prettyTCM v
, "els01 =" <+> prettyTCM els01
, "els02 =" <+> prettyTCM els02
]
case (els01, els02) of
([] , [] ) -> return ()
([] , Proj{}:_ ) -> failure
(Proj{} : _, [] ) -> failure
([] , Apply{} : _) -> failure
(Apply{} : _, [] ) -> failure
([] , IApply{} : _) -> failure
(IApply{} : _, [] ) -> failure
(Apply{} : _, Proj{} : _) -> __IMPOSSIBLE__ <$ solveAwakeConstraints' True
(Proj{} : _, Apply{} : _) -> __IMPOSSIBLE__ <$ solveAwakeConstraints' True
(IApply{} : _, Proj{} : _) -> __IMPOSSIBLE__ <$ solveAwakeConstraints' True
(Proj{} : _, IApply{} : _) -> __IMPOSSIBLE__ <$ solveAwakeConstraints' True
(IApply{} : _, Apply{} : _) -> __IMPOSSIBLE__ <$ solveAwakeConstraints' True
(Apply{} : _, IApply{} : _) -> __IMPOSSIBLE__ <$ solveAwakeConstraints' True
(e@(IApply x1 y1 r1) : els1, IApply x2 y2 r2 : els2) -> do
reportSDoc "tc.conv.elim" 25 $ "compareElims IApply"
let (pol, pols) = nextPolarity pols0
ifBlockedType a (\ m t -> patternViolation) $ \ _ a -> do
va <- pathView a
reportSDoc "tc.conv.elim.iapply" 60 $ "compareElims IApply" $$ do
nest 2 $ "va =" <+> text (show (isPathType va))
case va of
PathType s path l bA x y -> do
b <- elInf primInterval
compareWithPol pol (flip compareTerm b)
r1 r2
let r = r1
codom <- el' (pure . unArg $ l) ((pure . unArg $ bA) <@> pure r)
compareElims pols [] codom
(applyE v [e]) els1 els2
OType t@(El _ Pi{}) -> compareElims pols0 fors0 t v (Apply (defaultArg r1) : els1) (Apply (defaultArg r2) : els2)
OType{} -> patternViolation
(Apply arg1 : els1, Apply arg2 : els2) ->
verboseBracket "tc.conv.elim" 20 "compare Apply" $ do
reportSDoc "tc.conv.elim" 10 $ nest 2 $ vcat
[ "a =" <+> prettyTCM a
, "v =" <+> prettyTCM v
, "arg1 =" <+> prettyTCM arg1
, "arg2 =" <+> prettyTCM arg2
]
reportSDoc "tc.conv.elim" 50 $ nest 2 $ vcat
[ "raw:"
, "a =" <+> pretty a
, "v =" <+> pretty v
, "arg1 =" <+> pretty arg1
, "arg2 =" <+> pretty arg2
]
let (pol, pols) = nextPolarity pols0
(for, fors) = nextIsForced fors0
ifBlockedType a (\ m t -> patternViolation) $ \ _ a -> do
reportSLn "tc.conv.elim" 90 $ "type is not blocked"
case unEl a of
(Pi (Dom{domInfo = info, unDom = b}) codom) -> do
reportSLn "tc.conv.elim" 90 $ "type is a function type"
mlvl <- tryMaybe primLevel
let freeInCoDom (Abs _ c) = 0 `freeInIgnoringSorts` c
freeInCoDom _ = False
dependent = (Just (unEl b) /= mlvl) && freeInCoDom codom
pid <- newProblem_ $ applyModalityToContext info $
if isForced for then
reportSLn "tc.conv.elim" 90 $ "argument is forced"
else if isIrrelevant info then do
reportSLn "tc.conv.elim" 90 $ "argument is irrelevant"
compareIrrelevant b (unArg arg1) (unArg arg2)
else do
reportSLn "tc.conv.elim" 90 $ "argument has polarity " ++ show pol
compareWithPol pol (flip compareTerm b)
(unArg arg1) (unArg arg2)
solved <- isProblemSolved pid
reportSLn "tc.conv.elim" 90 $ "solved = " ++ show solved
arg <- if dependent && not solved
then do
arg <- (arg1 $>) <$> antiUnify pid b (unArg arg1) (unArg arg2)
reportSDoc "tc.conv.elims" 30 $ hang "Anti-unification:" 2 (prettyTCM arg)
reportSDoc "tc.conv.elims" 70 $ nest 2 $ "raw:" <+> pretty arg
return arg
else return arg1
compareElims pols fors (codom `lazyAbsApp` unArg arg) (apply v [arg]) els1 els2
reportSLn "tc.conv.elim" 90 $ "stealing constraints from problem " ++ show pid
stealConstraints pid
a -> do
reportSDoc "impossible" 10 $
"unexpected type when comparing apply eliminations " <+> prettyTCM a
reportSDoc "impossible" 50 $ "raw type:" <+> pretty a
patternViolation
(Proj o f : els1, Proj _ f' : els2)
| f /= f' -> typeError . GenericError . show =<< prettyTCM f <+> "/=" <+> prettyTCM f'
| otherwise -> ifBlockedType a (\ m t -> patternViolation) $ \ _ a -> do
res <- projectTyped v a o f
case res of
Just (_, u, t) -> do
compareElims [] [] t u els1 els2
Nothing -> do
reportSDoc "tc.conv.elims" 30 $ sep
[ text $ "projection " ++ show f
, text "applied to value " <+> prettyTCM v
, text "of unexpected type " <+> prettyTCM a
]
patternViolation
compareIrrelevant :: Type -> Term -> Term -> TCM ()
compareIrrelevant t v w = do
reportSDoc "tc.conv.irr" 20 $ vcat
[ "compareIrrelevant"
, nest 2 $ "v =" <+> prettyTCM v
, nest 2 $ "w =" <+> prettyTCM w
]
reportSDoc "tc.conv.irr" 50 $ vcat
[ nest 2 $ "v =" <+> pretty v
, nest 2 $ "w =" <+> pretty w
]
try v w $ try w v $ return ()
where
try (MetaV x es) w fallback = do
mv <- lookupMeta x
let rel = getMetaRelevance mv
inst = case mvInstantiation mv of
InstV{} -> True
_ -> False
reportSDoc "tc.conv.irr" 20 $ vcat
[ nest 2 $ text $ "rel = " ++ show rel
, nest 2 $ "inst =" <+> pretty inst
]
if not (isIrrelevant rel) || inst
then fallback
else (assignE DirEq x es w $ compareIrrelevant t) `catchError` \ _ -> fallback
try v w fallback = fallback
compareWithPol :: Polarity -> (Comparison -> a -> a -> TCM ()) -> a -> a -> TCM ()
compareWithPol Invariant cmp x y = cmp CmpEq x y
compareWithPol Covariant cmp x y = cmp CmpLeq x y
compareWithPol Contravariant cmp x y = cmp CmpLeq y x
compareWithPol Nonvariant cmp x y = return ()
polFromCmp :: Comparison -> Polarity
polFromCmp CmpLeq = Covariant
polFromCmp CmpEq = Invariant
compareArgs :: [Polarity] -> [IsForced] -> Type -> Term -> Args -> Args -> TCM ()
compareArgs pol for a v args1 args2 =
compareElims pol for a v (map Apply args1) (map Apply args2)
compareType :: Comparison -> Type -> Type -> TCM ()
compareType cmp ty1@(El s1 a1) ty2@(El s2 a2) =
verboseBracket "tc.conv.type" 20 "compareType" $
catchConstraint (TypeCmp cmp ty1 ty2) $ do
reportSDoc "tc.conv.type" 50 $ vcat
[ "compareType" <+> sep [ prettyTCM ty1 <+> prettyTCM cmp
, prettyTCM ty2 ]
, hsep [ " sorts:", prettyTCM s1, " and ", prettyTCM s2 ]
]
compareSort CmpEq s1 s2 `catchError` \err -> case err of
TypeError _ e -> do
reportSDoc "tc.conv.type" 30 $ vcat
[ "sort comparison failed"
, nest 2 $ vcat
[ "s1 =" <+> prettyTCM s1
, "s2 =" <+> prettyTCM s2
]
]
compareTerm cmp (sort s1) a1 a2
compareSort CmpEq s1 s2
_ -> throwError err
compareTerm cmp (sort s1) a1 a2
return ()
leqType :: Type -> Type -> TCM ()
leqType = compareType CmpLeq
coerce :: Comparison -> Term -> Type -> Type -> TCM Term
coerce cmp v t1 t2 = blockTerm t2 $ do
verboseS "tc.conv.coerce" 10 $ do
(a1,a2) <- reify (t1,t2)
let dbglvl = if isSet a1 && isSet a2 then 50 else 10
reportSDoc "tc.conv.coerce" dbglvl $
"coerce" <+> vcat
[ "term v =" <+> prettyTCM v
, "from type t1 =" <+> prettyTCM a1
, "to type t2 =" <+> prettyTCM a2
, "comparison =" <+> prettyTCM cmp
]
reportSDoc "tc.conv.coerce" 70 $
"coerce" <+> vcat
[ "term v =" <+> pretty v
, "from type t1 =" <+> pretty t1
, "to type t2 =" <+> pretty t2
, "comparison =" <+> pretty cmp
]
TelV tel1 b1 <- telViewUpTo' (-1) notVisible t1
TelV tel2 b2 <- telViewUpTo' (-1) notVisible t2
let n = size tel1 - size tel2
if n <= 0 then fallback else do
ifBlockedType b2 (\ _ _ -> fallback) $ \ _ _ -> do
(args, t1') <- implicitArgs n notVisible t1
let v' = v `apply` args
v' <$ coerceSize (compareType cmp) v' t1' t2
where
fallback = v <$ coerceSize (compareType cmp) v t1 t2
coerceSize :: (Type -> Type -> TCM ()) -> Term -> Type -> Type -> TCM ()
coerceSize leqType v t1 t2 = workOnTypes $ do
reportSDoc "tc.conv.coerce" 70 $
"coerceSize" <+> vcat
[ "term v =" <+> pretty v
, "from type t1 =" <+> pretty t1
, "to type t2 =" <+> pretty t2
]
let fallback = leqType t1 t2
done = caseMaybeM (isSizeType t1) fallback $ \ _ -> return ()
caseMaybeM (isSizeType t2) fallback $ \ b2 -> do
mv <- sizeMaxView v
if any (\case{ DOtherSize{} -> True; _ -> False }) mv then fallback else do
unlessM (tryConversion $ dontAssignMetas $ leqType t1 t2) $ do
reportSDoc "tc.conv.coerce" 20 $ "coercing to a size type"
case b2 of
BoundedNo -> done
BoundedLt v2 -> do
sv2 <- sizeView v2
case sv2 of
SizeInf -> done
OtherSize{} -> do
vinc <- sizeSuc 1 v
compareSizes CmpLeq vinc v2
done
SizeSuc a2 -> do
compareSizes CmpLeq v a2
done
compareLevel :: Comparison -> Level -> Level -> TCM ()
compareLevel CmpLeq u v = leqLevel u v
compareLevel CmpEq u v = equalLevel u v
compareSort :: Comparison -> Sort -> Sort -> TCM ()
compareSort CmpEq = equalSort
compareSort CmpLeq = leqSort
leqSort :: Sort -> Sort -> TCM ()
leqSort s1 s2 = catchConstraint (SortCmp CmpLeq s1 s2) $ do
(s1,s2) <- reduce (s1,s2)
let postpone = addConstraint (SortCmp CmpLeq s1 s2)
no = typeError $ NotLeqSort s1 s2
yes = return ()
reportSDoc "tc.conv.sort" 30 $
sep [ "leqSort"
, nest 2 $ fsep [ prettyTCM s1 <+> "=<"
, prettyTCM s2 ]
]
propEnabled <- isPropEnabled
let fvsRHS = IntSet.toList $ allFreeVars s2
badRigid <- s1 `rigidVarsNotContainedIn` fvsRHS
case (s1, s2) of
(DummyS s, _) -> impossibleSort s
(_, DummyS s) -> impossibleSort s
(Type a , Type b ) -> leqLevel a b
(Prop a , Prop b ) -> leqLevel a b
(Prop a , Type b ) -> leqLevel a b
(Type a , Prop b ) -> no
(_ , Inf ) -> yes
(Inf , _ ) -> equalSort s1 s2
(_ , SizeUniv) -> equalSort s1 s2
(_ , Prop (Max [])) -> equalSort s1 s2
(_ , Type (Max []))
| not propEnabled -> equalSort s1 s2
(SizeUniv, Type{} ) -> no
(SizeUniv, Prop{} ) -> no
(_ , _ ) | badRigid -> equalSort s2 Inf
(UnivSort Inf , UnivSort Inf) -> yes
(PiSort{}, _ ) -> postpone
(_ , PiSort{}) -> postpone
(UnivSort{}, _ ) -> postpone
(_ , UnivSort{}) -> postpone
(MetaS{} , _ ) -> postpone
(_ , MetaS{} ) -> postpone
(DefS d es , DefS d' es') | d == d' -> postpone
(DefS{} , _ ) -> no
(_ , DefS{}) -> no
where
impossibleSort s = do
reportSLn "impossible" 10 $ unlines
[ "leqSort: found dummy sort with description:"
, s
]
__IMPOSSIBLE__
leqLevel :: Level -> Level -> TCM ()
leqLevel a b = liftTCM $ do
reportSDoc "tc.conv.nat" 30 $
"compareLevel" <+>
sep [ prettyTCM a <+> "=<"
, prettyTCM b ]
a <- normalise a
b <- normalise b
leqView a b
where
leqView a@(Max as) b@(Max bs) = catchConstraint (LevelCmp CmpLeq a b) $ do
reportSDoc "tc.conv.nat" 30 $
"compareLevelView" <+>
sep [ pretty a <+> "=<"
, pretty b ]
wrap $ case (as, bs) of
_ | as == bs -> ok
([], _) -> ok
(as, []) -> sequence_ [ equalLevel' (Max [a]) (Max []) | a <- as ]
(as, [ClosedLevel 0]) -> sequence_ [ equalLevel' (Max [a]) (Max []) | a <- as ]
(as@(_:_:_), [b]) -> sequence_ [ leqView (Max [a]) (Max [b]) | a <- as ]
(as, bs) | minN > 0 -> leqView (Max $ map (subtr minN) as) (Max $ map (subtr minN) bs)
where
ns = map constant as
ms = map constant bs
minN = minimum (ns ++ ms)
(as, bs)
| not $ null subsumed -> leqView (Max $ as List.\\ subsumed) (Max bs)
where
subsumed = [ a | a@(Plus m l) <- as, n <- findN l, m <= n ]
findN a = case [ n | Plus n b <- bs, b == a ] of
[n] -> [n]
_ -> []
([ClosedLevel n], [ClosedLevel m]) -> if n <= m then ok else notok
([ClosedLevel n], bs)
| n <= maximum (map constant bs) -> ok
(as, bs)
| neutralB && maxA > maxB -> notok
| neutralB && any (\a -> neutral a && not (isInB a)) as -> notok
| neutralB && neutralA -> maybeok $ all (\a -> constant a <= findN a) as
where
maxA = maximum $ map constant as
maxB = maximum $ map constant bs
neutralA = all neutral as
neutralB = all neutral bs
isInB a = elem (unneutral a) $ map unneutral bs
findN a = case [ n | b@(Plus n _) <- bs, unneutral b == unneutral a ] of
[n] -> n
_ -> __IMPOSSIBLE__
_ -> postpone
where
ok = return ()
notok = unlessM typeInType $ typeError $ NotLeqSort (Type a) (Type b)
postpone = patternViolation
wrap m = catchError m $ \e ->
case e of
TypeError{} -> notok
_ -> throwError e
maybeok True = ok
maybeok False = notok
neutral (Plus _ NeutralLevel{}) = True
neutral _ = False
meta (Plus _ MetaLevel{}) = True
meta _ = False
unneutral (Plus _ (NeutralLevel _ v)) = v
unneutral _ = __IMPOSSIBLE__
constant (ClosedLevel n) = n
constant (Plus n _) = n
subtr m (ClosedLevel n) = ClosedLevel (n - m)
subtr m (Plus n l) = Plus (n - m) l
equalLevel :: Level -> Level -> TCM ()
equalLevel a b = do
(a, b) <- normalise (a, b)
equalLevel' a b
equalLevel' :: Level -> Level -> TCM ()
equalLevel' a b = do
reportSDoc "tc.conv.level" 50 $ sep [ "equalLevel", nest 2 $ parens $ pretty a, nest 2 $ parens $ pretty b ]
liftTCM $ catchConstraint (LevelCmp CmpEq a b) $
check a b
where
check a@(Max as) b@(Max bs) = do
as <- return $ [ a | a <- as, not $ a `isStrictlySubsumedBy` bs ]
bs <- return $ [ b | b <- bs, not $ b `isStrictlySubsumedBy` as ]
as <- return $ List.sort $ closed0 as
bs <- return $ List.sort $ closed0 bs
reportSDoc "tc.conv.level" 40 $
sep [ "equalLevel"
, vcat [ nest 2 $ sep [ prettyTCM a <+> "=="
, prettyTCM b
]
, "reduced"
, nest 2 $ sep [ prettyTCM (Max as) <+> "=="
, prettyTCM (Max bs)
]
]
]
reportSDoc "tc.conv.level" 50 $
sep [ text "equalLevel"
, vcat [ nest 2 $ sep [ pretty (Max as) <+> "=="
, pretty (Max bs)
]
]
]
case (as, bs) of
_ | as == bs -> ok
| any isBlocked (as ++ bs) -> do
lvl <- levelType
liftTCM $ addConstraint $ ValueCmp CmpEq lvl (Level a) (Level b)
([ClosedLevel n], [ClosedLevel m])
| n == m -> ok
| otherwise -> notok
([ClosedLevel{}], _) | any isNeutral bs -> notok
(_, [ClosedLevel{}]) | any isNeutral as -> notok
([ClosedLevel 0], bs@(_:_:_)) -> sequence_ [ equalLevel' (Max []) (Max [b]) | b <- bs ]
(as@(_:_:_), [ClosedLevel 0]) -> sequence_ [ equalLevel' (Max [a]) (Max []) | a <- as ]
([Plus n (MetaLevel x as)], _)
| any (isThisMeta x) bs -> postpone
(_, [Plus n (MetaLevel x bs)])
| any (isThisMeta x) as -> postpone
([Plus n (MetaLevel x as')], [Plus m (MetaLevel y bs')])
| (n, y) < (m, x) -> meta n x as' bs
| otherwise -> meta m y bs' as
([Plus n (MetaLevel x as')],_) -> meta n x as' bs
(_,[Plus m (MetaLevel y bs')]) -> meta m y bs' as
_ | any hasMeta (as ++ bs) -> postpone
_ | all isNeutralOrClosed (as ++ bs) -> do
reportSLn "tc.conv.level" 60 $ "equalLevel: all are neutral or closed"
if length as == length bs
then zipWithM_ (\a b -> [a] =!= [b]) as bs
else notok
_ -> postpone
where
a === b = unlessM typeInType $ do
lvl <- levelType
equalAtom lvl a b
as =!= bs = levelTm (Max as) === levelTm (Max bs)
ok = return ()
notok = unlessM typeInType notOk
notOk = typeError $ UnequalSorts (Type a) (Type b)
postpone = do
reportSDoc "tc.conv.level" 30 $ hang "postponing:" 2 $ hang (pretty a <+> "==") 0 (pretty b)
patternViolation
closed0 [] = [ClosedLevel 0]
closed0 as = as
meta n x as bs = do
reportSLn "tc.meta.level" 30 $ "Assigning meta level"
reportSDoc "tc.meta.level" 50 $ "meta" <+> sep [prettyList $ map pretty as, prettyList $ map pretty bs]
bs' <- mapM (subtr n) bs
assignE DirEq x as (levelTm (Max bs')) (===)
wrap m = m `catchError` \err ->
case err of
TypeError{} -> notok
_ -> throwError err
subtr n (ClosedLevel m)
| m >= n = return $ ClosedLevel (m - n)
| otherwise = ifM typeInType (return $ ClosedLevel 0) $ notOk
subtr n (Plus m a)
| m >= n = return $ Plus (m - n) a
subtr _ (Plus _ BlockedLevel{}) = postpone
subtr _ (Plus _ MetaLevel{}) = postpone
subtr _ (Plus _ NeutralLevel{}) = postpone
subtr _ (Plus _ UnreducedLevel{}) = __IMPOSSIBLE__
isNeutral (Plus _ NeutralLevel{}) = True
isNeutral _ = False
isClosed ClosedLevel{} = True
isClosed _ = False
isNeutralOrClosed l = isClosed l || isNeutral l
isBlocked (Plus _ BlockedLevel{}) = True
isBlocked _ = False
hasMeta ClosedLevel{} = False
hasMeta (Plus _ MetaLevel{}) = True
hasMeta (Plus _ (BlockedLevel _ v)) = not $ null $ allMetas v
hasMeta (Plus _ (NeutralLevel _ v)) = not $ null $ allMetas v
hasMeta (Plus _ (UnreducedLevel v)) = not $ null $ allMetas v
isThisMeta x (Plus _ (MetaLevel y _)) = x == y
isThisMeta _ _ = False
constant (ClosedLevel n) = n
constant (Plus n _) = n
(ClosedLevel m) `isStrictlySubsumedBy` [] = m == 0
(ClosedLevel m) `isStrictlySubsumedBy` ys = m < maximum (map constant ys)
(Plus m x) `isStrictlySubsumedBy` ys = not $ null $
[ n | Plus n y <- ys, x == y, m < n ]
equalSort :: Sort -> Sort -> TCM ()
equalSort s1 s2 = do
catchConstraint (SortCmp CmpEq s1 s2) $ do
(s1,s2) <- reduce (s1,s2)
let postpone = addConstraint (SortCmp CmpEq s1 s2)
yes = return ()
no = typeError $ UnequalSorts s1 s2
synEq = ifNotM (optSyntacticEquality <$> pragmaOptions) postpone $ do
((s1,s2) , equal) <- SynEq.checkSyntacticEquality s1 s2
if | equal -> yes
| otherwise -> postpone
reportSDoc "tc.conv.sort" 30 $ sep
[ "equalSort"
, vcat [ nest 2 $ fsep [ prettyTCM s1 <+> "=="
, prettyTCM s2 ]
, nest 2 $ fsep [ pretty s1 <+> "=="
, pretty s2 ]
]
]
propEnabled <- isPropEnabled
typeInTypeEnabled <- typeInType
case (s1, s2) of
(DummyS s, _) -> impossibleSort s
(_, DummyS s) -> impossibleSort s
(MetaS x es , MetaS y es')
| x == y -> synEq
| x < y -> meta y es' s1
| otherwise -> meta x es s2
(MetaS x es , _ ) -> meta x es s2
(_ , MetaS x es ) -> meta x es s1
(PiSort{} , PiSort{} ) -> synEq
(UnivSort{} , UnivSort{} ) -> synEq
(Type a , Type b ) -> equalLevel a b
(SizeUniv , SizeUniv ) -> yes
(Prop a , Prop b ) -> equalLevel a b
(Inf , Inf ) -> yes
(Type{} , Inf )
| typeInTypeEnabled -> yes
(Inf , Type{} )
| typeInTypeEnabled -> yes
(Type (Max []) , PiSort a b )
| not propEnabled -> piSortEqualsBottom set0 a b
(PiSort a b , Type (Max []))
| not propEnabled -> piSortEqualsBottom set0 a b
(Prop (Max []) , PiSort a b ) -> piSortEqualsBottom prop0 a b
(PiSort a b , Prop (Max [])) -> piSortEqualsBottom prop0 a b
(SizeUniv , PiSort a b ) ->
underAbstraction_ b $ equalSort SizeUniv
(PiSort a b , SizeUniv ) ->
underAbstraction_ b $ equalSort SizeUniv
(Prop (Max []) , UnivSort s ) -> no
(UnivSort s , Prop (Max [])) -> no
(SizeUniv , UnivSort s ) -> no
(UnivSort s , SizeUniv ) -> no
(PiSort{} , _ ) -> postpone
(_ , PiSort{} ) -> postpone
(UnivSort{} , _ ) -> postpone
(_ , UnivSort{} ) -> postpone
(DefS d es , DefS d' es') | d == d' -> synEq
(_ , _ ) -> no
where
meta x es s = do
reportSLn "tc.meta.sort" 30 $ "Assigning meta sort"
reportSDoc "tc.meta.sort" 50 $ "meta" <+> sep [pretty x, prettyList $ map pretty es, pretty s]
assignE DirEq x es (Sort s) __IMPOSSIBLE__
set0 = Type $ Max []
prop0 = Prop $ Max []
piSortEqualsBottom s0 a b = do
underAbstraction_ b $ equalSort s0
a <- reduce a
case funSort' a s0 of
Just s -> equalSort s s0
Nothing -> addConstraint $ SortCmp CmpEq (funSort a s0) s0
impossibleSort s = do
reportSLn "impossible" 10 $ unlines
[ "equalSort: found dummy sort with description:"
, s
]
__IMPOSSIBLE__
forallFaceMaps :: Term -> (Map.Map Int Bool -> MetaId -> Term -> TCM a) -> (Substitution -> TCM a) -> TCM [a]
forallFaceMaps t kb k = do
reportSDoc "conv.forall" 20 $
fsep ["forallFaceMaps"
, prettyTCM t
]
as <- decomposeInterval t
boolToI <- do
io <- primIOne
iz <- primIZero
return (\b -> if b then io else iz)
forM as $ \ (ms,ts) -> do
ifBlockeds ts (kb ms) $ \ _ _ -> do
let xs = map (id -*- boolToI) $ Map.toAscList ms
cxt <- getContext
reportSDoc "conv.forall" 20 $
fsep ["substContextN"
, prettyTCM cxt
, prettyTCM xs
]
(cxt',sigma) <- substContextN cxt xs
resolved <- forM xs (\ (i,t) -> (,) <$> lookupBV i <*> return (applySubst sigma t))
updateContext sigma (const cxt') $
addBindings resolved $ do
cl <- buildClosure ()
tel <- getContextTelescope
m <- currentModule
sub <- getModuleParameterSub m
reportSLn "conv.forall" 10 $ unlines [replicate 10 '-'
, show (envCurrentModule $ clEnv cl)
, show (envLetBindings $ clEnv cl)
, show tel
, show sigma
, show m
, show sub]
k sigma
where
ifBlockeds ts blocked unblocked = do
and <- getPrimitiveTerm "primIMin"
io <- primIOne
let t = foldr (\ x r -> and `apply` [argN x,argN r]) io ts
ifBlocked t blocked unblocked
addBindings [] m = m
addBindings ((Dom{domInfo = info,unDom = (nm,ty)},t):bs) m = addLetBinding info nm t ty (addBindings bs m)
substContextN :: Context -> [(Int,Term)] -> TCM (Context , Substitution)
substContextN c [] = return (c, idS)
substContextN c ((i,t):xs) = do
(c', sigma) <- substContext i t c
(c'', sigma') <- substContextN c' (map (subtract 1 -*- applySubst sigma) xs)
return (c'', applySubst sigma' sigma)
substContext :: Int -> Term -> Context -> TCM (Context , Substitution)
substContext i t [] = __IMPOSSIBLE__
substContext i t (x:xs) | i == 0 = return $ (xs , singletonS 0 t)
substContext i t (x:xs) | i > 0 = do
reportSDoc "conv.forall" 20 $
fsep ["substContext"
, text (show (i-1))
, prettyTCM t
, prettyTCM xs
]
(c,sigma) <- substContext (i-1) t xs
let e = applySubst sigma x
return (e:c, liftS 1 sigma)
substContext i t (x:xs) = __IMPOSSIBLE__
compareInterval :: Comparison -> Type -> Term -> Term -> TCM ()
compareInterval cmp i t u = do
reportSDoc "tc.conv.interval" 15 $
sep [ "{ compareInterval" <+> prettyTCM t <+> "=" <+> prettyTCM u ]
tb <- reduceB t
ub <- reduceB u
let t = ignoreBlocking tb
u = ignoreBlocking ub
it <- decomposeInterval' t
iu <- decomposeInterval' u
case () of
_ | blockedOrMeta tb || blockedOrMeta ub -> do
interval <- elInf $ primInterval
compareAtom CmpEq interval t u
_ | otherwise -> do
x <- leqInterval it iu
y <- leqInterval iu it
let final = isCanonical it && isCanonical iu
if x && y then reportSDoc "tc.conv.interval" 15 $ "Ok! }" else
if final then typeError $ UnequalTerms cmp t u i
else do
reportSDoc "tc.conv.interval" 15 $ "Giving up! }"
patternViolation
where
blockedOrMeta Blocked{} = True
blockedOrMeta (NotBlocked _ (MetaV{})) = True
blockedOrMeta _ = False
type Conj = (Map.Map Int (Set.Set Bool),[Term])
isCanonical :: [Conj] -> Bool
isCanonical = all (null . snd)
leqInterval :: [Conj] -> [Conj] -> TCM Bool
leqInterval r q =
and <$> forM r (\ r_i ->
or <$> forM q (\ q_j -> leqConj r_i q_j))
leqConj :: Conj -> Conj -> TCM Bool
leqConj (rs,rst) (qs,qst) = do
case toSet qs `Set.isSubsetOf` toSet rs of
False -> return False
True -> do
interval <- elInf $ primInterval
let eqT t u = tryConversion (compareAtom CmpEq interval t u)
let listSubset ts us = and <$> forM ts (\ t ->
or <$> forM us (\ u -> eqT t u))
listSubset qst rst
where
toSet m = Set.fromList [ (i,b) | (i,bs) <- Map.toList m, b <- Set.toList bs]
equalTermOnFace :: Term -> Type -> Term -> Term -> TCM ()
equalTermOnFace = compareTermOnFace CmpEq
compareTermOnFace :: Comparison -> Term -> Type -> Term -> Term -> TCM ()
compareTermOnFace = compareTermOnFace' compareTerm
compareTermOnFace' :: (Comparison -> Type -> Term -> Term -> TCM ()) -> Comparison -> Term -> Type -> Term -> Term -> TCM ()
compareTermOnFace' k cmp phi ty u v = do
phi <- reduce phi
_ <- forallFaceMaps phi postponed
$ \ alpha -> k cmp (applySubst alpha ty) (applySubst alpha u) (applySubst alpha v)
return ()
where
postponed ms i psi = do
phi <- runNamesT [] $ do
imin <- cl $ getPrimitiveTerm "primIMin"
ineg <- cl $ getPrimitiveTerm "primINeg"
psi <- open psi
let phi = foldr (\ (i,b) r -> do i <- open (var i); pure imin <@> (if b then i else pure ineg <@> i) <@> r)
psi (Map.toList ms)
phi
addConstraint (ValueCmpOnFace cmp phi ty u v)
bothAbsurd :: QName -> QName -> TCM Bool
bothAbsurd f f'
| isAbsurdLambdaName f, isAbsurdLambdaName f' = do
def <- getConstInfo f
def' <- getConstInfo f'
case (theDef def, theDef def') of
(Function{ funClauses = [Clause{ clauseBody = Nothing }] },
Function{ funClauses = [Clause{ clauseBody = Nothing }] }) -> return True
_ -> return False
| otherwise = return False