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