module Idris.Parser where import Idris.AbsSyntax import Idris.Imports import Idris.Error import Idris.ElabDecls import Idris.ElabTerm import Idris.IBC import Idris.Unlit import Paths_idris import Core.CoreParser import Core.TT import Core.Evaluate import Text.ParserCombinators.Parsec import Text.ParserCombinators.Parsec.Error import Text.ParserCombinators.Parsec.Expr import Text.ParserCombinators.Parsec.Language import qualified Text.ParserCombinators.Parsec.Token as PTok import Data.List import Control.Monad.State import Debug.Trace import Data.Maybe import System.FilePath type TokenParser a = PTok.TokenParser a type IParser = GenParser Char IState lexer :: TokenParser IState lexer = PTok.makeTokenParser idrisDef whiteSpace= PTok.whiteSpace lexer lexeme = PTok.lexeme lexer symbol = PTok.symbol lexer natural = PTok.natural lexer parens = PTok.parens lexer semi = PTok.semi lexer comma = PTok.comma lexer identifier= PTok.identifier lexer reserved = PTok.reserved lexer operator = PTok.operator lexer reservedOp= PTok.reservedOp lexer integer = PTok.integer lexer float = PTok.float lexer strlit = PTok.stringLiteral lexer chlit = PTok.charLiteral lexer lchar = lexeme.char -- Loading modules loadModule :: FilePath -> Idris String loadModule f = idrisCatch (do datadir <- liftIO $ getDataDir fp <- liftIO $ findImport [".", datadir] f i <- getIState if (f `elem` imported i) then iLOG $ "Already read " ++ f else do putIState (i { imported = f : imported i }) case fp of IDR fn -> loadSource False fn LIDR fn -> loadSource True fn IBC fn src -> idrisCatch (loadIBC fn) (\c -> do iLOG $ fn ++ " failed " ++ show c case src of IDR sfn -> loadSource False sfn LIDR sfn -> loadSource True sfn) let (dir, fh) = splitFileName f return (dropExtension fh)) (\e -> do let msg = show e setErrLine (getErrLine msg) iputStrLn msg return "") loadSource :: Bool -> FilePath -> Idris () loadSource lidr f = do iLOG ("Reading " ++ f) file_in <- liftIO $ readFile f file <- if lidr then tclift $ unlit f file_in else return file_in (mname, modules, rest, pos) <- parseImports f file i <- getIState putIState (i { default_access = Hidden }) mapM_ loadModule modules clearIBC -- start a new .ibc file mapM_ (\m -> addIBC (IBCImport m)) modules ds' <- parseProg (defaultSyntax {syn_namespace = reverse mname }) f rest pos let ds = namespaces mname ds' logLvl 3 (dumpDecls ds) i <- getIState logLvl 10 (show (toAlist (idris_implicits i))) logLvl 3 (show (idris_infixes i)) -- Now add all the declarations to the context v <- verbose when v $ iputStrLn $ "Type checking " ++ f mapM_ (elabDecl toplevel) ds iLOG ("Finished " ++ f) let ibc = dropExtension f ++ ".ibc" iucheck i <- getIState addHides (hide_list i) ok <- noErrors when ok $ idrisCatch (do writeIBC f ibc; clearIBC) (\c -> return ()) -- failure is harmless putIState (i { hide_list = [] }) return () where namespaces [] ds = ds namespaces (x:xs) ds = [PNamespace x (namespaces xs ds)] addHides :: [(Name, Maybe Accessibility)] -> Idris () addHides xs = do i <- getIState let defh = default_access i let (hs, as) = partition isNothing xs if null as then return () else mapM_ doHide (map (\ (n, _) -> (n, defh)) hs ++ map (\ (n, Just a) -> (n, a)) as) where isNothing (_, Nothing) = True isNothing _ = False doHide (n, a) = do setAccessibility n a addIBC (IBCAccess n a) parseExpr i = runParser (pFullExpr defaultSyntax) i "(input)" parseTac i = runParser (do t <- pTactic defaultSyntax eof return t) i "(proof)" parseImports :: FilePath -> String -> Idris ([String], [String], String, SourcePos) parseImports fname input = do i <- get case (runParser (do mname <- pHeader ps <- many pImport rest <- getInput pos <- getPosition return ((mname, ps, rest, pos), i)) i fname input) of Left err -> fail (ishow err) Right (x, i) -> do put i return x where ishow err = let ln = sourceLine (errorPos err) in fname ++ ":" ++ show ln ++ ":parse error" -- show (map messageString (errorMessages err)) pHeader :: IParser [String] pHeader = try (do reserved "module"; i <- identifier; option ';' (lchar ';') return (parseName i)) <|> return [] where parseName x = case span (/='.') x of (x, "") -> [x] (x, '.':y) -> x : parseName y push_indent :: IParser () push_indent = do pos <- getPosition ist <- getState setState (ist { indent_stack = sourceColumn pos : indent_stack ist }) last_indent :: IParser Int last_indent = do ist <- getState case indent_stack ist of (x : xs) -> return x _ -> return 1 indent :: IParser Int indent = do pos <- getPosition return (sourceColumn pos) pop_indent :: IParser () pop_indent = do ist <- getState let (x : xs) = indent_stack ist setState (ist { indent_stack = xs }) open_block :: IParser () open_block = do lchar '{' ist <- getState setState (ist { brace_stack = Nothing : brace_stack ist }) <|> do ist <- getState lvl <- indent setState (ist { brace_stack = Just lvl : brace_stack ist }) close_block :: IParser () close_block = do ist <- getState bs <- case brace_stack ist of Nothing : xs -> do lchar '}' return xs Just lvl : xs -> do i <- indent inp <- getInput -- trace (show (take 10 inp, i, lvl)) $ if (i >= lvl && take 1 inp /= ")") then fail "Not end of block" else return xs setState (ist { brace_stack = bs }) pTerminator = do lchar ';'; pop_indent <|> do c <- indent; l <- last_indent if (c <= l) then pop_indent else fail "Not a terminator" <|> do i <- getInput; if (take 1 i == "}" || take 1 i == ")") then pop_indent else fail "Not a terminator" <|> lookAhead eof pBarTerminator = do lchar '|'; return () <|> do c <- indent; l <- last_indent if (c <= l) then return () else fail "Not a terminator" <|> lookAhead eof pKeepTerminator = do lchar ';'; return () <|> do c <- indent; l <- last_indent if (c <= l) then return () else fail "Not a terminator" <|> do i <- getInput; let h = take 1 i if (h == "}" || h == ")" || h == "|") then return () else fail "Not a terminator" <|> lookAhead eof notEndApp = do c <- indent; l <- last_indent i <- getInput if (c <= l) then fail "Terminator" else return () notEndBlock = do ist <- getState case brace_stack ist of Just lvl : xs -> do i <- indent inp <- getInput if (i < lvl || take 1 inp == ")") then fail "End of block" else return () _ -> return () pfc :: IParser FC pfc = do s <- getPosition let (dir, file) = splitFileName (sourceName s) let f = case dir of "./" -> file _ -> sourceName s return $ FC f (sourceLine s) pImport :: IParser String pImport = do reserved "import" f <- identifier option ';' (lchar ';') return (map dot f) where dot '.' = '/' dot c = c parseProg :: SyntaxInfo -> FilePath -> String -> SourcePos -> Idris [PDecl] parseProg syn fname input pos = do i <- get case (runParser (do setPosition pos whiteSpace ps <- many (pDecl syn) eof i' <- getState return (concat ps, i')) i fname input) of Left err -> fail (ishow err) Right (x, i) -> do put i return (collect x) where ishow err = let ln = sourceLine (errorPos err) in fname ++ ":" ++ show ln ++ ":parse error" ++ " at column " ++ show (sourceColumn (errorPos err)) -- show (map messageString (errorMessages err)) -- Collect PClauses with the same function name collect :: [PDecl] -> [PDecl] collect (c@(PClauses _ o _ _) : ds) = clauses (cname c) [] (c : ds) where clauses n acc (PClauses fc _ _ [PClause n' l ws r w] : ds) | n == n' = clauses n (PClause n' l ws r (collect w) : acc) ds clauses n acc (PClauses fc _ _ [PWith n' l ws r w] : ds) | n == n' = clauses n (PWith n' l ws r (collect w) : acc) ds clauses n acc xs = PClauses (getfc c) o n (reverse acc) : collect xs cname (PClauses fc _ _ [PClause n _ _ _ _]) = n cname (PClauses fc _ _ [PWith n _ _ _ _]) = n getfc (PClauses fc _ _ _) = fc collect (PParams f ns ps : ds) = PParams f ns (collect ps) : collect ds collect (PNamespace ns ps : ds) = PNamespace ns (collect ps) : collect ds collect (PClass f s cs n ps ds : ds') = PClass f s cs n ps (collect ds) : collect ds' collect (PInstance f s cs n ps t ds : ds') = PInstance f s cs n ps t (collect ds) : collect ds' collect (d : ds) = d : collect ds collect [] = [] pFullExpr :: SyntaxInfo -> IParser PTerm pFullExpr syn = do x <- pExpr syn; eof; i <- getState return $ desugar syn i x pDecl :: SyntaxInfo -> IParser [PDecl] pDecl syn = do notEndBlock pDeclBody where pDeclBody = do d <- pDecl' syn i <- getState let d' = fmap (desugar syn i) d return [d'] <|> pUsing syn <|> pParams syn <|> pNamespace syn <|> pClass syn <|> pInstance syn <|> pDirective <|> try (do reserved "import" fp <- identifier lchar ';' fail "imports must be at the top of file") pFunDecl :: SyntaxInfo -> IParser [PDecl] pFunDecl syn = try (do notEndBlock d <- pFunDecl' syn i <- getState let d' = fmap (desugar syn i) d return [d']) --------- Top Level Declarations --------- pDecl' :: SyntaxInfo -> IParser PDecl pDecl' syn = try pFixity <|> pFunDecl' syn <|> try (pData syn) <|> pSyntaxDecl syn pSyntaxDecl :: SyntaxInfo -> IParser PDecl pSyntaxDecl syn = do s <- pSyntaxRule syn i <- getState let rs = syntax_rules i let ns = syntax_keywords i let ibc = ibc_write i let ks = map show (names s) setState (i { syntax_rules = s : rs, syntax_keywords = ks ++ ns, ibc_write = IBCSyntax s : map IBCKeyword ks ++ ibc }) fc <- pfc return (PSyntax fc s) where names (Rule syms _ _) = mapMaybe ename syms ename (Keyword n) = Just n ename _ = Nothing pSyntaxRule :: SyntaxInfo -> IParser Syntax pSyntaxRule syn = do push_indent sty <- option AnySyntax (do reserved "term"; return TermSyntax <|> do reserved "pattern"; return PatternSyntax) reserved "syntax" syms <- many1 pSynSym when (all expr syms) $ fail "No keywords in syntax rule" let ns = mapMaybe name syms when (length ns /= length (nub ns)) $ fail "Repeated variable in syntax rule" lchar '=' tm <- pExpr syn pTerminator return (Rule syms tm sty) where expr (Expr _) = True expr _ = False name (Expr n) = Just n name _ = Nothing pSynSym :: IParser SSymbol pSynSym = try (do lchar '['; n <- pName; lchar ']' return (Expr n)) <|> do n <- iName [] return (Keyword n) <|> do sym <- strlit return (Symbol sym) pFunDecl' :: SyntaxInfo -> IParser PDecl pFunDecl' syn = try (do push_indent acc <- pAccessibility n_in <- pfName let n = expandNS syn n_in ty <- pTSig syn fc <- pfc pTerminator -- ty' <- implicit syn n ty addAcc n acc return (PTy syn fc n ty)) <|> try (pPattern syn) pUsing :: SyntaxInfo -> IParser [PDecl] pUsing syn = do reserved "using"; lchar '(' ns <- tyDeclList syn lchar ')' open_block let uvars = using syn ds <- many1 (pDecl (syn { using = uvars ++ ns })) close_block return (concat ds) pParams :: SyntaxInfo -> IParser [PDecl] pParams syn = do reserved "params"; lchar '(' ns <- tyDeclList syn lchar ')' lchar '{' let pvars = syn_params syn ds <- many1 (pDecl syn { syn_params = pvars ++ ns }) lchar '}' fc <- pfc return [PParams fc ns (concat ds)] pNamespace :: SyntaxInfo -> IParser [PDecl] pNamespace syn = do reserved "namespace"; n <- identifier open_block ds <- many1 (pDecl syn { syn_namespace = n : syn_namespace syn }) close_block return [PNamespace n (concat ds)] expandNS :: SyntaxInfo -> Name -> Name expandNS syn n@(NS _ _) = n expandNS syn n = case syn_namespace syn of [] -> n xs -> NS n xs --------- Fixity --------- pFixity :: IParser PDecl pFixity = do push_indent f <- fixity; i <- natural; ops <- sepBy1 operator (lchar ',') pTerminator let prec = fromInteger i istate <- getState let fs = map (Fix (f prec)) ops setState (istate { idris_infixes = sort (fs ++ idris_infixes istate), ibc_write = map IBCFix fs ++ ibc_write istate }) fc <- pfc return (PFix fc (f prec) ops) fixity :: IParser (Int -> Fixity) fixity = try (do reserved "infixl"; return Infixl) <|> try (do reserved "infixr"; return Infixr) <|> try (do reserved "infix"; return InfixN) <|> try (do reserved "prefix"; return PrefixN) --------- Tyoe classes --------- pClass :: SyntaxInfo -> IParser [PDecl] pClass syn = do acc <- pAccessibility reserved "class" fc <- pfc cons <- pConstList syn n_in <- pName; let n = expandNS syn n_in cs <- many1 carg reserved "where"; open_block ds <- many1 $ pFunDecl syn close_block let allDs = concat ds accData acc n (concatMap declared allDs) return [PClass syn fc cons n cs allDs] where carg = do lchar '('; i <- pName; lchar ':'; ty <- pExpr syn; lchar ')' return (i, ty) <|> do i <- pName; return (i, PSet) pInstance :: SyntaxInfo -> IParser [PDecl] pInstance syn = do reserved "instance" fc <- pfc cs <- pConstList syn cn <- pName args <- many1 (pSimpleExpr syn) let sc = PApp fc (PRef fc cn) (map pexp args) let t = bindList (PPi constraint) (map (\x -> (MN 0 "c", x)) cs) sc reserved "where"; open_block ds <- many1 $ pFunDecl syn close_block return [PInstance syn fc cs cn args t (concat ds)] --------- Expressions --------- pExpr syn = do i <- getState buildExpressionParser (table (idris_infixes i)) (pExpr' syn) pExpr' :: SyntaxInfo -> IParser PTerm pExpr' syn = try (pExtExpr syn) <|> pNoExtExpr syn pExtExpr :: SyntaxInfo -> IParser PTerm pExtExpr syn = do i <- getState pExtensions syn (syntax_rules i) pSimpleExtExpr :: SyntaxInfo -> IParser PTerm pSimpleExtExpr syn = do i <- getState pExtensions syn (filter simple (syntax_rules i)) where simple (Rule (Expr x:xs) _ _) = False simple (Rule [Keyword _] _ _) = True simple (Rule [Symbol _] _ _) = True simple (Rule (_:xs) _ _) = case (last xs) of Keyword _ -> True Symbol _ -> True _ -> False simple _ = False pNoExtExpr syn = try (pApp syn) <|> try (pSimpleExpr syn) <|> pLambda syn <|> pLet syn <|> pPi syn <|> pDoBlock syn <|> pComprehension syn pExtensions :: SyntaxInfo -> [Syntax] -> IParser PTerm pExtensions syn rules = choice (map (\x -> try (pExt syn x)) (filter valid rules)) where valid (Rule _ _ AnySyntax) = True valid (Rule _ _ PatternSyntax) = inPattern syn valid (Rule _ _ TermSyntax) = not (inPattern syn) pExt :: SyntaxInfo -> Syntax -> IParser PTerm pExt syn (Rule (s:ssym) ptm _) = do s1 <- pSymbol pSimpleExpr s smap <- mapM (pSymbol pExpr) ssym let ns = mapMaybe id (s1:smap) return (update ns ptm) -- updated with smap where pSymbol p (Keyword n) = do reserved (show n); return Nothing pSymbol p (Expr n) = do tm <- p syn return $ Just (n, tm) pSymbol p (Symbol s) = do symbol s return Nothing dropn n [] = [] dropn n ((x,t) : xs) | n == x = xs | otherwise = (x,t):dropn n xs update ns (PRef fc n) = case lookup n ns of Just t -> t _ -> PRef fc n update ns (PLam n ty sc) = PLam n (update ns ty) (update (dropn n ns) sc) update ns (PPi p n ty sc) = PPi p n (update ns ty) (update (dropn n ns) sc) update ns (PLet n ty val sc) = PLet n (update ns ty) (update ns val) (update (dropn n ns) sc) update ns (PApp fc t args) = PApp fc (update ns t) (map (fmap (update ns)) args) update ns (PCase fc c opts) = PCase fc (update ns c) (map (pmap (update ns)) opts) update ns (PPair fc l r) = PPair fc (update ns l) (update ns r) update ns (PDPair fc l t r) = PDPair fc (update ns l) (update ns t) (update ns r) update ns (PAlternative as) = PAlternative (map (update ns) as) update ns (PHidden t) = PHidden (update ns t) update ns (PDoBlock ds) = PDoBlock $ upd ns ds where upd ns (DoExp fc t : ds) = DoExp fc (update ns t) : upd ns ds upd ns (DoBind fc n t : ds) = DoBind fc n (update ns t) : upd (dropn n ns) ds upd ns (DoLet fc n ty t : ds) = DoLet fc n (update ns ty) (update ns t) : upd (dropn n ns) ds upd ns (DoBindP fc i t : ds) = DoBindP fc (update ns i) (update ns t) : upd ns ds upd ns (DoLetP fc i t : ds) = DoLetP fc (update ns i) (update ns t) : upd ns ds update ns t = t pName = do i <- getState iName (syntax_keywords i) <|> do reserved "instance" i <- getState UN n <- iName (syntax_keywords i) return (UN ('@':n)) pfName = try pName <|> do lchar '('; o <- operator; lchar ')'; return (UN o) pAccessibility' :: IParser Accessibility pAccessibility' = do reserved "public"; return Public <|> do reserved "abstract"; return Frozen <|> do reserved "private"; return Hidden pAccessibility :: IParser (Maybe Accessibility) pAccessibility = do acc <- pAccessibility'; return (Just acc) <|> return Nothing addAcc :: Name -> Maybe Accessibility -> IParser () addAcc n a = do i <- getState setState (i { hide_list = (n, a) : hide_list i }) pSimpleExpr syn = try (do symbol "!["; t <- pTerm; lchar ']' return $ PQuote t) <|> do lchar '?'; x <- pName; return (PMetavar x) <|> do reserved "refl"; fc <- pfc; return (PRefl fc) -- <|> do reserved "return"; fc <- pfc; return (PReturn fc) <|> do reserved "proof"; lchar '{'; ts <- endBy (pTactic syn) (lchar ';') lchar '}' return (PProof ts) <|> do reserved "tactics"; lchar '{'; ts <- endBy (pTactic syn) (lchar ';') lchar '}' return (PTactics ts) <|> do reserved "case"; fc <- pfc; scr <- pExpr syn; reserved "of"; open_block push_indent opts <- many1 (do notEndBlock x <- pCaseOpt syn pKeepTerminator return x) -- sepBy1 (pCaseOpt syn) (lchar '|') pop_indent close_block return (PCase fc scr opts) <|> try (do x <- pfName; fc <- pfc; return (PRef fc x)) <|> try (pList syn) <|> try (pAlt syn) <|> try (pIdiom syn) <|> try (do lchar '('; bracketed syn) <|> try (do c <- pConstant; fc <- pfc return (modifyConst syn fc (PConstant c))) <|> do reserved "Set"; return PSet <|> try (do symbol "()"; fc <- pfc; return (PTrue fc)) <|> try (do symbol "_|_"; fc <- pfc; return (PFalse fc)) <|> do lchar '_'; return Placeholder <|> pSimpleExtExpr syn bracketed syn = try (pPair syn) <|> try (do e <- pExpr syn; lchar ')'; return e) <|> try (do fc <- pfc; o <- operator; e <- pExpr syn; lchar ')' return $ PLam (MN 0 "x") Placeholder (PApp fc (PRef fc (UN o)) [pexp (PRef fc (MN 0 "x")), pexp e])) <|> try (do fc <- pfc; e <- pSimpleExpr syn; o <- operator; lchar ')' return $ PLam (MN 0 "x") Placeholder (PApp fc (PRef fc (UN o)) [pexp e, pexp (PRef fc (MN 0 "x"))])) pCaseOpt :: SyntaxInfo -> IParser (PTerm, PTerm) pCaseOpt syn = do lhs <- pExpr syn; symbol "=>"; rhs <- pExpr syn return (lhs, rhs) modifyConst :: SyntaxInfo -> FC -> PTerm -> PTerm modifyConst syn fc (PConstant (I x)) | not (inPattern syn) = PApp fc (PRef fc (UN "fromInteger")) [pexp (PConstant (I x))] modifyConst syn fc x = x pList syn = do lchar '['; fc <- pfc xs <- sepBy (pExpr syn) (lchar ','); lchar ']' return (mkList fc xs) where mkList fc [] = PRef fc (UN "Nil") mkList fc (x : xs) = PApp fc (PRef fc (UN "::")) [pexp x, pexp (mkList fc xs)] pPair syn = try (do l <- pExpr syn fc <- pfc rest <- restTuple case rest of [] -> return l [Left r] -> return (PPair fc l r) [Right r] -> return (PDPair fc l Placeholder r)) <|> try (do x <- ntuple lchar ')' return x) <|> do ln <- pName; lchar ':'; lty <- pExpr syn; reservedOp "**"; fc <- pfc r <- pExpr syn; lchar ')'; return (PDPair fc (PRef fc ln) lty r) where restTuple = do lchar ')'; return [] <|> do lchar ',' r <- pExpr syn lchar ')' return [Left r] <|> do reservedOp "**" r <- pExpr syn lchar ')' return [Right r] ntuple = try (do l <- pExpr syn; fc <- pfc; lchar ',' rest <- ntuple return (PPair fc l rest)) <|> (do l <- pExpr syn; fc <- pfc; lchar ',' r <- pExpr syn return (PPair fc l r)) pAlt syn = do symbol "(|"; alts <- sepBy1 (pExpr' syn) (lchar ',') symbol "|)" return (PAlternative alts) pHSimpleExpr syn = do lchar '.' e <- pSimpleExpr syn return $ PHidden e <|> pSimpleExpr syn pApp syn = do f <- pSimpleExpr syn fc <- pfc args <- many1 (do notEndApp pArg syn) return (PApp fc f args) pArg :: SyntaxInfo -> IParser PArg pArg syn = try (pImplicitArg syn) <|> try (pConstraintArg syn) <|> do e <- pSimpleExpr syn return (pexp e) pImplicitArg syn = do lchar '{'; n <- pName fc <- pfc v <- option (PRef fc n) (do lchar '='; pExpr syn) lchar '}' return (pimp n v) pConstraintArg syn = do symbol "@{"; e <- pExpr syn; symbol "}" return (pconst e) pTSig syn = do lchar ':' cs <- pConstList syn sc <- pExpr syn return (bindList (PPi constraint) (map (\x -> (MN 0 "c", x)) cs) sc) pLambda syn = do lchar '\\' (try (do xt <- tyOptDeclList syn symbol "=>" sc <- pExpr syn return (bindList PLam xt sc)) <|> (do ps <- sepBy (do fc <- pfc e <- pSimpleExpr syn return (fc, e)) (lchar ',') symbol "=>" sc <- pExpr syn return (pmList (zip [0..] ps) sc))) where pmList [] sc = sc pmList ((i, (fc, x)) : xs) sc = PLam (MN i "lamp") Placeholder (PCase fc (PRef fc (MN i "lamp")) [(x, (pmList xs sc))]) pLet syn = try (do reserved "let"; n <- pName; ty <- option Placeholder (do lchar ':'; pExpr' syn) lchar '='; v <- pExpr syn reserved "in"; sc <- pExpr syn return (PLet n ty v sc)) <|> (do reserved "let"; fc <- pfc; pat <- pExpr' syn symbol "="; v <- pExpr syn reserved "in"; sc <- pExpr syn return (PCase fc v [(pat, sc)])) pPi syn = try (do lazy <- option False (do lchar '|'; return True) st <- pStatic lchar '('; xt <- tyDeclList syn; lchar ')' symbol "->" sc <- pExpr syn return (bindList (PPi (Exp lazy st)) xt sc)) <|> try (do lazy <- option False (do lchar '|'; return True) st <- pStatic lchar '{'; xt <- tyDeclList syn; lchar '}' symbol "->" sc <- pExpr syn return (bindList (PPi (Imp lazy st)) xt sc)) <|> do --lazy <- option False (do lchar '|'; return True) lchar '{'; reserved "static"; lchar '}' t <- pExpr' syn symbol "->" sc <- pExpr syn return (PPi (Exp False Static) (MN 42 "__pi_arg") t sc) pConstList :: SyntaxInfo -> IParser [PTerm] pConstList syn = try (do lchar '(' tys <- sepBy1 (pExpr' syn) (lchar ',') lchar ')' reservedOp "=>" return tys) <|> try (do t <- pExpr syn reservedOp "=>" return [t]) <|> return [] tyDeclList syn = try (sepBy1 (do x <- pfName; t <- pTSig syn; return (x,t)) (lchar ',')) <|> do ns <- sepBy1 pName (lchar ',') t <- pTSig syn return (map (\x -> (x, t)) ns) tyOptDeclList syn = sepBy1 (do x <- pfName; t <- option Placeholder (do lchar ':' pExpr syn) return (x,t)) (lchar ',') bindList b [] sc = sc bindList b ((n, t):bs) sc = b n t (bindList b bs sc) pComprehension syn = do lchar '['; fc <- pfc; pat <- pExpr syn; lchar '|'; qs <- sepBy1 (pDo syn) (lchar ','); lchar ']'; return (PDoBlock (map addGuard qs ++ [DoExp fc (PApp fc (PRef fc (UN "return")) [pexp pat])])) where addGuard (DoExp fc e) = DoExp fc (PApp fc (PRef fc (UN "guard")) [pexp e]) addGuard x = x pDoBlock syn = do reserved "do"; open_block push_indent ds <- many1 (do notEndBlock x <- pDo syn; pKeepTerminator; return x) pop_indent close_block return (PDoBlock ds) pDo syn = try (do reserved "let"; i <- pName; ty <- option Placeholder (do lchar ':'; pExpr' syn) reservedOp "="; fc <- pfc e <- pExpr syn return (DoLet fc i ty e)) <|> try (do reserved "let"; i <- pExpr' syn; reservedOp "="; fc <- pfc sc <- pExpr syn return (DoLetP fc i sc)) <|> try (do i <- pName; symbol "<-"; fc <- pfc e <- pExpr syn; return (DoBind fc i e)) <|> try (do i <- pExpr' syn; symbol "<-"; fc <- pfc e <- pExpr syn; return (DoBindP fc i e)) <|> try (do e <- pExpr syn; fc <- pfc return (DoExp fc e)) pIdiom syn = do symbol "[|"; fc <- pfc; e <- pExpr syn; symbol "|]" return (PIdiom fc e) pConstant :: IParser Const pConstant = do reserved "Integer";return BIType <|> do reserved "Int"; return IType <|> do reserved "Char"; return ChType <|> do reserved "Float"; return FlType <|> do reserved "String"; return StrType <|> do reserved "Ptr"; return PtrType <|> try (do f <- float; return $ Fl f) <|> try (do i <- natural; lchar 'L'; return $ BI i) <|> try (do i <- natural; return $ I (fromInteger i)) <|> try (do s <- strlit; return $ Str s) <|> try (do c <- chlit; return $ Ch c) pStatic :: IParser Static pStatic = do lchar '['; reserved "static"; lchar ']'; return Static <|> return Dynamic table fixes = [[prefix "-" (\fc x -> PApp fc (PRef fc (UN "-")) [pexp (PApp fc (PRef fc (UN "fromInteger")) [pexp (PConstant (I 0))]), pexp x])]] ++ toTable (reverse fixes) ++ [[binary "=" (\fc x y -> PEq fc x y) AssocLeft], [binary "->" (\fc x y -> PPi expl (MN 42 "__pi_arg") x y) AssocRight]] toTable fs = map (map toBin) (groupBy (\ (Fix x _) (Fix y _) -> prec x == prec y) fs) where toBin (Fix (PrefixN _) op) = prefix op (\fc x -> PApp fc (PRef fc (UN op)) [pexp x]) toBin (Fix f op) = binary op (\fc x y -> PApp fc (PRef fc (UN op)) [pexp x,pexp y]) (assoc f) assoc (Infixl _) = AssocLeft assoc (Infixr _) = AssocRight assoc (InfixN _) = AssocNone binary name f assoc = Infix (do { reservedOp name; fc <- pfc; return (f fc) }) assoc prefix name f = Prefix (do { reservedOp name; fc <- pfc; return (f fc) }) --------- Data declarations --------- -- (works for classes too - 'abstract' means the data/class is visible but members not) accData :: Maybe Accessibility -> Name -> [Name] -> IParser () accData (Just Frozen) n ns = do addAcc n (Just Frozen) mapM_ (\n -> addAcc n (Just Hidden)) ns accData a n ns = do addAcc n a; mapM_ (\n -> addAcc n a) ns pData :: SyntaxInfo -> IParser PDecl pData syn = try (do acc <- pAccessibility reserved "data"; fc <- pfc tyn_in <- pfName; ty <- pTSig syn let tyn = expandNS syn tyn_in reserved "where" open_block push_indent cons <- many (do notEndBlock c <- pConstructor syn pKeepTerminator return c) -- (lchar '|') pop_indent close_block accData acc tyn (map (\ (n, _, _) -> n) cons) return $ PData syn fc (PDatadecl tyn ty cons)) <|> try (do push_indent acc <- pAccessibility reserved "data"; fc <- pfc tyn_in <- pfName; args <- many pName let tyn = expandNS syn tyn_in lchar '=' cons <- sepBy1 (pSimpleCon syn) (lchar '|') pTerminator let conty = mkPApp fc (PRef fc tyn) (map (PRef fc) args) let ty = bindArgs (map (\a -> PSet) args) PSet cons' <- mapM (\ (x, cargs, cfc) -> do let cty = bindArgs cargs conty return (x, cty, cfc)) cons accData acc tyn (map (\ (n, _, _) -> n) cons') return $ PData syn fc (PDatadecl tyn ty cons')) where mkPApp fc t [] = t mkPApp fc t xs = PApp fc t (map pexp xs) bindArgs :: [PTerm] -> PTerm -> PTerm bindArgs [] t = t bindArgs (x:xs) t = PPi expl (MN 0 "t") x (bindArgs xs t) pConstructor :: SyntaxInfo -> IParser (Name, PTerm, FC) pConstructor syn = do cn_in <- pfName; fc <- pfc let cn = expandNS syn cn_in ty <- pTSig syn -- ty' <- implicit syn cn ty return (cn, ty, fc) pSimpleCon :: SyntaxInfo -> IParser (Name, [PTerm], FC) pSimpleCon syn = do cn_in <- pfName let cn = expandNS syn cn_in fc <- pfc args <- many (do notEndApp pSimpleExpr syn) return (cn, args, fc) --------- Pattern match clauses --------- pPattern :: SyntaxInfo -> IParser PDecl pPattern syn = do clause <- pClause syn fc <- pfc return (PClauses fc [] (MN 2 "_") [clause]) -- collect together later pArgExpr syn = let syn' = syn { inPattern = True } in try (pHSimpleExpr syn') <|> pSimpleExtExpr syn' pRHS :: SyntaxInfo -> Name -> IParser PTerm pRHS syn n = do lchar '='; pExpr syn <|> do symbol "?="; rhs <- pExpr syn; return (PLet (UN "value") Placeholder rhs (PMetavar n')) <|> do reserved "impossible"; return PImpossible where mkN (UN x) = UN (x++"_lemma_1") mkN (NS x n) = NS (mkN x) n n' = mkN n pClause :: SyntaxInfo -> IParser PClause pClause syn = try (do push_indent n_in <- pfName; let n = expandNS syn n_in cargs <- many (pConstraintArg syn) iargs <- many (pImplicitArg syn) fc <- pfc args <- many (pArgExpr syn) wargs <- many (pWExpr syn) rhs <- pRHS syn n ist <- getState let ctxt = tt_ctxt ist let wsyn = syn { syn_namespace = [] } (wheres, nmap) <- choice [do x <- pWhereblock n wsyn pop_indent return x, do pTerminator return ([], [])] let capp = PApp fc (PRef fc n) (iargs ++ cargs ++ map pexp args) ist <- getState setState (ist { lastParse = Just n }) return $ PClause n capp wargs rhs wheres) <|> try (do push_indent wargs <- many1 (pWExpr syn) ist <- getState n <- case lastParse ist of Just t -> return t Nothing -> fail "Invalid clause" rhs <- pRHS syn n let ctxt = tt_ctxt ist let wsyn = syn { syn_namespace = [] } (wheres, nmap) <- choice [do x <- pWhereblock n wsyn pop_indent return x, do pTerminator return ([], [])] return $ PClauseR wargs rhs wheres) <|> try (do push_indent n_in <- pfName; let n = expandNS syn n_in cargs <- many (pConstraintArg syn) iargs <- many (pImplicitArg syn) fc <- pfc args <- many (pArgExpr syn) wargs <- many (pWExpr syn) let capp = PApp fc (PRef fc n) (iargs ++ cargs ++ map pexp args) reserved "with" wval <- pSimpleExpr syn open_block ds <- many1 $ pFunDecl syn let withs = map (fillLHSD n capp wargs) $ concat ds close_block ist <- getState setState (ist { lastParse = Just n }) pop_indent return $ PWith n capp wargs wval withs) <|> try (do wargs <- many1 (pWExpr syn) reserved "with" wval <- pSimpleExpr syn open_block ds <- many1 $ pFunDecl syn let withs = concat ds close_block return $ PWithR wargs wval withs) <|> do push_indent l <- pArgExpr syn op <- operator let n = expandNS syn (UN op) r <- pArgExpr syn fc <- pfc wargs <- many (pWExpr syn) rhs <- pRHS syn n let wsyn = syn { syn_namespace = [] } (wheres, nmap) <- choice [do x <- pWhereblock n wsyn pop_indent return x, do pTerminator return ([], [])] ist <- getState let capp = PApp fc (PRef fc n) [pexp l, pexp r] setState (ist { lastParse = Just n }) return $ PClause n capp wargs rhs wheres <|> do l <- pArgExpr syn op <- operator let n = expandNS syn (UN op) r <- pArgExpr syn fc <- pfc wargs <- many (pWExpr syn) reserved "with" wval <- pSimpleExpr syn open_block ds <- many1 $ pFunDecl syn close_block ist <- getState let capp = PApp fc (PRef fc n) [pexp l, pexp r] let withs = map (fillLHSD n capp wargs) $ concat ds setState (ist { lastParse = Just n }) return $ PWith n capp wargs wval withs where fillLHS n capp owargs (PClauseR wargs v ws) = PClause n capp (owargs ++ wargs) v ws fillLHS n capp owargs (PWithR wargs v ws) = PWith n capp (owargs ++ wargs) v (map (fillLHSD n capp (owargs ++ wargs)) ws) fillLHS _ _ _ c = c fillLHSD n c a (PClauses fc o fn cs) = PClauses fc o fn (map (fillLHS n c a) cs) fillLHSD n c a x = x pWExpr :: SyntaxInfo -> IParser PTerm pWExpr syn = do lchar '|'; pExpr' syn pWhereblock :: Name -> SyntaxInfo -> IParser ([PDecl], [(Name, Name)]) pWhereblock n syn = do reserved "where"; open_block ds <- many1 $ pFunDecl syn let dns = concatMap (concatMap declared) ds close_block return (concat ds, map (\x -> (x, decoration syn x)) dns) pDirective :: IParser [PDecl] pDirective = try (do lchar '%'; reserved "lib"; lib <- strlit; return [PDirective (do addLib lib addIBC (IBCLib lib))]) <|> try (do lchar '%'; reserved "link"; obj <- strlit; return [PDirective (do datadir <- liftIO $ getDataDir o <- liftIO $ findInPath [".", datadir] obj addIBC (IBCObj o) addObjectFile o)]) <|> try (do lchar '%'; reserved "include"; hdr <- strlit; return [PDirective (do addHdr hdr addIBC (IBCHeader hdr))]) <|> try (do lchar '%'; reserved "hide"; n <- iName [] return [PDirective (do setAccessibility n Hidden addIBC (IBCAccess n Hidden))]) <|> try (do lchar '%'; reserved "freeze"; n <- iName [] return [PDirective (do setAccessibility n Frozen addIBC (IBCAccess n Frozen))]) <|> try (do lchar '%'; reserved "access"; acc <- pAccessibility' return [PDirective (do i <- getIState putIState (i { default_access = acc }))]) <|> do lchar '%'; reserved "logging"; i <- natural; return [PDirective (setLogLevel (fromInteger i))] pTactic :: SyntaxInfo -> IParser PTactic pTactic syn = do reserved "intro"; ns <- sepBy pName (lchar ',') return $ Intro ns <|> do reserved "intros"; return Intros <|> try (do reserved "refine"; n <- pName imps <- many1 imp return $ Refine n imps) <|> do reserved "refine"; n <- pName i <- getState return $ Refine n [] <|> do reserved "rewrite"; t <- pExpr syn; i <- getState return $ Rewrite (desugar syn i t) <|> do reserved "let"; n <- pName; lchar '='; t <- pExpr syn; i <- getState return $ LetTac n (desugar syn i t) <|> do reserved "focus"; n <- pName return $ Focus n <|> do reserved "exact"; t <- pExpr syn; i <- getState return $ Exact (desugar syn i t) <|> do reserved "try"; t <- pTactic syn; lchar '|'; t1 <- pTactic syn return $ Try t t1 <|> do lchar '{' t <- pTactic syn; lchar ';'; t1 <- pTactic syn; lchar '}' return $ TSeq t t1 <|> do reserved "compute"; return Compute <|> do reserved "trivial"; return Trivial <|> do reserved "solve"; return Solve <|> do reserved "attack"; return Attack <|> do reserved "state"; return ProofState <|> do reserved "term"; return ProofTerm <|> do reserved "undo"; return Undo <|> do reserved "qed"; return Qed where imp = do lchar '?'; return False <|> do lchar '_'; return True desugar :: SyntaxInfo -> IState -> PTerm -> PTerm desugar syn i t = let t' = expandDo (dsl_info syn) t in t' -- addImpl i t' expandDo :: DSL -> PTerm -> PTerm expandDo dsl (PLam n ty tm) = PLam n (expandDo dsl ty) (expandDo dsl tm) expandDo dsl (PLet n ty v tm) = PLet n (expandDo dsl ty) (expandDo dsl v) (expandDo dsl tm) expandDo dsl (PPi p n ty tm) = PPi p n (expandDo dsl ty) (expandDo dsl tm) expandDo dsl (PApp fc t args) = PApp fc (expandDo dsl t) (map (fmap (expandDo dsl)) args) expandDo dsl (PCase fc s opts) = PCase fc (expandDo dsl s) (map (pmap (expandDo dsl)) opts) expandDo dsl (PPair fc l r) = PPair fc (expandDo dsl l) (expandDo dsl r) expandDo dsl (PDPair fc l t r) = PDPair fc (expandDo dsl l) (expandDo dsl t) (expandDo dsl r) expandDo dsl (PAlternative as) = PAlternative (map (expandDo dsl) as) expandDo dsl (PHidden t) = PHidden (expandDo dsl t) expandDo dsl (PReturn fc) = dsl_return dsl expandDo dsl (PDoBlock ds) = expandDo dsl $ block (dsl_bind dsl) ds where block b [DoExp fc tm] = tm block b [a] = PElabError "Last statement in do block must be an expression" block b (DoBind fc n tm : rest) = PApp fc b [pexp tm, pexp (PLam n Placeholder (block b rest))] block b (DoBindP fc p tm : rest) = PApp fc b [pexp tm, pexp (PLam (MN 0 "bpat") Placeholder (PCase fc (PRef fc (MN 0 "bpat")) [(p, block b rest)]))] block b (DoLet fc n ty tm : rest) = PLet n ty tm (block b rest) block b (DoLetP fc p tm : rest) = PCase fc tm [(p, block b rest)] block b (DoExp fc tm : rest) = PApp fc b [pexp tm, pexp (PLam (MN 0 "bindx") Placeholder (block b rest))] block b _ = PElabError "Invalid statement in do block" expandDo dsl (PIdiom fc e) = expandDo dsl $ unIdiom (dsl_apply dsl) (dsl_pure dsl) fc e expandDo dsl t = t unIdiom :: PTerm -> PTerm -> FC -> PTerm -> PTerm unIdiom ap pure fc e@(PApp _ _ _) = let f = getFn e in mkap (getFn e) where getFn (PApp fc f args) = (PApp fc pure [pexp f], args) getFn f = (f, []) mkap (f, []) = f mkap (f, a:as) = mkap (PApp fc ap [pexp f, a], as) unIdiom ap pure fc e = PApp fc pure [pexp e]