git.iko.soy/Idris-dev
on 8063cfd help sign in
Idris-dev/src/Idris/AbsSyntaxTree.hs
1020 lines 35 kB history raw
1{-# LANGUAGE MultiParamTypeClasses, FlexibleInstances, DeriveFunctor,
2 TypeSynonymInstances, PatternGuards #-}
4module Idris.AbsSyntaxTree where
6import Core.TT
7import Core.Evaluate
8import Core.Elaborate hiding (Tactic(..))
9import Core.Typecheck
10import IRTS.Lang
11import Util.Pretty
13import Paths_idris
15import System.Console.Haskeline
17import Control.Monad.State
19import Data.List
20import Data.Char
21import Data.Either
23import Debug.Trace
25data IOption = IOption { opt_logLevel :: Int,
26 opt_typecase :: Bool,
27 opt_typeintype :: Bool,
28 opt_coverage :: Bool,
29 opt_showimp :: Bool,
30 opt_errContext :: Bool,
31 opt_repl :: Bool,
32 opt_verbose :: Bool,
33 opt_ibcsubdir :: FilePath,
34 opt_importdirs :: [FilePath],
35 opt_cmdline :: [Opt] -- remember whole command line
36 }
37 deriving (Show, Eq)
39defaultOpts = IOption 0 False False True False False True True "" [] []
41-- TODO: Add 'module data' to IState, which can be saved out and reloaded quickly (i.e
42-- without typechecking).
43-- This will include all the functions and data declarations, plus fixity declarations
44-- and syntax macros.
46data IState = IState {
47 tt_ctxt :: Context,
48 idris_constraints :: [(UConstraint, FC)],
49 idris_infixes :: [FixDecl],
50 idris_implicits :: Ctxt [PArg],
51 idris_statics :: Ctxt [Bool],
52 idris_classes :: Ctxt ClassInfo,
53 idris_dsls :: Ctxt DSL,
54 idris_optimisation :: Ctxt OptInfo,
55 idris_datatypes :: Ctxt TypeInfo,
56 idris_patdefs :: Ctxt [([Name], Term, Term)], -- not exported
57 idris_flags :: Ctxt [FnOpt],
58 idris_callgraph :: Ctxt CGInfo, -- name, args used in each pos
59 idris_calledgraph :: Ctxt [Name],
60 idris_totcheck :: [(FC, Name)],
61 idris_log :: String,
62 idris_options :: IOption,
63 idris_name :: Int,
64 idris_metavars :: [Name],
65 syntax_rules :: [Syntax],
66 syntax_keywords :: [String],
67 imported :: [FilePath],
68 idris_scprims :: [(Name, (Int, PrimFn))],
69 idris_objs :: [FilePath],
70 idris_libs :: [String],
71 idris_hdrs :: [String],
72 proof_list :: [(Name, [String])],
73 errLine :: Maybe Int,
74 lastParse :: Maybe Name,
75 indent_stack :: [Int],
76 brace_stack :: [Maybe Int],
77 hide_list :: [(Name, Maybe Accessibility)],
78 default_access :: Accessibility,
79 ibc_write :: [IBCWrite],
80 compiled_so :: Maybe String
81 }
83data CGInfo = CGInfo { argsdef :: [Name],
84 calls :: [(Name, [[Name]])],
85 argsused :: [Name],
86 unusedpos :: [Int] }
87 deriving Show
88{-!
89deriving instance Binary CGInfo
90!-}
92primDefs = [UN "unsafePerformIO", UN "mkLazyForeign", UN "mkForeign", UN "FalseElim"]
94-- information that needs writing for the current module's .ibc file
95data IBCWrite = IBCFix FixDecl
96 | IBCImp Name
97 | IBCStatic Name
98 | IBCClass Name
99 | IBCInstance Bool Name Name
100 | IBCDSL Name
101 | IBCData Name
102 | IBCOpt Name
103 | IBCSyntax Syntax
104 | IBCKeyword String
105 | IBCImport FilePath
106 | IBCObj FilePath
107 | IBCLib String
108 | IBCHeader String
109 | IBCAccess Name Accessibility
110 | IBCTotal Name Totality
111 | IBCFlags Name [FnOpt]
112 | IBCCG Name
113 | IBCDef Name -- i.e. main context
114 deriving Show
116idrisInit = IState initContext [] [] emptyContext emptyContext emptyContext
117 emptyContext emptyContext emptyContext emptyContext
118 emptyContext emptyContext emptyContext
119 [] "" defaultOpts 6 [] [] [] [] [] [] [] []
120 [] Nothing Nothing [] [] [] Hidden [] Nothing
122-- The monad for the main REPL - reading and processing files and updating
123-- global state (hence the IO inner monad).
124type Idris = StateT IState (InputT IO)
126-- Commands in the REPL
128data Target = ViaC | ViaJava
130data Command = Quit
131 | Help
132 | Eval PTerm
133 | Check PTerm
134 | TotCheck Name
135 | Reload
136 | Edit
137 | Compile Target String
138 | Execute
139 | ExecVal PTerm
140 | NewCompile String
141 | Metavars
142 | Prove Name
143 | AddProof Name
144 | RmProof Name
145 | ShowProof Name
146 | Proofs
147 | Universes
148 | TTShell
149 | LogLvl Int
150 | Spec PTerm
151 | HNF PTerm
152 | Defn Name
153 | Info Name
154 | Missing Name
155 | DebugInfo Name
156 | Search PTerm
157 | SetOpt Opt
158 | UnsetOpt Opt
159 | NOP
161data Opt = Filename String
162 | Ver
163 | Usage
164 | ShowLibs
165 | ShowLibdir
166 | ShowIncs
167 | NoPrelude
168 | NoREPL
169 | OLogging Int
170 | Output String
171 | NewOutput String
172 | TypeCase
173 | TypeInType
174 | NoCoverage
175 | ErrContext
176 | ShowImpl
177 | Verbose
178 | IBCSubDir String
179 | ImportDir String
180 | PkgBuild String
181 | PkgInstall String
182 | PkgClean String
183 | WarnOnly
184 | Pkg String
185 | BCAsm String
186 | DumpC String
187 | DumpCases String
188 | FOVM String
189 deriving (Show, Eq)
192-- Parsed declarations
194data Fixity = Infixl { prec :: Int }
195 | Infixr { prec :: Int }
196 | InfixN { prec :: Int }
197 | PrefixN { prec :: Int }
198 deriving Eq
199{-!
200deriving instance Binary Fixity
201!-}
203instance Show Fixity where
204 show (Infixl i) = "infixl " ++ show i
205 show (Infixr i) = "infixr " ++ show i
206 show (InfixN i) = "infix " ++ show i
207 show (PrefixN i) = "prefix " ++ show i
209data FixDecl = Fix Fixity String
210 deriving (Show, Eq)
211{-!
212deriving instance Binary FixDecl
213!-}
215instance Ord FixDecl where
216 compare (Fix x _) (Fix y _) = compare (prec x) (prec y)
219data Static = Static | Dynamic
220 deriving (Show, Eq)
221{-!
222deriving instance Binary Static
223!-}
225-- Mark bindings with their explicitness, and laziness
226data Plicity = Imp { plazy :: Bool,
227 pstatic :: Static }
228 | Exp { plazy :: Bool,
229 pstatic :: Static }
230 | Constraint { plazy :: Bool,
231 pstatic :: Static }
232 | TacImp { plazy :: Bool,
233 pstatic :: Static,
234 pscript :: PTerm }
235 deriving (Show, Eq)
237{-!
238deriving instance Binary Plicity
239!-}
241impl = Imp False Dynamic
242expl = Exp False Dynamic
243constraint = Constraint False Dynamic
244tacimpl = TacImp False Dynamic
246data FnOpt = Inlinable | TotalFn | AssertTotal | TCGen
247 | CExport String -- export, with a C name
248 | Specialise [Name] -- specialise it, freeze these names
249 deriving (Show, Eq)
250{-!
251deriving instance Binary FnOpt
252!-}
254type FnOpts = [FnOpt]
256inlinable :: FnOpts -> Bool
257inlinable = elem Inlinable
259data PDecl' t = PFix FC Fixity [String] -- fixity declaration
260 | PTy SyntaxInfo FC FnOpts Name t -- type declaration
261 | PClauses FC FnOpts Name [PClause' t] -- pattern clause
262 | PCAF FC Name t -- top level constant
263 | PData SyntaxInfo FC (PData' t) -- data declaration
264 | PParams FC [(Name, t)] [PDecl' t] -- params block
265 | PNamespace String [PDecl' t] -- new namespace
266 | PRecord SyntaxInfo FC Name t Name t -- record declaration
267 | PClass SyntaxInfo FC
268 [t] -- constraints
269 Name
270 [(Name, t)] -- parameters
271 [PDecl' t] -- declarations
272 | PInstance SyntaxInfo FC [t] -- constraints
273 Name -- class
274 [t] -- parameters
275 t -- full instance type
276 (Maybe Name) -- explicit name
277 [PDecl' t]
278 | PDSL Name (DSL' t)
279 | PSyntax FC Syntax
280 | PDirective (Idris ())
281 deriving Functor
282{-!
283deriving instance Binary PDecl'
284!-}
286data PClause' t = PClause FC Name t [t] t [PDecl' t]
287 | PWith FC Name t [t] t [PDecl' t]
288 | PClauseR FC [t] t [PDecl' t]
289 | PWithR FC [t] t [PDecl' t]
290 deriving Functor
291{-!
292deriving instance Binary PClause'
293!-}
295data PData' t = PDatadecl { d_name :: Name,
296 d_tcon :: t,
297 d_cons :: [(Name, t, FC)] }
298 deriving Functor
299{-!
300deriving instance Binary PData'
301!-}
303-- Handy to get a free function for applying PTerm -> PTerm functions
304-- across a program, by deriving Functor
306type PDecl = PDecl' PTerm
307type PData = PData' PTerm
308type PClause = PClause' PTerm
310-- get all the names declared in a decl
312declared :: PDecl -> [Name]
313declared (PFix _ _ _) = []
314declared (PTy _ _ _ n t) = [n]
315declared (PClauses _ _ n _) = [] -- not a declaration
316declared (PData _ _ (PDatadecl n _ ts)) = n : map fstt ts
317 where fstt (a, _, _) = a
318declared (PParams _ _ ds) = concatMap declared ds
319declared (PNamespace _ ds) = concatMap declared ds
320-- declared (PImport _) = []
322defined :: PDecl -> [Name]
323defined (PFix _ _ _) = []
324defined (PTy _ _ _ n t) = []
325defined (PClauses _ _ n _) = [n] -- not a declaration
326defined (PData _ _ (PDatadecl n _ ts)) = n : map fstt ts
327 where fstt (a, _, _) = a
328defined (PParams _ _ ds) = concatMap defined ds
329defined (PNamespace _ ds) = concatMap defined ds
330-- declared (PImport _) = []
332updateN :: [(Name, Name)] -> Name -> Name
333updateN ns n | Just n' <- lookup n ns = n'
334updateN _ n = n
336updateNs :: [(Name, Name)] -> PTerm -> PTerm
337updateNs [] t = t
338updateNs ns t = mapPT updateRef t
339 where updateRef (PRef fc f) = PRef fc (updateN ns f)
340 updateRef t = t
342-- updateDNs :: [(Name, Name)] -> PDecl -> PDecl
343-- updateDNs [] t = t
344-- updateDNs ns (PTy s f n t) | Just n' <- lookup n ns = PTy s f n' t
345-- updateDNs ns (PClauses f n c) | Just n' <- lookup n ns = PClauses f n' (map updateCNs c)
346-- where updateCNs ns (PClause n l ts r ds)
347-- = PClause (updateN ns n) (fmap (updateNs ns) l)
348-- (map (fmap (updateNs ns)) ts)
349-- (fmap (updateNs ns) r)
350-- (map (updateDNs ns) ds)
351-- updateDNs ns c = c
353-- High level language terms
355data PTerm = PQuote Raw
356 | PRef FC Name
357 | PPatvar FC Name
358 | PLam Name PTerm PTerm
359 | PPi Plicity Name PTerm PTerm
360 | PLet Name PTerm PTerm PTerm
361 | PTyped PTerm PTerm -- term with explicit type
362 | PApp FC PTerm [PArg]
363 | PCase FC PTerm [(PTerm, PTerm)]
364 | PTrue FC
365 | PFalse FC
366 | PRefl FC
367 | PResolveTC FC
368 | PEq FC PTerm PTerm
369 | PPair FC PTerm PTerm
370 | PDPair FC PTerm PTerm PTerm
371 | PAlternative Bool [PTerm] -- True if only one may work
372 | PHidden PTerm -- irrelevant or hidden pattern
373 | PSet
374 | PConstant Const
375 | Placeholder
376 | PDoBlock [PDo]
377 | PIdiom FC PTerm
378 | PReturn FC
379 | PMetavar Name
380 | PProof [PTactic]
381 | PTactics [PTactic] -- as PProof, but no auto solving
382 | PElabError Err -- error to report on elaboration
383 | PImpossible -- special case for declaring when an LHS can't typecheck
384 deriving Eq
385{-!
386deriving instance Binary PTerm
387!-}
389mapPT :: (PTerm -> PTerm) -> PTerm -> PTerm
390mapPT f t = f (mpt t) where
391 mpt (PLam n t s) = PLam n (mapPT f t) (mapPT f s)
392 mpt (PPi p n t s) = PPi p n (mapPT f t) (mapPT f s)
393 mpt (PLet n ty v s) = PLet n (mapPT f ty) (mapPT f v) (mapPT f s)
394 mpt (PApp fc t as) = PApp fc (mapPT f t) (map (fmap (mapPT f)) as)
395 mpt (PCase fc c os) = PCase fc (mapPT f c) (map (pmap (mapPT f)) os)
396 mpt (PEq fc l r) = PEq fc (mapPT f l) (mapPT f r)
397 mpt (PTyped l r) = PTyped (mapPT f l) (mapPT f r)
398 mpt (PPair fc l r) = PPair fc (mapPT f l) (mapPT f r)
399 mpt (PDPair fc l t r) = PDPair fc (mapPT f l) (mapPT f t) (mapPT f r)
400 mpt (PAlternative a as) = PAlternative a (map (mapPT f) as)
401 mpt (PHidden t) = PHidden (mapPT f t)
402 mpt (PDoBlock ds) = PDoBlock (map (fmap (mapPT f)) ds)
403 mpt (PProof ts) = PProof (map (fmap (mapPT f)) ts)
404 mpt (PTactics ts) = PTactics (map (fmap (mapPT f)) ts)
405 mpt x = x
408data PTactic' t = Intro [Name] | Intros | Focus Name
409 | Refine Name [Bool] | Rewrite t | LetTac Name t
410 | Exact t | Compute | Trivial
411 | Solve
412 | Attack
413 | ProofState | ProofTerm | Undo
414 | Try (PTactic' t) (PTactic' t)
415 | TSeq (PTactic' t) (PTactic' t)
416 | Qed | Abandon
417 deriving (Show, Eq, Functor)
418{-!
419deriving instance Binary PTactic'
420!-}
422instance Sized a => Sized (PTactic' a) where
423 size (Intro nms) = 1 + size nms
424 size Intros = 1
425 size (Focus nm) = 1 + size nm
426 size (Refine nm bs) = 1 + size nm + length bs
427 size (Rewrite t) = 1 + size t
428 size (LetTac nm t) = 1 + size nm + size t
429 size (Exact t) = 1 + size t
430 size Compute = 1
431 size Trivial = 1
432 size Solve = 1
433 size Attack = 1
434 size ProofState = 1
435 size ProofTerm = 1
436 size Undo = 1
437 size (Try l r) = 1 + size l + size r
438 size (TSeq l r) = 1 + size l + size r
439 size Qed = 1
440 size Abandon = 1
442type PTactic = PTactic' PTerm
444data PDo' t = DoExp FC t
445 | DoBind FC Name t
446 | DoBindP FC t t
447 | DoLet FC Name t t
448 | DoLetP FC t t
449 deriving (Eq, Functor)
450{-!
451deriving instance Binary PDo'
452!-}
454instance Sized a => Sized (PDo' a) where
455 size (DoExp fc t) = 1 + size fc + size t
456 size (DoBind fc nm t) = 1 + size fc + size nm + size t
457 size (DoBindP fc l r) = 1 + size fc + size l + size r
458 size (DoLet fc nm l r) = 1 + size fc + size nm + size l + size r
459 size (DoLetP fc l r) = 1 + size fc + size l + size r
461type PDo = PDo' PTerm
463-- The priority gives a hint as to elaboration order. Best to elaborate
464-- things early which will help give a more concrete type to other
465-- variables, e.g. a before (interpTy a).
467data PArg' t = PImp { priority :: Int,
468 lazyarg :: Bool, pname :: Name, getTm :: t }
469 | PExp { priority :: Int,
470 lazyarg :: Bool, getTm :: t }
471 | PConstraint { priority :: Int,
472 lazyarg :: Bool, getTm :: t }
473 | PTacImplicit { priority :: Int,
474 lazyarg :: Bool, pname :: Name,
475 getScript :: t,
476 getTm :: t }
477 deriving (Show, Eq, Functor)
479instance Sized a => Sized (PArg' a) where
480 size (PImp p l nm trm) = 1 + size nm + size trm
481 size (PExp p l trm) = 1 + size trm
482 size (PConstraint p l trm) = 1 + size trm
483 size (PTacImplicit p l nm scr trm) = 1 + size nm + size scr + size trm
485{-!
486deriving instance Binary PArg'
487!-}
489pimp = PImp 0 True
490pexp = PExp 0 False
491pconst = PConstraint 0 False
492ptacimp = PTacImplicit 0 True
494type PArg = PArg' PTerm
496-- Type class data
498data ClassInfo = CI { instanceName :: Name,
499 class_methods :: [(Name, (FnOpts, PTerm))],
500 class_defaults :: [(Name, (Name, PDecl))], -- method name -> default impl
501 class_params :: [Name],
502 class_instances :: [Name] }
503 deriving Show
504{-!
505deriving instance Binary ClassInfo
506!-}
508data OptInfo = Optimise { collapsible :: Bool,
509 forceable :: [Int], -- argument positions
510 recursive :: [Int] }
511 deriving Show
512{-!
513deriving instance Binary OptInfo
514!-}
517data TypeInfo = TI { con_names :: [Name] }
518 deriving Show
519{-!
520deriving instance Binary TypeInfo
521!-}
523-- Syntactic sugar info
525data DSL' t = DSL { dsl_bind :: t,
526 dsl_return :: t,
527 dsl_apply :: t,
528 dsl_pure :: t,
529 dsl_var :: Maybe t,
530 index_first :: Maybe t,
531 index_next :: Maybe t,
532 dsl_lambda :: Maybe t,
533 dsl_let :: Maybe t
534 }
535 deriving (Show, Functor)
536{-!
537deriving instance Binary DSL'
538!-}
540type DSL = DSL' PTerm
542data SynContext = PatternSyntax | TermSyntax | AnySyntax
543 deriving Show
544{-!
545deriving instance Binary SynContext
546!-}
548data Syntax = Rule [SSymbol] PTerm SynContext
549 deriving Show
550{-!
551deriving instance Binary Syntax
552!-}
554data SSymbol = Keyword Name
555 | Symbol String
556 | Binding Name
557 | Expr Name
558 | SimpleExpr Name
559 deriving Show
560{-!
561deriving instance Binary SSymbol
562!-}
564initDSL = DSL (PRef f (UN ">>="))
565 (PRef f (UN "return"))
566 (PRef f (UN "<$>"))
567 (PRef f (UN "pure"))
568 Nothing
569 Nothing
570 Nothing
571 Nothing
572 Nothing
573 where f = FC "(builtin)" 0
575data SyntaxInfo = Syn { using :: [(Name, PTerm)],
576 syn_params :: [(Name, PTerm)],
577 syn_namespace :: [String],
578 no_imp :: [Name],
579 decoration :: Name -> Name,
580 inPattern :: Bool,
581 implicitAllowed :: Bool,
582 dsl_info :: DSL }
583 deriving Show
584{-!
585deriving instance Binary SyntaxInfo
586!-}
588defaultSyntax = Syn [] [] [] [] id False False initDSL
590expandNS :: SyntaxInfo -> Name -> Name
591expandNS syn n@(NS _ _) = n
592expandNS syn n = case syn_namespace syn of
593 [] -> n
594 xs -> NS n xs
597--- Pretty printing declarations and terms
599instance Show PTerm where
600 show tm = showImp False tm
602instance Pretty PTerm where
603 pretty = prettyImp False
605instance Show PDecl where
606 show d = showDeclImp False d
608instance Show PClause where
609 show c = showCImp True c
611instance Show PData where
612 show d = showDImp False d
614showDeclImp _ (PFix _ f ops) = show f ++ " " ++ showSep ", " ops
615showDeclImp t (PTy _ _ _ n ty) = show n ++ " : " ++ showImp t ty
616showDeclImp _ (PClauses _ _ n c) = showSep "\n" (map show c)
617showDeclImp _ (PData _ _ d) = show d
619showCImp :: Bool -> PClause -> String
620showCImp impl (PClause _ n l ws r w)
621 = showImp impl l ++ showWs ws ++ " = " ++ showImp impl r
622 ++ " where " ++ show w
623 where
624 showWs [] = ""
625 showWs (x : xs) = " | " ++ showImp impl x ++ showWs xs
626showCImp impl (PWith _ n l ws r w)
627 = showImp impl l ++ showWs ws ++ " with " ++ showImp impl r
628 ++ " { " ++ show w ++ " } "
629 where
630 showWs [] = ""
631 showWs (x : xs) = " | " ++ showImp impl x ++ showWs xs
634showDImp :: Bool -> PData -> String
635showDImp impl (PDatadecl n ty cons)
636 = "data " ++ show n ++ " : " ++ showImp impl ty ++ " where\n\t"
637 ++ showSep "\n\t| "
638 (map (\ (n, t, _) -> show n ++ " : " ++ showImp impl t) cons)
640getImps :: [PArg] -> [(Name, PTerm)]
641getImps [] = []
642getImps (PImp _ _ n tm : xs) = (n, tm) : getImps xs
643getImps (_ : xs) = getImps xs
645getExps :: [PArg] -> [PTerm]
646getExps [] = []
647getExps (PExp _ _ tm : xs) = tm : getExps xs
648getExps (_ : xs) = getExps xs
650getConsts :: [PArg] -> [PTerm]
651getConsts [] = []
652getConsts (PConstraint _ _ tm : xs) = tm : getConsts xs
653getConsts (_ : xs) = getConsts xs
655getAll :: [PArg] -> [PTerm]
656getAll = map getTm
658prettyImp :: Bool -> PTerm -> Doc
659prettyImp impl = prettySe 10
660 where
661 prettySe p (PQuote r) =
662 if size r > breakingSize then
663 text "![" $$ pretty r <> text "]"
664 else
665 text "![" <> pretty r <> text "]"
666 prettySe p (PPatvar fc n) = pretty n
667 prettySe p (PRef fc n) =
668 if impl then
669 pretty n
670 else
671 prettyBasic n
672 where
673 prettyBasic n@(UN _) = pretty n
674 prettyBasic (MN _ s) = text s
675 prettyBasic (NS n s) = (foldr (<>) empty (intersperse (text ".") (map text $ reverse s))) <> prettyBasic n
676 prettySe p (PLam n ty sc) =
677 bracket p 2 $
678 if size sc > breakingSize then
679 text "λ" <> pretty n <+> text "=>" $+$ pretty sc
680 else
681 text "λ" <> pretty n <+> text "=>" <+> pretty sc
682 prettySe p (PLet n ty v sc) =
683 bracket p 2 $
684 if size sc > breakingSize then
685 text "let" <+> pretty n <+> text "=" <+> prettySe 10 v <+> text "in" $+$
686 nest nestingSize (prettySe 10 sc)
687 else
688 text "let" <+> pretty n <+> text "=" <+> prettySe 10 v <+> text "in" <+>
689 prettySe 10 sc
690 prettySe p (PPi (Exp l s) n ty sc)
691 | n `elem` allNamesIn sc || impl =
692 let open = if l then text "|" <> lparen else lparen in
693 bracket p 2 $
694 if size sc > breakingSize then
695 open <> pretty n <+> colon <+> prettySe 10 ty <> rparen <+>
696 st <+> text "->" $+$ prettySe 10 sc
697 else
698 open <> pretty n <+> colon <+> prettySe 10 ty <> rparen <+>
699 st <+> text "->" <+> prettySe 10 sc
700 | otherwise =
701 bracket p 2 $
702 if size sc > breakingSize then
703 prettySe 0 ty <+> st <+> text "->" $+$ prettySe 10 sc
704 else
705 prettySe 0 ty <+> st <+> text "->" <+> prettySe 10 sc
706 where
707 st =
708 case s of
709 Static -> text "[static]"
710 _ -> empty
711 prettySe p (PPi (Imp l s) n ty sc)
712 | impl =
713 let open = if l then text "|" <> lbrace else lbrace in
714 bracket p 2 $
715 if size sc > breakingSize then
716 open <> pretty n <+> colon <+> prettySe 10 ty <> rbrace <+>
717 st <+> text "->" <+> prettySe 10 sc
718 else
719 open <> pretty n <+> colon <+> prettySe 10 ty <> rbrace <+>
720 st <+> text "->" <+> prettySe 10 sc
721 | otherwise = prettySe 10 sc
722 where
723 st =
724 case s of
725 Static -> text $ "[static]"
726 _ -> empty
727 prettySe p (PPi (Constraint _ _) n ty sc) =
728 bracket p 2 $
729 if size sc > breakingSize then
730 prettySe 10 ty <+> text "=>" <+> prettySe 10 sc
731 else
732 prettySe 10 ty <+> text "=>" $+$ prettySe 10 sc
733 prettySe p (PPi (TacImp _ _ s) n ty sc) =
734 bracket p 2 $
735 if size sc > breakingSize then
736 lbrace <> text "tacimp" <+> pretty n <+> colon <+> prettySe 10 ty <>
737 rbrace <+> text "->" $+$ prettySe 10 sc
738 else
739 lbrace <> text "tacimp" <+> pretty n <+> colon <+> prettySe 10 ty <>
740 rbrace <+> text "->" <+> prettySe 10 sc
741 prettySe p (PApp _ (PRef _ f) [])
742 | not impl = pretty f
743 prettySe p (PApp _ (PRef _ op@(UN (f:_))) args)
744 | length (getExps args) == 2 && (not impl) && (not $ isAlpha f) =
745 let [l, r] = getExps args in
746 bracket p 1 $
747 if size r > breakingSize then
748 prettySe 1 l <+> pretty op $+$ prettySe 0 r
749 else
750 prettySe 1 l <+> pretty op <+> prettySe 0 r
751 prettySe p (PApp _ f as) =
752 let args = getExps as in
753 bracket p 1 $
754 prettySe 1 f <+>
755 if impl then
756 foldl fS empty as
757 -- foldr (<+>) empty $ map prettyArgS as
758 else
759 foldl fSe empty args
760 -- foldr (<+>) empty $ map prettyArgSe args
761 where
762 fS l r =
763 if size r > breakingSize then
764 l $+$ nest nestingSize (prettyArgS r)
765 else
766 l <+> prettyArgS r
768 fSe l r =
769 if size r > breakingSize then
770 l $+$ nest nestingSize (prettyArgSe r)
771 else
772 l <+> prettyArgSe r
773 prettySe p (PCase _ scr opts) =
774 text "case" <+> prettySe 10 scr <+> text "of" $+$ nest nestingSize prettyBody
775 where
776 prettyBody = foldr ($$) empty $ intersperse (text "|") $ map sc opts
778 sc (l, r) = prettySe 10 l <+> text "=>" <+> prettySe 10 r
779 prettySe p (PHidden tm) = text "." <> prettySe 0 tm
780 prettySe p (PRefl _) = text "refl"
781 prettySe p (PResolveTC _) = text "resolvetc"
782 prettySe p (PTrue _) = text "()"
783 prettySe p (PFalse _) = text "_|_"
784 prettySe p (PEq _ l r) =
785 bracket p 2 $
786 if size r > breakingSize then
787 prettySe 10 l <+> text "=" $$ nest nestingSize (prettySe 10 r)
788 else
789 prettySe 10 l <+> text "=" <+> prettySe 10 r
790 prettySe p (PTyped l r) =
791 lparen <> prettySe 10 l <+> colon <+> prettySe 10 r <> rparen
792 prettySe p (PPair _ l r) =
793 if size r > breakingSize then
794 lparen <> prettySe 10 l <> text "," $+$
795 prettySe 10 r <> rparen
796 else
797 lparen <> prettySe 10 l <> text "," <+> prettySe 10 r <> rparen
798 prettySe p (PDPair _ l t r) =
799 if size r > breakingSize then
800 lparen <> prettySe 10 l <+> text "**" $+$
801 prettySe 10 r <> rparen
802 else
803 lparen <> prettySe 10 l <+> text "**" <+> prettySe 10 r <> rparen
804 prettySe p (PAlternative a as) =
805 lparen <> text "|" <> prettyAs <> text "|" <> rparen
806 where
807 prettyAs =
808 foldr (\l -> \r -> l <+> text "," <+> r) empty $ map (prettySe 10) as
809 prettySe p PSet = text "Set"
810 prettySe p (PConstant c) = pretty c
811 -- XXX: add pretty for tactics
812 prettySe p (PProof ts) =
813 text "proof" <+> lbrace $+$ nest nestingSize (text . show $ ts) $+$ rbrace
814 prettySe p (PTactics ts) =
815 text "tactics" <+> lbrace $+$ nest nestingSize (text . show $ ts) $+$ rbrace
816 prettySe p (PMetavar n) = text "?" <> pretty n
817 prettySe p (PReturn f) = text "return"
818 prettySe p PImpossible = text "impossible"
819 prettySe p Placeholder = text "_"
820 prettySe p (PDoBlock _) = text "do block pretty not implemented"
821 prettySe p (PElabError s) = pretty s
823 prettySe p _ = text "test"
825 prettyArgS (PImp _ _ n tm) = prettyArgSi (n, tm)
826 prettyArgS (PExp _ _ tm) = prettyArgSe tm
827 prettyArgS (PConstraint _ _ tm) = prettyArgSc tm
828 prettyArgS (PTacImplicit _ _ n _ tm) = prettyArgSti (n, tm)
830 prettyArgSe arg = prettySe 0 arg
831 prettyArgSi (n, val) = lbrace <> pretty n <+> text "=" <+> prettySe 10 val <> rbrace
832 prettyArgSc val = lbrace <> lbrace <> prettySe 10 val <> rbrace <> rbrace
833 prettyArgSti (n, val) = lbrace <> text "auto" <+> pretty n <+> text "=" <+> prettySe 10 val <> rbrace
835 bracket outer inner doc
836 | inner > outer = lparen <> doc <> rparen
837 | otherwise = doc
839showImp :: Bool -> PTerm -> String
840showImp impl tm = se 10 tm where
841 se p (PQuote r) = "![" ++ show r ++ "]"
842 se p (PPatvar fc n) = show n
843 se p (PRef fc n) = if impl then show n -- ++ "[" ++ show fc ++ "]"
844 else showbasic n
845 where showbasic n@(UN _) = show n
846 showbasic (MN _ s) = s
847 showbasic (NS n s) = showSep "." (reverse s) ++ "." ++ showbasic n
848 se p (PLam n ty sc) = bracket p 2 $ "\\ " ++ show n ++
849 (if impl then " : " ++ se 10 ty else "") ++ " => "
850 ++ se 10 sc
851 se p (PLet n ty v sc) = bracket p 2 $ "let " ++ show n ++ " = " ++ se 10 v ++
852 " in " ++ se 10 sc
853 se p (PPi (Exp l s) n ty sc)
854 | n `elem` allNamesIn sc || impl
855 = bracket p 2 $
856 if l then "|(" else "(" ++
857 show n ++ " : " ++ se 10 ty ++
858 ") " ++ st ++
859 "-> " ++ se 10 sc
860 | otherwise = bracket p 2 $ se 0 ty ++ " " ++ st ++ "-> " ++ se 10 sc
861 where st = case s of
862 Static -> "[static] "
863 _ -> ""
864 se p (PPi (Imp l s) n ty sc)
865 | impl = bracket p 2 $ if l then "|{" else "{" ++
866 show n ++ " : " ++ se 10 ty ++
867 "} " ++ st ++ "-> " ++ se 10 sc
868 | otherwise = se 10 sc
869 where st = case s of
870 Static -> "[static] "
871 _ -> ""
872 se p (PPi (Constraint _ _) n ty sc)
873 = bracket p 2 $ se 10 ty ++ " => " ++ se 10 sc
874 se p (PPi (TacImp _ _ s) n ty sc)
875 = bracket p 2 $ "{tacimp " ++ show n ++ " : " ++ se 10 ty ++ "} -> " ++ se 10 sc
876 se p (PApp _ (PRef _ f) [])
877 | not impl = show f
878 se p (PApp _ (PRef _ op@(UN (f:_))) args)
879 | length (getExps args) == 2 && not impl && not (isAlpha f)
880 = let [l, r] = getExps args in
881 bracket p 1 $ se 1 l ++ " " ++ show op ++ " " ++ se 0 r
882 se p (PApp _ f as)
883 = let args = getExps as in
884 bracket p 1 $ se 1 f ++ if impl then concatMap sArg as
885 else concatMap seArg args
886 se p (PCase _ scr opts) = "case " ++ se 10 scr ++ " of " ++ showSep " | " (map sc opts)
887 where sc (l, r) = se 10 l ++ " => " ++ se 10 r
888 se p (PHidden tm) = "." ++ se 0 tm
889 se p (PRefl _) = "refl"
890 se p (PResolveTC _) = "resolvetc"
891 se p (PTrue _) = "()"
892 se p (PFalse _) = "_|_"
893 se p (PEq _ l r) = bracket p 2 $ se 10 l ++ " = " ++ se 10 r
894 se p (PTyped l r) = "(" ++ se 10 l ++ " : " ++ se 10 r ++ ")"
895 se p (PPair _ l r) = "(" ++ se 10 l ++ ", " ++ se 10 r ++ ")"
896 se p (PDPair _ l t r) = "(" ++ se 10 l ++ " ** " ++ se 10 r ++ ")"
897 se p (PAlternative a as) = "(|" ++ showSep " , " (map (se 10) as) ++ "|)"
898 se p PSet = "Set"
899 se p (PConstant c) = show c
900 se p (PProof ts) = "proof { " ++ show ts ++ "}"
901 se p (PTactics ts) = "tactics { " ++ show ts ++ "}"
902 se p (PMetavar n) = "?" ++ show n
903 se p (PReturn f) = "return"
904 se p PImpossible = "impossible"
905 se p Placeholder = "_"
906 se p (PDoBlock _) = "do block show not implemented"
907 se p (PElabError s) = show s
908-- se p x = "Not implemented"
910 sArg (PImp _ _ n tm) = siArg (n, tm)
911 sArg (PExp _ _ tm) = seArg tm
912 sArg (PConstraint _ _ tm) = scArg tm
913 sArg (PTacImplicit _ _ n _ tm) = stiArg (n, tm)
915 seArg arg = " " ++ se 0 arg
916 siArg (n, val) = " {" ++ show n ++ " = " ++ se 10 val ++ "}"
917 scArg val = " {{" ++ se 10 val ++ "}}"
918 stiArg (n, val) = " {auto " ++ show n ++ " = " ++ se 10 val ++ "}"
920 bracket outer inner str | inner > outer = "(" ++ str ++ ")"
921 | otherwise = str
923{-
924 PQuote Raw
925 | PRef FC Name
926 | PLam Name PTerm PTerm
927 | PPi Plicity Name PTerm PTerm
928 | PLet Name PTerm PTerm PTerm
929 | PTyped PTerm PTerm -- term with explicit type
930 | PApp FC PTerm [PArg]
931 | PCase FC PTerm [(PTerm, PTerm)]
932 | PTrue FC
933 | PFalse FC
934 | PRefl FC
935 | PResolveTC FC
936 | PEq FC PTerm PTerm
937 | PPair FC PTerm PTerm
938 | PDPair FC PTerm PTerm PTerm
939 | PAlternative [PTerm]
940 | PHidden PTerm -- irrelevant or hidden pattern
941 | PSet
942 | PConstant Const
943 | Placeholder
944 | PDoBlock [PDo]
945 | PIdiom FC PTerm
946 | PReturn FC
947 | PMetavar Name
948 | PProof [PTactic]
949 | PTactics [PTactic] -- as PProof, but no auto solving
950 | PElabError Err -- error to report on elaboration
951 | PImpossible -- special case for declaring when an LHS can't typecheck
952-}
954instance Sized PTerm where
955 size (PQuote rawTerm) = size rawTerm
956 size (PRef fc name) = size name
957 size (PLam name ty bdy) = 1 + size ty + size bdy
958 size (PPi plicity name ty bdy) = 1 + size ty + size bdy
959 size (PLet name ty def bdy) = 1 + size ty + size def + size bdy
960 size (PTyped trm ty) = 1 + size trm + size ty
961 size (PApp fc name args) = 1 + size args
962 size (PCase fc trm bdy) = 1 + size trm + size bdy
963 size (PTrue fc) = 1
964 size (PFalse fc) = 1
965 size (PRefl fc) = 1
966 size (PResolveTC fc) = 1
967 size (PEq fc left right) = 1 + size left + size right
968 size (PPair fc left right) = 1 + size left + size right
969 size (PDPair fs left ty right) = 1 + size left + size ty + size right
970 size (PAlternative a alts) = 1 + size alts
971 size (PHidden hidden) = size hidden
972 size PSet = 1
973 size (PConstant const) = 1 + size const
974 size Placeholder = 1
975 size (PDoBlock dos) = 1 + size dos
976 size (PIdiom fc term) = 1 + size term
977 size (PReturn fc) = 1
978 size (PMetavar name) = 1
979 size (PProof tactics) = size tactics
980 size (PElabError err) = size err
981 size PImpossible = 1
983allNamesIn :: PTerm -> [Name]
984allNamesIn tm = nub $ ni [] tm
985 where
986 ni env (PRef _ n)
987 | not (n `elem` env) = [n]
988 ni env (PApp _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
989 ni env (PCase _ c os) = ni env c ++ concatMap (ni env) (map snd os)
990 ni env (PLam n ty sc) = ni env ty ++ ni (n:env) sc
991 ni env (PPi _ n ty sc) = ni env ty ++ ni (n:env) sc
992 ni env (PHidden tm) = ni env tm
993 ni env (PEq _ l r) = ni env l ++ ni env r
994 ni env (PTyped l r) = ni env l ++ ni env r
995 ni env (PPair _ l r) = ni env l ++ ni env r
996 ni env (PDPair _ (PRef _ n) t r) = ni env t ++ ni (n:env) r
997 ni env (PDPair _ l t r) = ni env l ++ ni env t ++ ni env r
998 ni env (PAlternative a ls) = concatMap (ni env) ls
999 ni env _ = []
1001namesIn :: [(Name, PTerm)] -> IState -> PTerm -> [Name]
1002namesIn uvars ist tm = nub $ ni [] tm
1003 where
1004 ni env (PRef _ n)
1005 | not (n `elem` env)
1006 = case lookupTy Nothing n (tt_ctxt ist) of
1007 [] -> [n]
1008 _ -> if n `elem` (map fst uvars) then [n] else []
1009 ni env (PApp _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
1010 ni env (PCase _ c os) = ni env c ++ concatMap (ni env) (map snd os)
1011 ni env (PLam n ty sc) = ni env ty ++ ni (n:env) sc
1012 ni env (PPi _ n ty sc) = ni env ty ++ ni (n:env) sc
1013 ni env (PEq _ l r) = ni env l ++ ni env r
1014 ni env (PTyped l r) = ni env l ++ ni env r
1015 ni env (PPair _ l r) = ni env l ++ ni env r
1016 ni env (PDPair _ (PRef _ n) t r) = ni env t ++ ni (n:env) r
1017 ni env (PDPair _ l t r) = ni env l ++ ni env t ++ ni env r
1018 ni env (PAlternative a as) = concatMap (ni env) as
1019 ni env (PHidden tm) = ni env tm
1020 ni env _ = []