{-# LANGUAGE MultiParamTypeClasses, FlexibleInstances, DeriveFunctor, PatternGuards #-} module Idris.ElabDecls where import Idris.AbsSyntax import Idris.DSL import Idris.Error import Idris.Delaborate import Idris.Imports import Idris.ElabTerm import Idris.Coverage import Idris.DataOpts import Idris.Providers import Idris.Primitives import Idris.Inliner import Idris.PartialEval import IRTS.Lang import Paths_idris import Core.TT import Core.Elaborate hiding (Tactic(..)) import Core.Evaluate import Core.Execute import Core.Typecheck import Core.CaseTree import Control.Monad import Control.Monad.State import Data.List import Data.Maybe import Debug.Trace recheckC fc env t = do -- t' <- applyOpts (forget t) (doesn't work, or speed things up...) ctxt <- getContext (tm, ty, cs) <- tclift $ case recheck ctxt env (forget t) t of Error e -> tfail (At fc e) OK x -> return x addConstraints fc cs return (tm, ty) checkDef fc ns = do ctxt <- getContext mapM (\(n, t) -> do (t', _) <- recheckC fc [] t return (n, t')) ns -- | Elaborate a top-level type declaration - for example, "foo : Int -> Int". elabType :: ElabInfo -> SyntaxInfo -> String -> FC -> FnOpts -> Name -> PTerm -> Idris () elabType info syn doc fc opts n ty' = {- let ty' = piBind (params info) ty_in n = liftname info n_in in -} do checkUndefined fc n ctxt <- getContext i <- getIState logLvl 3 $ show n ++ " pre-type " ++ showImp Nothing True False ty' ty' <- addUsingConstraints syn fc ty' ty' <- implicit syn n ty' let ty = addImpl i ty' logLvl 2 $ show n ++ " type " ++ showImp Nothing True False ty ((tyT, defer, is), log) <- tclift $ elaborate ctxt n (TType (UVal 0)) [] (errAt "type of " n (erun fc (build i info False n ty))) ds <- checkDef fc defer addDeferred ds mapM_ (elabCaseBlock info opts) is ctxt <- getContext logLvl 5 $ "Rechecking" logLvl 6 $ show tyT (cty, _) <- recheckC fc [] tyT addStatics n cty ty' logLvl 6 $ "Elaborated to " ++ showEnvDbg [] tyT logLvl 2 $ "Rechecked to " ++ show cty let nty = cty -- normalise ctxt [] cty -- if the return type is something coinductive, freeze the definition let nty' = normalise ctxt [] nty let (t, _) = unApply (getRetTy nty') let corec = case t of P _ rcty _ -> case lookupCtxt rcty (idris_datatypes i) of [TI _ True _] -> True _ -> False _ -> False let opts' = if corec then (Coinductive : opts) else opts ds <- checkDef fc [(n, nty)] addIBC (IBCDef n) addDeferred ds setFlags n opts' addDocStr n doc addIBC (IBCDoc n) addIBC (IBCFlags n opts') when (Implicit `elem` opts) $ do addCoercion n addIBC (IBCCoercion n) when corec $ do setAccessibility n Frozen addIBC (IBCAccess n Frozen) elabPostulate :: ElabInfo -> SyntaxInfo -> String -> FC -> FnOpts -> Name -> PTerm -> Idris () elabPostulate info syn doc fc opts n ty = do elabType info syn doc fc opts n ty -- make sure it's collapsible, so it is never needed at run time -- start by getting the elaborated type ctxt <- getContext fty <- case lookupTy n ctxt of [] -> tclift $ tfail $ (At fc (NoTypeDecl n)) -- can't happen! [ty] -> return ty ist <- getIState let (ap, _) = unApply (getRetTy (normalise ctxt [] fty)) logLvl 5 $ "Checking collapsibility of " ++ show (ap, fty) let postOK = case ap of P _ tn _ -> case lookupCtxt tn (idris_optimisation ist) of [oi] -> collapsible oi _ -> False _ -> False when (not postOK) $ tclift $ tfail (At fc (NonCollapsiblePostulate n)) -- remove it from the deferred definitions list solveDeferred n elabData :: ElabInfo -> SyntaxInfo -> String -> FC -> Bool -> PData -> Idris () elabData info syn doc fc codata (PLaterdecl n t_in) = do iLOG (show (fc, doc)) checkUndefined fc n ctxt <- getContext i <- getIState t_in <- implicit syn n t_in let t = addImpl i t_in ((t', defer, is), log) <- tclift $ elaborate ctxt n (TType (UVal 0)) [] (erun fc (build i info False n t)) def' <- checkDef fc defer addDeferredTyCon def' mapM_ (elabCaseBlock info []) is (cty, _) <- recheckC fc [] t' logLvl 2 $ "---> " ++ show cty updateContext (addTyDecl n (TCon 0 0) cty) -- temporary, to check cons elabData info syn doc fc codata (PDatadecl n t_in dcons) = do iLOG (show fc) undef <- isUndefined fc n ctxt <- getContext i <- getIState t_in <- implicit syn n t_in let t = addImpl i t_in ((t', defer, is), log) <- tclift $ elaborate ctxt n (TType (UVal 0)) [] (errAt "data declaration " n (erun fc (build i info False n t))) def' <- checkDef fc defer addDeferredTyCon def' mapM_ (elabCaseBlock info []) is (cty, _) <- recheckC fc [] t' logLvl 2 $ "---> " ++ show cty -- temporary, to check cons when undef $ updateContext (addTyDecl n (TCon 0 0) cty) cons <- mapM (elabCon info syn n codata) dcons ttag <- getName i <- getIState let as = map (const Nothing) (getArgTys cty) let params = findParams (map snd cons) logLvl 2 $ "Parameters : " ++ show params putIState (i { idris_datatypes = addDef n (TI (map fst cons) codata params) (idris_datatypes i) }) addIBC (IBCDef n) addIBC (IBCData n) addDocStr n doc addIBC (IBCDoc n) collapseCons n cons updateContext (addDatatype (Data n ttag cty cons)) mapM_ (checkPositive n) cons where -- parameters are names which are unchanged across the structure, -- which appear exactly once in the return type of a constructor -- First, find all applications of the constructor, then check over -- them for repeated arguments findParams :: [Type] -> [Int] findParams ts = let allapps = concatMap getDataApp ts in paramPos allapps paramPos [] = [] paramPos (args : rest) = dropNothing $ keepSame (zip [0..] args) rest dropNothing [] = [] dropNothing ((x, Nothing) : ts) = dropNothing ts dropNothing ((x, _) : ts) = x : dropNothing ts keepSame :: [(Int, Maybe Name)] -> [[Maybe Name]] -> [(Int, Maybe Name)] keepSame as [] = as keepSame as (args : rest) = keepSame (update as args) rest where update [] _ = [] update _ [] = [] update ((n, Just x) : as) (Just x' : args) | x == x' = (n, Just x) : update as args update ((n, _) : as) (_ : args) = (n, Nothing) : update as args getDataApp :: Type -> [[Maybe Name]] getDataApp f@(App _ _) | (P _ d _, args) <- unApply f = if (d == n) then [mParam args args] else [] getDataApp (Bind n (Pi t) sc) = getDataApp t ++ getDataApp (instantiate (P Bound n t) sc) getDataApp _ = [] -- keep the arguments which are single names, which don't appear -- elsewhere mParam args [] = [] mParam args (P Bound n _ : rest) | count n args == 1 = Just n : mParam args rest where count n [] = 0 count n (t : ts) | n `elem` freeNames t = 1 + count n ts | otherwise = count n ts mParam args (_ : rest) = Nothing : mParam args rest -- | Elaborate primitives elabPrims :: Idris () elabPrims = do mapM_ (elabDecl EAll toplevel) (map (PData "" defaultSyntax (FC "builtin" 0) False) [inferDecl, unitDecl, falseDecl, pairDecl, eqDecl]) mapM_ elabPrim primitives -- Special case prim__believe_me because it doesn't work on just constants elabBelieveMe -- Finally, syntactic equality elabSynEq where elabPrim :: Prim -> Idris () elabPrim (Prim n ty i def sc tot) = do updateContext (addOperator n ty i (valuePrim def)) setTotality n tot i <- getIState putIState i { idris_scprims = (n, sc) : idris_scprims i } valuePrim :: ([Const] -> Maybe Const) -> [Value] -> Maybe Value valuePrim prim vals = fmap VConstant (mapM getConst vals >>= prim) getConst (VConstant c) = Just c getConst _ = Nothing p_believeMe [_,_,x] = Just x p_believeMe _ = Nothing believeTy = Bind (UN "a") (Pi (TType (UVar (-2)))) (Bind (UN "b") (Pi (TType (UVar (-2)))) (Bind (UN "x") (Pi (V 1)) (V 1))) elabBelieveMe = do let prim__believe_me = (UN "prim__believe_me") updateContext (addOperator prim__believe_me believeTy 3 p_believeMe) setTotality prim__believe_me (Partial NotCovering) i <- getIState putIState i { idris_scprims = (prim__believe_me, (3, LNoOp)) : idris_scprims i } p_synEq [t,_,x,y] | x == y = Just (VApp (VApp vnJust VErased) (VApp (VApp vnRefl t) x)) | otherwise = Just (VApp vnNothing VErased) p_synEq args = Nothing nMaybe = P (TCon 0 2) (NS (UN "Maybe") ["Maybe", "Prelude"]) Erased vnJust = VP (DCon 1 2) (NS (UN "Just") ["Maybe", "Prelude"]) VErased vnNothing = VP (DCon 0 1) (NS (UN "Nothing") ["Maybe", "Prelude"]) VErased vnRefl = VP (DCon 0 2) eqCon VErased synEqTy = Bind (UN "a") (Pi (TType (UVar (-3)))) (Bind (UN "b") (Pi (TType (UVar (-3)))) (Bind (UN "x") (Pi (V 1)) (Bind (UN "y") (Pi (V 1)) (mkApp nMaybe [mkApp (P (TCon 0 4) eqTy Erased) [V 3, V 2, V 1, V 0]])))) elabSynEq = do let synEq = UN "prim__syntactic_eq" updateContext (addOperator synEq synEqTy 4 p_synEq) setTotality synEq (Total []) i <- getIState putIState i { idris_scprims = (synEq, (4, LNoOp)) : idris_scprims i } -- | Elaborate a type provider elabProvider :: ElabInfo -> SyntaxInfo -> FC -> Name -> PTerm -> PTerm -> Idris () elabProvider info syn fc n ty tm = do i <- getIState -- Ensure that the experimental extension is enabled unless (TypeProviders `elem` idris_language_extensions i) $ fail $ "Failed to define type provider \"" ++ show n ++ "\".\nYou must turn on the TypeProviders extension." ctxt <- getContext -- First elaborate the expected type (and check that it's a type) (ty', typ) <- elabVal toplevel False ty unless (isTType typ) $ fail ("Expected a type, got " ++ show ty' ++ " : " ++ show typ) -- Elaborate the provider term to TT and check that the type matches (e, et) <- elabVal toplevel False tm unless (isProviderOf ty' et) $ fail $ "Expected provider type IO (Provider (" ++ show ty' ++ "))" ++ ", got " ++ show et ++ " instead." -- Create the top-level type declaration elabType info syn "" fc [] n ty -- Execute the type provider and normalise the result -- use 'run__provider' to convert to a primitive IO action rhs <- execute (mkApp (P Ref (UN "run__provider") Erased) [Erased, e]) let rhs' = normalise ctxt [] rhs logLvl 1 $ "Normalised " ++ show n ++ "'s RHS to " ++ show rhs -- Extract the provided term from the type provider tm <- getProvided rhs' -- Finally add a top-level definition of the provided term elabClauses info fc [] n [PClause fc n (PRef fc n) [] (delab i tm) []] logLvl 1 $ "Elaborated provider " ++ show n ++ " as: " ++ show tm where isTType :: TT Name -> Bool isTType (TType _) = True isTType _ = False isProviderOf :: TT Name -> TT Name -> Bool isProviderOf tp prov | (P _ (UN "IO") _, [prov']) <- unApply prov , (P _ (NS (UN "Provider") ["Providers"]) _, [tp']) <- unApply prov' , tp == tp' = True isProviderOf _ _ = False -- | Elaborate a type provider elabTransform :: ElabInfo -> FC -> Bool -> PTerm -> PTerm -> Idris () elabTransform info fc safe lhs_in rhs_in = do ctxt <- getContext i <- getIState let lhs = addImplPat i lhs_in ((lhs', dlhs, []), _) <- tclift $ elaborate ctxt (MN 0 "transLHS") infP [] (erun fc (buildTC i info True False (UN "transform") (infTerm lhs))) let lhs_tm = orderPats (getInferTerm lhs') let lhs_ty = getInferType lhs' let newargs = pvars i lhs_tm (clhs_tm, clhs_ty) <- recheckC fc [] lhs_tm logLvl 3 ("Transform LHS " ++ show clhs_tm) let rhs = addImplBound i (map fst newargs) rhs_in ((rhs', defer), _) <- tclift $ elaborate ctxt (MN 0 "transRHS") clhs_ty [] (do pbinds lhs_tm erun fc (build i info False (UN "transform") rhs) erun fc $ psolve lhs_tm tt <- get_term let (tm, ds) = runState (collectDeferred tt) [] return (tm, ds)) (crhs_tm, crhs_ty) <- recheckC fc [] rhs' logLvl 3 ("Transform RHS " ++ show crhs_tm) when safe $ case converts ctxt [] clhs_tm crhs_tm of OK _ -> return () Error e -> ierror (At fc (CantUnify False clhs_tm crhs_tm e [] 0)) addTrans (clhs_tm, crhs_tm) addIBC (IBCTrans (clhs_tm, crhs_tm)) elabRecord :: ElabInfo -> SyntaxInfo -> String -> FC -> Name -> PTerm -> String -> Name -> PTerm -> Idris () elabRecord info syn doc fc tyn ty cdoc cn cty = do elabData info syn doc fc False (PDatadecl tyn ty [(cdoc, cn, cty, fc)]) cty' <- implicit syn cn cty i <- getIState cty <- case lookupTy cn (tt_ctxt i) of [t] -> return (delab i t) _ -> fail "Something went inexplicably wrong" cimp <- case lookupCtxt cn (idris_implicits i) of [imps] -> return imps let ptys = getProjs [] (renameBs cimp cty) let ptys_u = getProjs [] cty let recty = getRecTy cty logLvl 6 $ show (recty, ptys) let substs = map (\ (n, _) -> (n, PApp fc (PRef fc n) [pexp (PRef fc rec)])) ptys proj_decls <- mapM (mkProj recty substs cimp) (zip ptys [0..]) let nonImp = mapMaybe isNonImp (zip cimp ptys_u) let implBinds = getImplB id cty' update_decls <- mapM (mkUpdate recty implBinds (length nonImp)) (zip nonImp [0..]) mapM_ (elabDecl EAll info) (concat proj_decls) mapM_ (tryElabDecl info) (update_decls) where -- syn = syn_in { syn_namespace = show (nsroot tyn) : syn_namespace syn_in } isNonImp (PExp _ _ _ _, a) = Just a isNonImp _ = Nothing tryElabDecl info (fn, ty, val) = do i <- getIState idrisCatch (do elabDecl' EAll info ty elabDecl' EAll info val) (\v -> do iputStrLn $ show fc ++ ":Warning - can't generate setter for " ++ show fn ++ " (" ++ show ty ++ ")" putIState i) getImplB k (PPi (Imp l s _) n Placeholder sc) = getImplB k sc getImplB k (PPi (Imp l s d) n ty sc) = getImplB (\x -> k (PPi (Imp l s d) n ty x)) sc getImplB k (PPi _ n ty sc) = getImplB k sc getImplB k _ = k renameBs (PImp _ _ _ _ _ : ps) (PPi p n ty s) = PPi p (mkImp n) ty (renameBs ps (substMatch n (PRef fc (mkImp n)) s)) renameBs (_:ps) (PPi p n ty s) = PPi p n ty (renameBs ps s) renameBs _ t = t getProjs acc (PPi _ n ty s) = getProjs ((n, ty) : acc) s getProjs acc r = reverse acc getRecTy (PPi _ n ty s) = getRecTy s getRecTy t = t rec = MN 0 "rec" mkp (UN n) = MN 0 ("p_" ++ n) mkp (MN i n) = MN i ("p_" ++ n) mkp (NS n s) = NS (mkp n) s mkImp (UN n) = UN ("implicit_" ++ n) mkImp (MN i n) = MN i ("implicit_" ++ n) mkImp (NS n s) = NS (mkImp n) s mkType (UN n) = UN ("set_" ++ n) mkType (MN i n) = MN i ("set_" ++ n) mkType (NS n s) = NS (mkType n) s mkProj recty substs cimp ((pn_in, pty), pos) = do let pn = expandNS syn pn_in let pfnTy = PTy "" defaultSyntax fc [] pn (PPi expl rec recty (substMatches substs pty)) let pls = repeat Placeholder let before = pos let after = length substs - (pos + 1) let args = take before pls ++ PRef fc (mkp pn) : take after pls let iargs = map implicitise (zip cimp args) let lhs = PApp fc (PRef fc pn) [pexp (PApp fc (PRef fc cn) iargs)] let rhs = PRef fc (mkp pn) let pclause = PClause fc pn lhs [] rhs [] return [pfnTy, PClauses fc [] pn [pclause]] implicitise (pa, t) = pa { getTm = t } mkUpdate recty k num ((pn, pty), pos) = do let setname = expandNS syn $ mkType pn let valname = MN 0 "updateval" let pt = k (PPi expl pn pty (PPi expl rec recty recty)) let pfnTy = PTy "" defaultSyntax fc [] setname pt let pls = map (\x -> PRef fc (MN x "field")) [0..num-1] let lhsArgs = pls let rhsArgs = take pos pls ++ (PRef fc valname) : drop (pos + 1) pls let before = pos let pclause = PClause fc setname (PApp fc (PRef fc setname) [pexp (PRef fc valname), pexp (PApp fc (PRef fc cn) (map pexp lhsArgs))]) [] (PApp fc (PRef fc cn) (map pexp rhsArgs)) [] return (pn, pfnTy, PClauses fc [] setname [pclause]) elabCon :: ElabInfo -> SyntaxInfo -> Name -> Bool -> (String, Name, PTerm, FC) -> Idris (Name, Type) elabCon info syn tn codata (doc, n, t_in, fc) = do checkUndefined fc n ctxt <- getContext i <- getIState t_in <- implicit syn n (if codata then mkLazy t_in else t_in) let t = addImpl i t_in logLvl 2 $ show fc ++ ":Constructor " ++ show n ++ " : " ++ showImp Nothing True False t ((t', defer, is), log) <- tclift $ elaborate ctxt n (TType (UVal 0)) [] (errAt "constructor " n (erun fc (build i info False n t))) logLvl 2 $ "Rechecking " ++ show t' def' <- checkDef fc defer addDeferred def' mapM_ (elabCaseBlock info []) is ctxt <- getContext (cty, _) <- recheckC fc [] t' let cty' = normaliseC ctxt [] cty tyIs cty' logLvl 2 $ "---> " ++ show n ++ " : " ++ show cty' addIBC (IBCDef n) addDocStr n doc addIBC (IBCDoc n) forceArgs n cty' return (n, cty') where tyIs (Bind n b sc) = tyIs sc tyIs t | (P _ n' _, _) <- unApply t = if n' /= tn then tclift $ tfail (At fc (Msg (show n' ++ " is not " ++ show tn))) else return () tyIs t = tclift $ tfail (At fc (Msg (show t ++ " is not " ++ show tn))) mkLazy (PPi pl n ty sc) = PPi (pl { plazy = True }) n ty (mkLazy sc) mkLazy t = t -- | Elaborate a collection of left-hand and right-hand pairs - that is, a -- top-level definition. elabClauses :: ElabInfo -> FC -> FnOpts -> Name -> [PClause] -> Idris () elabClauses info fc opts n_in cs = let n = liftname info n_in in do ctxt <- getContext -- Check n actually exists, with no definition yet let tys = lookupTy n ctxt let reflect = Reflection `elem` opts checkUndefined n ctxt unless (length tys > 1) $ do fty <- case tys of [] -> -- TODO: turn into a CAF if there's no arguments -- question: CAFs in where blocks? tclift $ tfail $ At fc (NoTypeDecl n) [ty] -> return ty pats_in <- mapM (elabClause info opts) (zip [0..] cs) logLvl 3 $ "Elaborated patterns:\n" ++ show pats_in -- if the return type of 'ty' is collapsible, the optimised version should -- just do nothing ist <- getIState let (ap, _) = unApply (getRetTy fty) logLvl 5 $ "Checking collapsibility of " ++ show (ap, fty) -- FIXME: Really ought to only do this for total functions! let doNothing = case ap of P _ tn _ -> case lookupCtxt tn (idris_optimisation ist) of [oi] -> collapsible oi _ -> False _ -> False solveDeferred n ist <- getIState when doNothing $ case lookupCtxt n (idris_optimisation ist) of [oi] -> do let opts = addDef n (oi { collapsible = True }) (idris_optimisation ist) putIState (ist { idris_optimisation = opts }) _ -> do let opts = addDef n (Optimise True False [] []) (idris_optimisation ist) putIState (ist { idris_optimisation = opts }) addIBC (IBCOpt n) ist <- getIState let pats = doTransforms ist pats_in -- logLvl 3 (showSep "\n" (map (\ (l,r) -> -- show l ++ " = " ++ -- show r) pats)) let tcase = opt_typecase (idris_options ist) -- Summary of what's about to happen: Definitions go: -- pats_in -> pats -> optpats -- pdef comes from pats, -- optpdef comes from optpats -- Then pdef' is optpdef with forcing/collapsing applied everywhere -- addCaseDef builds case trees from and -- pdef is the compile-time pattern definition. -- This will get further optimised for run-time, and, separately, -- further inlined to help with totality checking. let pdef = map debind $ map (simple_lhs (tt_ctxt ist)) pats logLvl 5 $ "Initial typechecked patterns:\n" ++ show pdef -- TODO: Inlining on initial definition happens here. -- NOTE: Need to store original definition so that proofs which -- rely on its structure aren't affected by any changes to the -- inliner. Just use the inlined version to generate pdef' and to -- help with later inlinings. ist <- getIState let pdef_inl = inlineDef ist pdef numArgs <- tclift $ sameLength pdef -- patterns after collapsing optimisation applied -- (i.e. check if the function should do nothing at run time) optpats <- if doNothing then return $ [Right (mkApp (P Bound n Erased) (take numArgs (repeat Erased)), Erased)] else stripCollapsed pats case specNames opts of Just _ -> logLvl 5 $ "Partially evaluated:\n" ++ show pats _ -> return () let optpdef = map debind $ map (simple_lhs (tt_ctxt ist)) optpats tree@(CaseDef scargs sc _) <- tclift $ simpleCase tcase False reflect CompileTime fc pdef cov <- coverage pmissing <- if cov then do missing <- genClauses fc n (map getLHS pdef) cs -- missing <- genMissing n scargs sc missing' <- filterM (checkPossible info fc True n) missing let clhs = map getLHS pdef logLvl 2 $ "Must be unreachable:\n" ++ showSep "\n" (map (showImp Nothing True False) missing') ++ "\nAgainst: " ++ showSep "\n" (map (\t -> showImp Nothing True False (delab ist t)) (map getLHS pdef)) -- filter out anything in missing' which is -- matched by any of clhs. This might happen since -- unification may force a variable to take a -- particular form, rather than force a case -- to be impossible. return (filter (noMatch ist clhs) missing') else return [] let pcover = null pmissing -- pdef' is the version that gets compiled for run-time pdef' <- applyOpts optpdef logLvl 5 $ "After data structure transformations:\n" ++ show pdef' ist <- getIState -- let wf = wellFounded ist n sc let tot = if pcover || AssertTotal `elem` opts then Unchecked -- finish checking later else Partial NotCovering -- already know it's not total -- case lookupCtxt (namespace info) n (idris_flags ist) of -- [fs] -> if TotalFn `elem` fs -- then case tot of -- Total _ -> return () -- t -> tclift $ tfail (At fc (Msg (show n ++ " is " ++ show t))) -- else return () -- _ -> return () case tree of CaseDef _ _ [] -> return () CaseDef _ _ xs -> mapM_ (\x -> iputStrLn $ show fc ++ ":warning - Unreachable case: " ++ show (delab ist x)) xs let knowncovering = (pcover && cov) || AssertTotal `elem` opts tree' <- tclift $ simpleCase tcase knowncovering reflect RunTime fc pdef' logLvl 3 (show tree) logLvl 3 $ "Optimised: " ++ show tree' ctxt <- getContext ist <- getIState putIState (ist { idris_patdefs = addDef n (pdef', pmissing) (idris_patdefs ist) }) let caseInfo = CaseInfo (inlinable opts) (dictionary opts) case lookupTy n ctxt of [ty] -> do updateContext (addCasedef n caseInfo tcase knowncovering reflect (AssertTotal `elem` opts) pats pdef pdef pdef_inl pdef' ty) addIBC (IBCDef n) setTotality n tot when (not reflect) $ totcheck (fc, n) when (tot /= Unchecked) $ addIBC (IBCTotal n tot) i <- getIState case lookupDef n (tt_ctxt i) of (CaseOp _ _ _ _ cd : _) -> let (scargs, sc) = cases_compiletime cd (scargs', sc') = cases_runtime cd in do let calls = findCalls sc' scargs' let used = findUsedArgs sc' scargs' -- let scg = buildSCG i sc scargs -- add SCG later, when checking totality let cg = CGInfo scargs' calls [] used [] logLvl 2 $ "Called names: " ++ show cg addToCG n cg addToCalledG n (nub (map fst calls)) -- plus names in type! addIBC (IBCCG n) _ -> return () return () -- addIBC (IBCTotal n tot) [] -> return () return () where noMatch i cs tm = all (\x -> case matchClause i (delab' i x True) tm of Right _ -> False Left miss -> True) cs checkUndefined n ctxt = case lookupDef n ctxt of [] -> return () [TyDecl _ _] -> return () _ -> tclift $ tfail (At fc (AlreadyDefined n)) debind (Right (x, y)) = let (vs, x') = depat [] x (_, y') = depat [] y in (vs, x', y') debind (Left x) = let (vs, x') = depat [] x in (vs, x', Impossible) depat acc (Bind n (PVar t) sc) = depat (n : acc) (instantiate (P Bound n t) sc) depat acc x = (acc, x) getLHS (_, l, _) = l simple_lhs ctxt (Right (x, y)) = Right (normalise ctxt [] x, y) simple_lhs ctxt t = t specNames [] = Nothing specNames (Specialise ns : _) = Just ns specNames (_ : xs) = specNames xs sameLength ((_, x, _) : xs) = do l <- sameLength xs let (f, as) = unApply x if (null xs || l == length as) then return (length as) else tfail (At fc (Msg "Clauses have differing numbers of arguments ")) sameLength [] = return 0 -- apply all transformations (just specialisation for now, add -- user defined transformation rules later) doTransforms ist pats = case specNames opts of Nothing -> pats Just ns -> partial_eval (tt_ctxt ist) ns pats elabVal :: ElabInfo -> Bool -> PTerm -> Idris (Term, Type) elabVal info aspat tm_in = do ctxt <- getContext i <- getIState let tm = addImpl i tm_in logLvl 10 (showImp Nothing True False tm) -- try: -- * ordinary elaboration -- * elaboration as a Type -- * elaboration as a function a -> b ((tm', defer, is), _) <- -- tctry (elaborate ctxt (MN 0 "val") (TType (UVal 0)) [] -- (build i info aspat (MN 0 "val") tm)) tclift (elaborate ctxt (MN 0 "val") infP [] (build i info aspat (MN 0 "val") (infTerm tm))) def' <- checkDef (FC "(input)" 0) defer addDeferred def' mapM_ (elabCaseBlock info []) is logLvl 3 ("Value: " ++ show tm') recheckC (FC "(input)" 0) [] tm' let vtm = getInferTerm tm' logLvl 2 (show vtm) recheckC (FC "(input)" 0) [] vtm -- checks if the clause is a possible left hand side. Returns the term if -- possible, otherwise Nothing. checkPossible :: ElabInfo -> FC -> Bool -> Name -> PTerm -> Idris Bool checkPossible info fc tcgen fname lhs_in = do ctxt <- getContext i <- getIState let lhs = addImpl i lhs_in -- if the LHS type checks, it is possible case elaborate ctxt (MN 0 "patLHS") infP [] (erun fc (buildTC i info True tcgen fname (infTerm lhs))) of OK ((lhs', _, _), _) -> do let lhs_tm = orderPats (getInferTerm lhs') case recheck ctxt [] (forget lhs_tm) lhs_tm of OK _ -> return True err -> return False -- b <- inferredDiff fc (delab' i lhs_tm True) lhs -- return (not b) -- then return (Just lhs_tm) else return Nothing -- trace (show (delab' i lhs_tm True) ++ "\n" ++ show lhs) $ return (not b) err@(Error _) -> return False elabClause :: ElabInfo -> FnOpts -> (Int, PClause) -> Idris (Either Term (Term, Term)) elabClause info opts (_, PClause fc fname lhs_in [] PImpossible []) = do let tcgen = Dictionary `elem` opts b <- checkPossible info fc tcgen fname lhs_in case b of True -> fail $ show fc ++ ":" ++ show lhs_in ++ " is a possible case" False -> do ptm <- mkPatTm lhs_in return (Left ptm) elabClause info opts (cnum, PClause fc fname lhs_in withs rhs_in whereblock) = do let tcgen = Dictionary `elem` opts ctxt <- getContext -- Build the LHS as an "Infer", and pull out its type and -- pattern bindings i <- getIState -- get the parameters first, to pass through to any where block let fn_ty = case lookupTy fname (tt_ctxt i) of [t] -> t _ -> error "Can't happen (elabClause function type)" let fn_is = case lookupCtxt fname (idris_implicits i) of [t] -> t _ -> [] let params = getParamsInType i [] fn_is fn_ty let lhs = addImplPat i (propagateParams params (stripLinear i lhs_in)) logLvl 5 ("LHS: " ++ show fc ++ " " ++ showImp Nothing True False lhs) logLvl 4 ("Fixed parameters: " ++ show params ++ " from " ++ show (fn_ty, fn_is)) ((lhs', dlhs, []), _) <- tclift $ elaborate ctxt (MN 0 "patLHS") infP [] (errAt "left hand side of " fname (erun fc (buildTC i info True tcgen fname (infTerm lhs)))) let lhs_tm = orderPats (getInferTerm lhs') let lhs_ty = getInferType lhs' logLvl 3 ("Elaborated: " ++ show lhs_tm) logLvl 3 ("Elaborated type: " ++ show lhs_ty) (clhs_c, clhsty) <- recheckC fc [] lhs_tm let clhs = normalise ctxt [] clhs_c logLvl 5 ("Checked " ++ show clhs ++ "\n" ++ show clhsty) -- Elaborate where block ist <- getIState windex <- getName let winfo = pinfo (pvars ist lhs_tm) whereblock windex let decls = nub (concatMap declared whereblock) let defs = nub (decls ++ concatMap defined whereblock) let newargs = pvars ist lhs_tm let wb = map (expandParamsD False ist decorate newargs defs) whereblock -- Split the where block into declarations with a type, and those -- without -- Elaborate those with a type *before* RHS, those without *after* let (wbefore, wafter) = sepBlocks wb logLvl 5 $ "Where block:\n " ++ show wbefore ++ "\n" ++ show wafter mapM_ (elabDecl' EAll info) wbefore -- Now build the RHS, using the type of the LHS as the goal. i <- getIState -- new implicits from where block logLvl 5 (showImp Nothing True False (expandParams decorate newargs defs (defs \\ decls) rhs_in)) let rhs = addImplBoundInf i (map fst newargs) (defs \\ decls) (expandParams decorate newargs defs (defs \\ decls) rhs_in) logLvl 2 $ "RHS: " ++ showImp Nothing True False rhs ctxt <- getContext -- new context with where block added logLvl 5 "STARTING CHECK" ((rhs', defer, is), _) <- tclift $ elaborate ctxt (MN 0 "patRHS") clhsty [] (do pbinds lhs_tm (_, _, is) <- errAt "right hand side of " fname (erun fc (build i info False fname rhs)) errAt "right hand side of " fname (erun fc $ psolve lhs_tm) tt <- get_term let (tm, ds) = runState (collectDeferred tt) [] return (tm, ds, is)) logLvl 5 "DONE CHECK" logLvl 2 $ "---> " ++ show rhs' when (not (null defer)) $ iLOG $ "DEFERRED " ++ show defer def' <- checkDef fc defer addDeferred def' -- Now the remaining deferred (i.e. no type declarations) clauses -- from the where block mapM_ (elabDecl' EAll info) wafter mapM_ (elabCaseBlock info opts) is ctxt <- getContext logLvl 5 $ "Rechecking" (crhs, crhsty) <- recheckC fc [] rhs' logLvl 6 $ " ==> " ++ show crhsty ++ " against " ++ show clhsty case converts ctxt [] clhsty crhsty of OK _ -> return () Error e -> ierror (At fc (CantUnify False clhsty crhsty e [] 0)) i <- getIState checkInferred fc (delab' i crhs True) rhs return $ Right (clhs, crhs) where decorate (NS x ns) = NS (SN (WhereN cnum fname x)) ns -- ++ [show cnum]) -- = NS (UN ('#':show x)) (ns ++ [show cnum, show fname]) decorate x = SN (WhereN cnum fname x) -- = NS (SN (WhereN cnum fname x)) [show cnum] -- = NS (UN ('#':show x)) [show cnum, show fname] sepBlocks bs = sepBlocks' [] bs where sepBlocks' ns (d@(PTy _ _ _ _ n t) : bs) = let (bf, af) = sepBlocks' (n : ns) bs in (d : bf, af) sepBlocks' ns (d@(PClauses _ _ n _) : bs) | not (n `elem` ns) = let (bf, af) = sepBlocks' ns bs in (bf, d : af) sepBlocks' ns (b : bs) = let (bf, af) = sepBlocks' ns bs in (b : bf, af) sepBlocks' ns [] = ([], []) pinfo ns ps i = let ds = concatMap declared ps newps = params info ++ ns dsParams = map (\n -> (n, map fst newps)) ds newb = addAlist dsParams (inblock info) l = liftname info in info { params = newps, inblock = newb, liftname = id -- (\n -> case lookupCtxt n newb of -- Nothing -> n -- _ -> MN i (show n)) . l } getParamsInType i env (PExp _ _ _ _ : is) (Bind n (Pi t) sc) = getParamsInType i env is (instantiate (P Bound n t) sc) getParamsInType i env (_ : is) (Bind n (Pi t) sc) = getParamsInType i (n : env) is (instantiate (P Bound n t) sc) getParamsInType i env is tm@(App f a) | (P _ tn _, args) <- unApply tm = case lookupCtxt tn (idris_datatypes i) of [t] -> nub $ paramNames args env (param_pos t) ++ getParamsInType i env is f ++ getParamsInType i env is a [] -> nub $ getParamsInType i env is f ++ getParamsInType i env is a | otherwise = nub $ getParamsInType i env is f ++ getParamsInType i env is a getParamsInType i _ _ _ = [] paramNames args env [] = [] paramNames args env (p : ps) | length args > p = case args!!p of P _ n _ -> if n `elem` env then n : paramNames args env ps else paramNames args env ps _ -> paramNames args env ps | otherwise = paramNames args env ps propagateParams :: [Name] -> PTerm -> PTerm propagateParams ps (PApp _ (PRef fc n) args) = PApp fc (PRef fc n) (map addP args) where addP imp@(PImp _ _ _ Placeholder _) | pname imp `elem` ps = imp { getTm = PRef fc (pname imp) } addP t = t propagateParams ps (PRef fc n) = PApp fc (PRef fc n) (map (\x -> pimp x (PRef fc x)) ps) propagateParams ps x = x elabClause info opts (_, PWith fc fname lhs_in withs wval_in withblock) = do let tcgen = Dictionary `elem` opts ctxt <- getContext -- Build the LHS as an "Infer", and pull out its type and -- pattern bindings i <- getIState let lhs = addImplPat i lhs_in logLvl 5 ("LHS: " ++ showImp Nothing True False lhs) ((lhs', dlhs, []), _) <- tclift $ elaborate ctxt (MN 0 "patLHS") infP [] (errAt "left hand side of with in " fname (erun fc (buildTC i info True tcgen fname (infTerm lhs))) ) let lhs_tm = orderPats (getInferTerm lhs') let lhs_ty = getInferType lhs' let ret_ty = getRetTy lhs_ty logLvl 3 (show lhs_tm) (clhs, clhsty) <- recheckC fc [] lhs_tm logLvl 5 ("Checked " ++ show clhs) let bargs = getPBtys lhs_tm let wval = addImplBound i (map fst bargs) wval_in logLvl 5 ("Checking " ++ showImp Nothing True False wval) -- Elaborate wval in this context ((wval', defer, is), _) <- tclift $ elaborate ctxt (MN 0 "withRHS") (bindTyArgs PVTy bargs infP) [] (do pbinds lhs_tm -- TODO: may want where here - see winfo abpve (_', d, is) <- errAt "with value in " fname (erun fc (build i info False fname (infTerm wval))) erun fc $ psolve lhs_tm tt <- get_term return (tt, d, is)) def' <- checkDef fc defer addDeferred def' mapM_ (elabCaseBlock info opts) is (cwval, cwvalty) <- recheckC fc [] (getInferTerm wval') let cwvaltyN = explicitNames cwvalty let cwvalN = explicitNames cwval logLvl 5 ("With type " ++ show cwvalty ++ "\nRet type " ++ show ret_ty) let pvars = map fst (getPBtys cwvalty) -- we need the unelaborated term to get the names it depends on -- rather than a de Bruijn index. let pdeps = usedNamesIn pvars i (delab i cwvalty) let (bargs_pre, bargs_post) = split pdeps bargs [] logLvl 10 ("With type " ++ show (getRetTy cwvaltyN) ++ " depends on " ++ show pdeps ++ " from " ++ show pvars) logLvl 10 ("Pre " ++ show bargs_pre ++ "\nPost " ++ show bargs_post) windex <- getName -- build a type declaration for the new function: -- (ps : Xs) -> (withval : cwvalty) -> (ps' : Xs') -> ret_ty let wargval = getRetTy cwvalN let wargtype = getRetTy cwvaltyN logLvl 5 ("Abstract over " ++ show wargval) let wtype = bindTyArgs Pi (bargs_pre ++ (MN 0 "warg", wargtype) : map (abstract (MN 0 "warg") wargval wargtype) bargs_post) (substTerm wargval (P Bound (MN 0 "warg") wargtype) ret_ty) logLvl 3 ("New function type " ++ show wtype) let wname = MN windex (show fname) let imps = getImps wtype -- add to implicits context putIState (i { idris_implicits = addDef wname imps (idris_implicits i) }) addIBC (IBCDef wname) def' <- checkDef fc [(wname, wtype)] addDeferred def' -- in the subdecls, lhs becomes: -- fname pats | wpat [rest] -- ==> fname' ps wpat [rest], match pats against toplevel for ps wb <- mapM (mkAuxC wname lhs (map fst bargs_pre) (map fst bargs_post)) withblock logLvl 3 ("with block " ++ show wb) mapM_ (elabDecl EAll info) wb -- rhs becomes: fname' ps wval let rhs = PApp fc (PRef fc wname) (map (pexp . (PRef fc) . fst) bargs_pre ++ pexp wval : (map (pexp . (PRef fc) . fst) bargs_post)) logLvl 5 ("New RHS " ++ showImp Nothing True False rhs) ctxt <- getContext -- New context with block added i <- getIState ((rhs', defer, is), _) <- tclift $ elaborate ctxt (MN 0 "wpatRHS") clhsty [] (do pbinds lhs_tm (_, d, is) <- erun fc (build i info False fname rhs) psolve lhs_tm tt <- get_term return (tt, d, is)) def' <- checkDef fc defer addDeferred def' mapM_ (elabCaseBlock info opts) is logLvl 5 ("Checked RHS " ++ show rhs') (crhs, crhsty) <- recheckC fc [] rhs' return $ Right (clhs, crhs) where getImps (Bind n (Pi _) t) = pexp Placeholder : getImps t getImps _ = [] mkAuxC wname lhs ns ns' (PClauses fc o n cs) | True = do cs' <- mapM (mkAux wname lhs ns ns') cs return $ PClauses fc o wname cs' | otherwise = fail $ show fc ++ "with clause uses wrong function name " ++ show n mkAuxC wname lhs ns ns' d = return $ d mkAux wname toplhs ns ns' (PClause fc n tm_in (w:ws) rhs wheres) = do i <- getIState let tm = addImplPat i tm_in logLvl 2 ("Matching " ++ showImp Nothing True False tm ++ " against " ++ showImp Nothing True False toplhs) case matchClause i toplhs tm of Left f -> fail $ show fc ++ ":with clause does not match top level" Right mvars -> do logLvl 3 ("Match vars : " ++ show mvars) lhs <- updateLHS n wname mvars ns ns' (fullApp tm) w return $ PClause fc wname lhs ws rhs wheres mkAux wname toplhs ns ns' (PWith fc n tm_in (w:ws) wval withs) = do i <- getIState let tm = addImplPat i tm_in logLvl 2 ("Matching " ++ showImp Nothing True False tm ++ " against " ++ showImp Nothing True False toplhs) withs' <- mapM (mkAuxC wname toplhs ns ns') withs case matchClause i toplhs tm of Left _ -> fail $ show fc ++ "with clause does not match top level" Right mvars -> do lhs <- updateLHS n wname mvars ns ns' (fullApp tm) w return $ PWith fc wname lhs ws wval withs' mkAux wname toplhs ns ns' c = fail $ show fc ++ "badly formed with clause" updateLHS n wname mvars ns_in ns_in' (PApp fc (PRef fc' n') args) w = let ns = map (keepMvar (map fst mvars) fc') ns_in ns' = map (keepMvar (map fst mvars) fc') ns_in' in return $ substMatches mvars $ PApp fc (PRef fc' wname) (map pexp ns ++ pexp w : (map pexp ns')) updateLHS n wname mvars ns ns' tm w = fail $ "Not implemented match " ++ show tm keepMvar mvs fc v | v `elem` mvs = PRef fc v | otherwise = Placeholder fullApp (PApp _ (PApp fc f args) xs) = fullApp (PApp fc f (args ++ xs)) fullApp x = x split [] rest pre = (reverse pre, rest) split deps ((n, ty) : rest) pre | n `elem` deps = split (deps \\ [n]) rest ((n, ty) : pre) | otherwise = split deps rest ((n, ty) : pre) split deps [] pre = (reverse pre, []) abstract wn wv wty (n, argty) = (n, substTerm wv (P Bound wn wty) argty) data MArgTy = IA | EA | CA deriving Show elabClass :: ElabInfo -> SyntaxInfo -> String -> FC -> [PTerm] -> Name -> [(Name, PTerm)] -> [PDecl] -> Idris () elabClass info syn doc fc constraints tn ps ds = do let cn = UN ("instance" ++ show tn) -- MN 0 ("instance" ++ show tn) let tty = pibind ps PType let constraint = PApp fc (PRef fc tn) (map (pexp . PRef fc) (map fst ps)) -- build data declaration let mdecls = filter tydecl ds -- method declarations let mnames = map getMName mdecls logLvl 2 $ "Building methods " ++ show mnames ims <- mapM (tdecl mnames) mdecls defs <- mapM (defdecl (map (\ (x,y,z) -> z) ims) constraint) (filter clause ds) let (methods, imethods) = unzip (map (\ ( x,y,z) -> (x, y)) ims) let defaults = map (\ (x, (y, z)) -> (x,y)) defs addClass tn (CI cn (map nodoc imethods) defaults (map fst ps) []) -- build instance constructor type -- decorate names of functions to ensure they can't be referred -- to elsewhere in the class declaration -- TODO: Remove mdec to make it a dependent record, which would -- allow dependent type classes, but building instances will -- then need some attention. let cty = impbind ps $ conbind constraints $ pibind (map (\ (n, ty) -> (mdec n, ty)) methods) constraint let cons = [("", cn, cty, fc)] let ddecl = PDatadecl tn tty cons logLvl 5 $ "Class data " ++ showDImp True ddecl elabData info (syn { no_imp = no_imp syn ++ mnames }) doc fc False ddecl -- for each constraint, build a top level function to chase it logLvl 5 $ "Building functions" let usyn = syn { using = map (\ (x,y) -> UImplicit x y) ps ++ using syn } fns <- mapM (cfun cn constraint usyn (map fst imethods)) constraints mapM_ (elabDecl EAll info) (concat fns) -- for each method, build a top level function fns <- mapM (tfun cn constraint usyn (map fst imethods)) imethods mapM_ (elabDecl EAll info) (concat fns) -- add the default definitions mapM_ (elabDecl EAll info) (concat (map (snd.snd) defs)) i <- getIState addIBC (IBCClass tn) where nodoc (n, (_, o, t)) = (n, (o, t)) pibind [] x = x pibind ((n, ty): ns) x = PPi expl n ty (pibind ns x) mdec (UN n) = SN (MethodN (UN n)) mdec (NS x n) = NS (mdec x) n mdec x = x impbind [] x = x impbind ((n, ty): ns) x = PPi impl n ty (impbind ns x) conbind (ty : ns) x = PPi constraint (MN 0 "class") ty (conbind ns x) conbind [] x = x getMName (PTy _ _ _ _ n _) = nsroot n tdecl allmeths (PTy doc syn _ o n t) = do t' <- implicit' syn allmeths n t logLvl 5 $ "Method " ++ show n ++ " : " ++ showImp Nothing True False t' return ( (n, (toExp (map fst ps) Exp t')), (n, (doc, o, (toExp (map fst ps) Imp t'))), (n, (syn, o, t) ) ) tdecl _ _ = fail "Not allowed in a class declaration" -- Create default definitions defdecl mtys c d@(PClauses fc opts n cs) = case lookup n mtys of Just (syn, o, ty) -> do let ty' = insertConstraint c ty let ds = map (decorateid defaultdec) [PTy "" syn fc [] n ty', PClauses fc (o ++ opts) n cs] iLOG (show ds) return (n, ((defaultdec n, ds!!1), ds)) _ -> fail $ show n ++ " is not a method" defdecl _ _ _ = fail "Can't happen (defdecl)" defaultdec (UN n) = UN ("default#" ++ n) defaultdec (NS n ns) = NS (defaultdec n) ns tydecl (PTy _ _ _ _ _ _) = True tydecl _ = False clause (PClauses _ _ _ _) = True clause _ = False -- Generate a function for chasing a dictionary constraint cfun cn c syn all con = do let cfn = UN ('@':'@':show cn ++ "#" ++ show con) -- SN (ParentN cn (show con)) let mnames = take (length all) $ map (\x -> MN x "meth") [0..] let capp = PApp fc (PRef fc cn) (map (pexp . PRef fc) mnames) let lhs = PApp fc (PRef fc cfn) [pconst capp] let rhs = PResolveTC (FC "HACK" 0) let ty = PPi constraint (MN 0 "pc") c con iLOG (showImp Nothing True False ty) iLOG (showImp Nothing True False lhs ++ " = " ++ showImp Nothing True False rhs) i <- getIState let conn = case con of PRef _ n -> n PApp _ (PRef _ n) _ -> n let conn' = case lookupCtxtName conn (idris_classes i) of [(n, _)] -> n _ -> conn addInstance False conn' cfn addIBC (IBCInstance False conn' cfn) -- iputStrLn ("Added " ++ show (conn, cfn, ty)) return [PTy "" syn fc [] cfn ty, PClauses fc [Dictionary] cfn [PClause fc cfn lhs [] rhs []]] -- Generate a top level function which looks up a method in a given -- dictionary (this is inlinable, always) tfun cn c syn all (m, (doc, o, ty)) = do let ty' = insertConstraint c ty let mnames = take (length all) $ map (\x -> MN x "meth") [0..] let capp = PApp fc (PRef fc cn) (map (pexp . PRef fc) mnames) let margs = getMArgs ty let anames = map (\x -> MN x "arg") [0..] let lhs = PApp fc (PRef fc m) (pconst capp : lhsArgs margs anames) let rhs = PApp fc (getMeth mnames all m) (rhsArgs margs anames) iLOG (showImp Nothing True False ty) iLOG (show (m, ty', capp, margs)) iLOG (showImp Nothing True False lhs ++ " = " ++ showImp Nothing True False rhs) return [PTy doc syn fc o m ty', PClauses fc [Inlinable] m [PClause fc m lhs [] rhs []]] getMArgs (PPi (Imp _ _ _) n ty sc) = IA : getMArgs sc getMArgs (PPi (Exp _ _ _) n ty sc) = EA : getMArgs sc getMArgs (PPi (Constraint _ _ _) n ty sc) = CA : getMArgs sc getMArgs _ = [] getMeth (m:ms) (a:as) x | x == a = PRef fc m | otherwise = getMeth ms as x lhsArgs (EA : xs) (n : ns) = pexp (PRef fc n) : lhsArgs xs ns lhsArgs (IA : xs) ns = lhsArgs xs ns lhsArgs (CA : xs) ns = lhsArgs xs ns lhsArgs [] _ = [] rhsArgs (EA : xs) (n : ns) = pexp (PRef fc n) : rhsArgs xs ns rhsArgs (IA : xs) ns = pexp Placeholder : rhsArgs xs ns rhsArgs (CA : xs) ns = pconst (PResolveTC fc) : rhsArgs xs ns rhsArgs [] _ = [] insertConstraint c (PPi p@(Imp _ _ _) n ty sc) = PPi p n ty (insertConstraint c sc) insertConstraint c sc = PPi constraint (MN 0 "class") c sc -- make arguments explicit and don't bind class parameters toExp ns e (PPi (Imp l s _) n ty sc) | n `elem` ns = toExp ns e sc | otherwise = PPi (e l s "") n ty (toExp ns e sc) toExp ns e (PPi p n ty sc) = PPi p n ty (toExp ns e sc) toExp ns e sc = sc elabInstance :: ElabInfo -> SyntaxInfo -> FC -> [PTerm] -> -- constraints Name -> -- the class [PTerm] -> -- class parameters (i.e. instance) PTerm -> -- full instance type Maybe Name -> -- explicit name [PDecl] -> Idris () elabInstance info syn fc cs n ps t expn ds = do i <- getIState (n, ci) <- case lookupCtxtName n (idris_classes i) of [c] -> return c _ -> fail $ show fc ++ ":" ++ show n ++ " is not a type class" let constraint = PApp fc (PRef fc n) (map pexp ps) let iname = case expn of Nothing -> SN (InstanceN n (map show ps)) -- UN ('@':show n ++ "$" ++ show ps) Just nm -> nm -- if the instance type matches any of the instances we have already, -- and it's not a named instance, then it's overlapping, so report an error case expn of Nothing -> do mapM_ (checkNotOverlapping i t) (class_instances ci) addInstance intInst n iname Just _ -> addInstance intInst n iname elabType info syn "" fc [] iname t let ips = zip (class_params ci) ps let ns = case n of NS n ns' -> ns' _ -> [] -- get the implicit parameters that need passing through to the -- where block wparams <- mapM (\p -> case p of PApp _ _ args -> getWParams args _ -> return []) ps let pnames = map pname (concat (nub wparams)) let mtys = map (\ (n, (op, t)) -> let t' = substMatchesShadow ips pnames t in (decorate ns iname n, op, coninsert cs t', t')) (class_methods ci) logLvl 3 (show (mtys, ips)) let ds' = insertDefaults i iname (class_defaults ci) ns ds iLOG ("Defaults inserted: " ++ show ds' ++ "\n" ++ show ci) mapM_ (warnMissing ds' ns iname) (map fst (class_methods ci)) mapM_ (checkInClass (map fst (class_methods ci))) (concatMap defined ds') let wbTys = map mkTyDecl mtys let wbVals = map (decorateid (decorate ns iname)) ds' let wb = wbTys ++ wbVals logLvl 3 $ "Method types " ++ showSep "\n" (map (showDeclImp True . mkTyDecl) mtys) logLvl 3 $ "Instance is " ++ show ps ++ " implicits " ++ show (concat (nub wparams)) let lhs = PRef fc iname let rhs = PApp fc (PRef fc (instanceName ci)) (map (pexp . mkMethApp) mtys) let idecls = [PClauses fc [Dictionary] iname [PClause fc iname lhs [] rhs wb]] iLOG (show idecls) mapM (elabDecl EAll info) idecls addIBC (IBCInstance intInst n iname) -- -- for each constraint, build a top level function to chase it -- logLvl 5 $ "Building functions" -- fns <- mapM (cfun (instanceName ci) constraint syn idecls) cs -- mapM_ (elabDecl EAll info) (concat fns) where intInst = case ps of [PConstant (AType (ATInt ITNative))] -> True _ -> False checkNotOverlapping i t n | take 2 (show n) == "@@" = return () | otherwise = case lookupTy n (tt_ctxt i) of [t'] -> let tret = getRetType t tret' = getRetType (delab i t') in case matchClause i tret' tret of Right _ -> overlapping tret tret' Left _ -> case matchClause i tret tret' of Right _ -> overlapping tret tret' Left _ -> return () _ -> return () overlapping t t' = tclift $ tfail (At fc (Msg $ "Overlapping instance: " ++ show t' ++ " already defined")) getRetType (PPi _ _ _ sc) = getRetType sc getRetType t = t mkMethApp (n, _, _, ty) = lamBind 0 ty (papp fc (PRef fc n) (methArgs 0 ty)) lamBind i (PPi (Constraint _ _ _) _ _ sc) sc' = PLam (MN i "meth") Placeholder (lamBind (i+1) sc sc') lamBind i (PPi _ n ty sc) sc' = PLam (MN i "meth") Placeholder (lamBind (i+1) sc sc') lamBind i _ sc = sc methArgs i (PPi (Imp _ _ _) n ty sc) = PImp 0 False n (PRef fc (MN i "meth")) "" : methArgs (i+1) sc methArgs i (PPi (Exp _ _ _) n ty sc) = PExp 0 False (PRef fc (MN i "meth")) "" : methArgs (i+1) sc methArgs i (PPi (Constraint _ _ _) n ty sc) = PConstraint 0 False (PResolveTC fc) "" : methArgs (i+1) sc methArgs i _ = [] papp fc f [] = f papp fc f as = PApp fc f as getWParams [] = return [] getWParams (p : ps) | PRef _ n <- getTm p = do ps' <- getWParams ps ctxt <- getContext case lookupP n ctxt of [] -> return (pimp n (PRef fc n) : ps') _ -> return ps' getWParams (_ : ps) = getWParams ps decorate ns iname (UN n) = NS (SN (MethodN (UN n))) ns decorate ns iname (NS (UN n) s) = NS (SN (MethodN (UN n))) ns mkTyDecl (n, op, t, _) = PTy "" syn fc op n t conbind (ty : ns) x = PPi constraint (MN 0 "class") ty (conbind ns x) conbind [] x = x coninsert cs (PPi p@(Imp _ _ _) n t sc) = PPi p n t (coninsert cs sc) coninsert cs sc = conbind cs sc insertDefaults :: IState -> Name -> [(Name, (Name, PDecl))] -> [String] -> [PDecl] -> [PDecl] insertDefaults i iname [] ns ds = ds insertDefaults i iname ((n,(dn, clauses)) : defs) ns ds = insertDefaults i iname defs ns (insertDef i n dn clauses ns iname ds) insertDef i meth def clauses ns iname decls | null $ filter (clauseFor meth iname ns) decls = let newd = expandParamsD False i (\n -> meth) [] [def] clauses in -- trace (show newd) $ decls ++ [newd] | otherwise = decls warnMissing decls ns iname meth | null $ filter (clauseFor meth iname ns) decls = iWarn fc $ "method " ++ show meth ++ " not defined" | otherwise = return () checkInClass ns meth | not (null (filter (eqRoot meth) ns)) = return () | otherwise = tclift $ tfail (At fc (Msg $ show meth ++ " not a method of class " ++ show n)) eqRoot x y = nsroot x == nsroot y clauseFor m iname ns (PClauses _ _ m' _) = decorate ns iname m == decorate ns iname m' clauseFor m iname ns _ = False {- This won't work yet. Can it ever, in this form? cfun cn c syn all con = do let cfn = UN ('@':'@':show cn ++ "#" ++ show con) let mnames = take (length all) $ map (\x -> MN x "meth") [0..] let capp = PApp fc (PRef fc cn) (map (pexp . PRef fc) mnames) let lhs = PApp fc (PRef fc cfn) [pconst capp] let rhs = PResolveTC (FC "HACK" 0) let ty = PPi constraint (MN 0 "pc") c con iLOG (showImp True ty) iLOG (showImp True lhs ++ " = " ++ showImp True rhs) i <- getIState let conn = case con of PRef _ n -> n PApp _ (PRef _ n) _ -> n let conn' = case lookupCtxtName Nothing conn (idris_classes i) of [(n, _)] -> n _ -> conn addInstance False conn' cfn addIBC (IBCInstance False conn' cfn) iputStrLn ("Added " ++ show (conn, cfn, ty) ++ "\n" ++ show (lhs, rhs)) return [PTy "" syn fc [] cfn ty, PClauses fc [Dictionary] cfn [PClause fc cfn lhs [] rhs []]] -} decorateid decorate (PTy doc s f o n t) = PTy doc s f o (decorate n) t decorateid decorate (PClauses f o n cs) = PClauses f o (decorate n) (map dc cs) where dc (PClause fc n t as w ds) = PClause fc (decorate n) (dappname t) as w ds dc (PWith fc n t as w ds) = PWith fc (decorate n) (dappname t) as w (map (decorateid decorate) ds) dappname (PApp fc (PRef fc' n) as) = PApp fc (PRef fc' (decorate n)) as dappname t = t pbinds (Bind n (PVar t) sc) = do attack; patbind n pbinds sc pbinds tm = return () pbty (Bind n (PVar t) sc) tm = Bind n (PVTy t) (pbty sc tm) pbty _ tm = tm getPBtys (Bind n (PVar t) sc) = (n, t) : getPBtys sc getPBtys (Bind n (PVTy t) sc) = (n, t) : getPBtys sc getPBtys _ = [] psolve (Bind n (PVar t) sc) = do solve; psolve sc psolve tm = return () pvars ist (Bind n (PVar t) sc) = (n, delab ist t) : pvars ist sc pvars ist _ = [] data ElabWhat = ETypes | EDefns | EAll deriving (Show, Eq) elabDecls :: ElabInfo -> [PDecl] -> Idris () elabDecls info ds = do mapM_ (elabDecl EAll info) ds -- mapM_ (elabDecl EDefns info) ds elabDecl :: ElabWhat -> ElabInfo -> PDecl -> Idris () elabDecl what info d = idrisCatch (elabDecl' what info d) (\e -> do let msg = show e setErrLine (getErrLine msg) iputStrLn msg) elabDecl' _ info (PFix _ _ _) = return () -- nothing to elaborate elabDecl' _ info (PSyntax _ p) = return () -- nothing to elaborate elabDecl' what info (PTy doc s f o n ty) | what /= EDefns = do iLOG $ "Elaborating type decl " ++ show n ++ show o elabType info s doc f o n ty elabDecl' what info (PPostulate doc s f o n ty) | what /= EDefns = do iLOG $ "Elaborating postulate " ++ show n ++ show o elabPostulate info s doc f o n ty elabDecl' what info (PData doc s f co d) | what /= ETypes = do iLOG $ "Elaborating " ++ show (d_name d) elabData info s doc f co d | otherwise = do iLOG $ "Elaborating [type of] " ++ show (d_name d) elabData info s doc f co (PLaterdecl (d_name d) (d_tcon d)) elabDecl' what info d@(PClauses f o n ps) | what /= ETypes = do iLOG $ "Elaborating clause " ++ show n i <- getIState -- get the type options too let o' = case lookupCtxt n (idris_flags i) of [fs] -> fs [] -> [] elabClauses info f (o ++ o') n ps elabDecl' what info (PMutual f ps) = do mapM_ (elabDecl ETypes info) ps mapM_ (elabDecl EDefns info) ps -- Do totality checking after entire mutual block i <- get mapM_ buildSCG (idris_totcheck i) mapM_ checkDeclTotality (idris_totcheck i) clear_totcheck elabDecl' what info (PParams f ns ps) = do i <- getIState iLOG $ "Expanding params block with " ++ show ns ++ " decls " ++ show (concatMap tldeclared ps) let nblock = pblock i mapM_ (elabDecl' what info) nblock where pinfo = let ds = concatMap tldeclared ps newps = params info ++ ns dsParams = map (\n -> (n, map fst newps)) ds newb = addAlist dsParams (inblock info) in info { params = newps, inblock = newb } pblock i = map (expandParamsD False i id ns (concatMap tldeclared ps)) ps elabDecl' what info (PNamespace n ps) = mapM_ (elabDecl' what ninfo) ps where ninfo = case namespace info of Nothing -> info { namespace = Just [n] } Just ns -> info { namespace = Just (n:ns) } elabDecl' what info (PClass doc s f cs n ps ds) | what /= EDefns = do iLOG $ "Elaborating class " ++ show n elabClass info (s { syn_params = [] }) doc f cs n ps ds elabDecl' what info (PInstance s f cs n ps t expn ds) | what /= ETypes = do iLOG $ "Elaborating instance " ++ show n elabInstance info s f cs n ps t expn ds elabDecl' what info (PRecord doc s f tyn ty cdoc cn cty) | what /= EDefns = do iLOG $ "Elaborating record " ++ show tyn elabRecord info s doc f tyn ty cdoc cn cty elabDecl' _ info (PDSL n dsl) = do i <- getIState putIState (i { idris_dsls = addDef n dsl (idris_dsls i) }) addIBC (IBCDSL n) elabDecl' what info (PDirective i) | what /= EDefns = i elabDecl' what info (PProvider syn fc n tp tm) | what /= EDefns = do iLOG $ "Elaborating type provider " ++ show n elabProvider info syn fc n tp tm elabDecl' what info (PTransform fc safety old new) = elabTransform info fc safety old new elabDecl' _ _ _ = return () -- skipped this time elabCaseBlock info opts d@(PClauses f o n ps) = do addIBC (IBCDef n) logLvl 6 $ "CASE BLOCK: " ++ show (n, d) elabDecl' EAll info (PClauses f (nub (o ++ opts)) n ps ) -- elabDecl' info (PImport i) = loadModule i -- Check that the result of type checking matches what the programmer wrote -- (i.e. - if we inferred any arguments that the user provided, make sure -- they are the same!) checkInferred :: FC -> PTerm -> PTerm -> Idris () checkInferred fc inf user = do logLvl 6 $ "Checked to\n" ++ showImp Nothing True False inf ++ "\n\nFROM\n\n" ++ showImp Nothing True False user logLvl 10 $ "Checking match" i <- getIState tclift $ case matchClause' True i user inf of _ -> return () -- Left (x, y) -> tfail $ At fc -- (Msg $ "The type-checked term and given term do not match: " -- ++ show x ++ " and " ++ show y) logLvl 10 $ "Checked match" -- ++ "\n" ++ showImp True inf ++ "\n" ++ showImp True user) -- Return whether inferred term is different from given term -- (as above, but return a Bool) inferredDiff :: FC -> PTerm -> PTerm -> Idris Bool inferredDiff fc inf user = do i <- getIState logLvl 6 $ "Checked to\n" ++ showImp Nothing True False inf ++ "\n" ++ showImp Nothing True False user tclift $ case matchClause' True i user inf of Right vs -> return False Left (x, y) -> return True