git.iko.soy/Idris-dev
on 04d6f00 help sign in
Idris-dev/src/Idris/AbsSyntaxTree.hs
1092 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 (InputT IO)
141-- Commands in the REPL
143data Target = ViaC | ViaJava | Bytecode
144 deriving (Show, Eq)
146data Command = Quit
147 | Help
148 | Eval PTerm
149 | Check PTerm
150 | DocStr Name
151 | TotCheck Name
152 | Reload
153 | Load FilePath
154 | ModImport String
155 | Edit
156 | Compile Target String
157 | Execute
158 | ExecVal PTerm
159 | NewCompile String
160 | Metavars
161 | Prove Name
162 | AddProof (Maybe Name)
163 | RmProof Name
164 | ShowProof Name
165 | Proofs
166 | Universes
167 | TTShell
168 | LogLvl Int
169 | Spec PTerm
170 | HNF PTerm
171 | Defn Name
172 | Info Name
173 | Missing Name
174 | Pattelab PTerm
175 | DebugInfo Name
176 | Search PTerm
177 | SetOpt Opt
178 | UnsetOpt Opt
179 | NOP
181data Opt = Filename String
182 | Ver
183 | Usage
184 | ShowLibs
185 | ShowLibdir
186 | ShowIncs
187 | NoPrelude
188 | NoREPL
189 | OLogging Int
190 | Output String
191 | NewOutput String
192 | TypeCase
193 | TypeInType
194 | DefaultTotal
195 | DefaultPartial
196 | WarnPartial
197 | NoCoverage
198 | ErrContext
199 | ShowImpl
200 | Verbose
201 | IBCSubDir String
202 | ImportDir String
203 | PkgBuild String
204 | PkgInstall String
205 | PkgClean String
206 | WarnOnly
207 | Pkg String
208 | BCAsm String
209 | DumpDefun String
210 | DumpCases String
211 | FOVM String
212 | UseTarget Target
213 | OutputTy OutputType
214 deriving (Show, Eq)
216-- Parsed declarations
218data Fixity = Infixl { prec :: Int }
219 | Infixr { prec :: Int }
220 | InfixN { prec :: Int }
221 | PrefixN { prec :: Int }
222 deriving Eq
223{-!
224deriving instance Binary Fixity
225!-}
227instance Show Fixity where
228 show (Infixl i) = "infixl " ++ show i
229 show (Infixr i) = "infixr " ++ show i
230 show (InfixN i) = "infix " ++ show i
231 show (PrefixN i) = "prefix " ++ show i
233data FixDecl = Fix Fixity String
234 deriving Eq
236instance Show FixDecl where
237 show (Fix f s) = show f ++ " " ++ s
239{-!
240deriving instance Binary FixDecl
241!-}
243instance Ord FixDecl where
244 compare (Fix x _) (Fix y _) = compare (prec x) (prec y)
247data Static = Static | Dynamic
248 deriving (Show, Eq)
249{-!
250deriving instance Binary Static
251!-}
253-- Mark bindings with their explicitness, and laziness
254data Plicity = Imp { plazy :: Bool,
255 pstatic :: Static,
256 pdocstr :: String }
257 | Exp { plazy :: Bool,
258 pstatic :: Static,
259 pdocstr :: String }
260 | Constraint { plazy :: Bool,
261 pstatic :: Static,
262 pdocstr :: String }
263 | TacImp { plazy :: Bool,
264 pstatic :: Static,
265 pscript :: PTerm,
266 pdocstr :: String }
267 deriving (Show, Eq)
269{-!
270deriving instance Binary Plicity
271!-}
273impl = Imp False Dynamic ""
274expl = Exp False Dynamic ""
275constraint = Constraint False Dynamic ""
276tacimpl t = TacImp False Dynamic t ""
278data FnOpt = Inlinable | TotalFn | PartialFn
279 | Coinductive | AssertTotal | TCGen
280 | CExport String -- export, with a C name
281 | Specialise [Name] -- specialise it, freeze these names
282 deriving (Show, Eq)
283{-!
284deriving instance Binary FnOpt
285!-}
287type FnOpts = [FnOpt]
289inlinable :: FnOpts -> Bool
290inlinable = elem Inlinable
292data PDecl' t
293 = PFix FC Fixity [String] -- fixity declaration
294 | PTy String SyntaxInfo FC FnOpts Name t -- type declaration
295 | PPostulate String SyntaxInfo FC FnOpts Name t
296 | PClauses FC FnOpts Name [PClause' t] -- pattern clause
297 | PCAF FC Name t -- top level constant
298 | PData String SyntaxInfo FC Bool -- codata
299 (PData' t) -- data declaration
300 | PParams FC [(Name, t)] [PDecl' t] -- params block
301 | PNamespace String [PDecl' t] -- new namespace
302 | PRecord String SyntaxInfo FC Name t String Name t -- record declaration
303 | PClass String SyntaxInfo FC
304 [t] -- constraints
305 Name
306 [(Name, t)] -- parameters
307 [PDecl' t] -- declarations
308 | PInstance SyntaxInfo FC [t] -- constraints
309 Name -- class
310 [t] -- parameters
311 t -- full instance type
312 (Maybe Name) -- explicit name
313 [PDecl' t]
314 | PDSL Name (DSL' t)
315 | PSyntax FC Syntax
316 | PMutual FC [PDecl' t]
317 | PDirective (Idris ())
318 deriving Functor
319{-!
320deriving instance Binary PDecl'
321!-}
323data PClause' t = PClause FC Name t [t] t [PDecl' t]
324 | PWith FC Name t [t] t [PDecl' t]
325 | PClauseR FC [t] t [PDecl' t]
326 | PWithR FC [t] t [PDecl' t]
327 deriving Functor
328{-!
329deriving instance Binary PClause'
330!-}
332data PData' t = PDatadecl { d_name :: Name,
333 d_tcon :: t,
334 d_cons :: [(String, Name, t, FC)] }
335 | PLaterdecl { d_name :: Name, d_tcon :: t }
336 deriving Functor
337{-!
338deriving instance Binary PData'
339!-}
341-- Handy to get a free function for applying PTerm -> PTerm functions
342-- across a program, by deriving Functor
344type PDecl = PDecl' PTerm
345type PData = PData' PTerm
346type PClause = PClause' PTerm
348-- get all the names declared in a decl
350declared :: PDecl -> [Name]
351declared (PFix _ _ _) = []
352declared (PTy _ _ _ _ n t) = [n]
353declared (PPostulate _ _ _ _ n t) = [n]
354declared (PClauses _ _ n _) = [] -- not a declaration
355declared (PRecord _ _ _ n _ _ c _) = [n, c]
356declared (PData _ _ _ _ (PDatadecl n _ ts)) = n : map fstt ts
357 where fstt (_, a, _, _) = a
358declared (PParams _ _ ds) = concatMap declared ds
359declared (PMutual _ ds) = concatMap declared ds
360declared (PNamespace _ ds) = concatMap declared ds
362-- get the names declared, not counting nested parameter blocks
363tldeclared :: PDecl -> [Name]
364tldeclared (PFix _ _ _) = []
365tldeclared (PTy _ _ _ _ n t) = [n]
366tldeclared (PPostulate _ _ _ _ n t) = [n]
367tldeclared (PClauses _ _ n _) = [] -- not a declaration
368tldeclared (PRecord _ _ _ n _ _ c _) = [n, c]
369tldeclared (PData _ _ _ _ (PDatadecl n _ ts)) = n : map fstt ts
370 where fstt (_, a, _, _) = a
371tldeclared (PParams _ _ ds) = []
372tldeclared (PMutual _ ds) = concatMap tldeclared ds
373tldeclared (PNamespace _ ds) = concatMap tldeclared ds
374-- declared (PImport _) = []
376defined :: PDecl -> [Name]
377defined (PFix _ _ _) = []
378defined (PTy _ _ _ _ n t) = []
379defined (PPostulate _ _ _ _ n t) = []
380defined (PClauses _ _ n _) = [n] -- not a declaration
381defined (PRecord _ _ _ n _ _ c _) = [n, c]
382defined (PData _ _ _ _ (PDatadecl n _ ts)) = n : map fstt ts
383 where fstt (_, a, _, _) = a
384defined (PParams _ _ ds) = concatMap defined ds
385defined (PMutual _ ds) = concatMap defined ds
386defined (PNamespace _ ds) = concatMap defined ds
387-- declared (PImport _) = []
389updateN :: [(Name, Name)] -> Name -> Name
390updateN ns n | Just n' <- lookup n ns = n'
391updateN _ n = n
393updateNs :: [(Name, Name)] -> PTerm -> PTerm
394updateNs [] t = t
395updateNs ns t = mapPT updateRef t
396 where updateRef (PRef fc f) = PRef fc (updateN ns f)
397 updateRef t = t
399-- updateDNs :: [(Name, Name)] -> PDecl -> PDecl
400-- updateDNs [] t = t
401-- updateDNs ns (PTy s f n t) | Just n' <- lookup n ns = PTy s f n' t
402-- updateDNs ns (PClauses f n c) | Just n' <- lookup n ns = PClauses f n' (map updateCNs c)
403-- where updateCNs ns (PClause n l ts r ds)
404-- = PClause (updateN ns n) (fmap (updateNs ns) l)
405-- (map (fmap (updateNs ns)) ts)
406-- (fmap (updateNs ns) r)
407-- (map (updateDNs ns) ds)
408-- updateDNs ns c = c
410-- High level language terms
412data PTerm = PQuote Raw
413 | PRef FC Name
414 | PInferRef FC Name -- a name to be defined later
415 | PPatvar FC Name
416 | PLam Name PTerm PTerm
417 | PPi Plicity Name PTerm PTerm
418 | PLet Name PTerm PTerm PTerm
419 | PTyped PTerm PTerm -- term with explicit type
420 | PApp FC PTerm [PArg]
421 | PCase FC PTerm [(PTerm, PTerm)]
422 | PTrue FC
423 | PFalse FC
424 | PRefl FC PTerm
425 | PResolveTC FC
426 | PEq FC PTerm PTerm
427 | PPair FC PTerm PTerm
428 | PDPair FC PTerm PTerm PTerm
429 | PAlternative Bool [PTerm] -- True if only one may work
430 | PHidden PTerm -- irrelevant or hidden pattern
431 | PType
432 | PConstant Const
433 | Placeholder
434 | PDoBlock [PDo]
435 | PIdiom FC PTerm
436 | PReturn FC
437 | PMetavar Name
438 | PProof [PTactic]
439 | PTactics [PTactic] -- as PProof, but no auto solving
440 | PElabError Err -- error to report on elaboration
441 | PImpossible -- special case for declaring when an LHS can't typecheck
442 deriving Eq
443{-!
444deriving instance Binary PTerm
445!-}
447mapPT :: (PTerm -> PTerm) -> PTerm -> PTerm
448mapPT f t = f (mpt t) where
449 mpt (PLam n t s) = PLam n (mapPT f t) (mapPT f s)
450 mpt (PPi p n t s) = PPi p n (mapPT f t) (mapPT f s)
451 mpt (PLet n ty v s) = PLet n (mapPT f ty) (mapPT f v) (mapPT f s)
452 mpt (PApp fc t as) = PApp fc (mapPT f t) (map (fmap (mapPT f)) as)
453 mpt (PCase fc c os) = PCase fc (mapPT f c) (map (pmap (mapPT f)) os)
454 mpt (PEq fc l r) = PEq fc (mapPT f l) (mapPT f r)
455 mpt (PTyped l r) = PTyped (mapPT f l) (mapPT f r)
456 mpt (PPair fc l r) = PPair fc (mapPT f l) (mapPT f r)
457 mpt (PDPair fc l t r) = PDPair fc (mapPT f l) (mapPT f t) (mapPT f r)
458 mpt (PAlternative a as) = PAlternative a (map (mapPT f) as)
459 mpt (PHidden t) = PHidden (mapPT f t)
460 mpt (PDoBlock ds) = PDoBlock (map (fmap (mapPT f)) ds)
461 mpt (PProof ts) = PProof (map (fmap (mapPT f)) ts)
462 mpt (PTactics ts) = PTactics (map (fmap (mapPT f)) ts)
463 mpt x = x
466data PTactic' t = Intro [Name] | Intros | Focus Name
467 | Refine Name [Bool] | Rewrite t
468 | LetTac Name t | LetTacTy Name t t
469 | Exact t | Compute | Trivial
470 | Solve
471 | Attack
472 | ProofState | ProofTerm | Undo
473 | Try (PTactic' t) (PTactic' t)
474 | TSeq (PTactic' t) (PTactic' t)
475 | ReflectTac t -- see Language.Reflection module
476 | Qed | Abandon
477 deriving (Show, Eq, Functor)
478{-!
479deriving instance Binary PTactic'
480!-}
482instance Sized a => Sized (PTactic' a) where
483 size (Intro nms) = 1 + size nms
484 size Intros = 1
485 size (Focus nm) = 1 + size nm
486 size (Refine nm bs) = 1 + size nm + length bs
487 size (Rewrite t) = 1 + size t
488 size (LetTac nm t) = 1 + size nm + size t
489 size (Exact t) = 1 + size t
490 size Compute = 1
491 size Trivial = 1
492 size Solve = 1
493 size Attack = 1
494 size ProofState = 1
495 size ProofTerm = 1
496 size Undo = 1
497 size (Try l r) = 1 + size l + size r
498 size (TSeq l r) = 1 + size l + size r
499 size Qed = 1
500 size Abandon = 1
502type PTactic = PTactic' PTerm
504data PDo' t = DoExp FC t
505 | DoBind FC Name t
506 | DoBindP FC t t
507 | DoLet FC Name t t
508 | DoLetP FC t t
509 deriving (Eq, Functor)
510{-!
511deriving instance Binary PDo'
512!-}
514instance Sized a => Sized (PDo' a) where
515 size (DoExp fc t) = 1 + size fc + size t
516 size (DoBind fc nm t) = 1 + size fc + size nm + size t
517 size (DoBindP fc l r) = 1 + size fc + size l + size r
518 size (DoLet fc nm l r) = 1 + size fc + size nm + size l + size r
519 size (DoLetP fc l r) = 1 + size fc + size l + size r
521type PDo = PDo' PTerm
523-- The priority gives a hint as to elaboration order. Best to elaborate
524-- things early which will help give a more concrete type to other
525-- variables, e.g. a before (interpTy a).
527data PArg' t = PImp { priority :: Int,
528 lazyarg :: Bool, pname :: Name, getTm :: t,
529 pargdoc :: String }
530 | PExp { priority :: Int,
531 lazyarg :: Bool, getTm :: t,
532 pargdoc :: String }
533 | PConstraint { priority :: Int,
534 lazyarg :: Bool, getTm :: t,
535 pargdoc :: String }
536 | PTacImplicit { priority :: Int,
537 lazyarg :: Bool, pname :: Name,
538 getScript :: t,
539 getTm :: t,
540 pargdoc :: String }
541 deriving (Show, Eq, Functor)
543instance Sized a => Sized (PArg' a) where
544 size (PImp p l nm trm _) = 1 + size nm + size trm
545 size (PExp p l trm _) = 1 + size trm
546 size (PConstraint p l trm _) = 1 + size trm
547 size (PTacImplicit p l nm scr trm _) = 1 + size nm + size scr + size trm
549{-!
550deriving instance Binary PArg'
551!-}
553pimp n t = PImp 0 True n t ""
554pexp t = PExp 0 False t ""
555pconst t = PConstraint 0 False t ""
556ptacimp n s t = PTacImplicit 0 True n s t ""
558type PArg = PArg' PTerm
560-- Type class data
562data ClassInfo = CI { instanceName :: Name,
563 class_methods :: [(Name, (FnOpts, PTerm))],
564 class_defaults :: [(Name, (Name, PDecl))], -- method name -> default impl
565 class_params :: [Name],
566 class_instances :: [Name] }
567 deriving Show
568{-!
569deriving instance Binary ClassInfo
570!-}
572data OptInfo = Optimise { collapsible :: Bool,
573 forceable :: [Int], -- argument positions
574 recursive :: [Int] }
575 deriving Show
576{-!
577deriving instance Binary OptInfo
578!-}
581data TypeInfo = TI { con_names :: [Name], codata :: Bool }
582 deriving Show
583{-!
584deriving instance Binary TypeInfo
585!-}
587-- Syntactic sugar info
589data DSL' t = DSL { dsl_bind :: t,
590 dsl_return :: t,
591 dsl_apply :: t,
592 dsl_pure :: t,
593 dsl_var :: Maybe t,
594 index_first :: Maybe t,
595 index_next :: Maybe t,
596 dsl_lambda :: Maybe t,
597 dsl_let :: Maybe t
598 }
599 deriving (Show, Functor)
600{-!
601deriving instance Binary DSL'
602!-}
604type DSL = DSL' PTerm
606data SynContext = PatternSyntax | TermSyntax | AnySyntax
607 deriving Show
608{-!
609deriving instance Binary SynContext
610!-}
612data Syntax = Rule [SSymbol] PTerm SynContext
613 deriving Show
614{-!
615deriving instance Binary Syntax
616!-}
618data SSymbol = Keyword Name
619 | Symbol String
620 | Binding Name
621 | Expr Name
622 | SimpleExpr Name
623 deriving Show
624{-!
625deriving instance Binary SSymbol
626!-}
628initDSL = DSL (PRef f (UN ">>="))
629 (PRef f (UN "return"))
630 (PRef f (UN "<$>"))
631 (PRef f (UN "pure"))
632 Nothing
633 Nothing
634 Nothing
635 Nothing
636 Nothing
637 where f = FC "(builtin)" 0
639data SyntaxInfo = Syn { using :: [(Name, PTerm)],
640 syn_params :: [(Name, PTerm)],
641 syn_namespace :: [String],
642 no_imp :: [Name],
643 decoration :: Name -> Name,
644 inPattern :: Bool,
645 implicitAllowed :: Bool,
646 dsl_info :: DSL }
647 deriving Show
648{-!
649deriving instance Binary SyntaxInfo
650!-}
652defaultSyntax = Syn [] [] [] [] id False False initDSL
654expandNS :: SyntaxInfo -> Name -> Name
655expandNS syn n@(NS _ _) = n
656expandNS syn n = case syn_namespace syn of
657 [] -> n
658 xs -> NS n xs
661--- Pretty printing declarations and terms
663instance Show PTerm where
664 show tm = showImp False tm
666instance Pretty PTerm where
667 pretty = prettyImp False
669instance Show PDecl where
670 show d = showDeclImp False d
672instance Show PClause where
673 show c = showCImp True c
675instance Show PData where
676 show d = showDImp False d
678showDeclImp _ (PFix _ f ops) = show f ++ " " ++ showSep ", " ops
679showDeclImp t (PTy _ _ _ _ n ty) = show n ++ " : " ++ showImp t ty
680showDeclImp t (PPostulate _ _ _ _ n ty) = show n ++ " : " ++ showImp t ty
681showDeclImp _ (PClauses _ _ n c) = showSep "\n" (map show c)
682showDeclImp _ (PData _ _ _ _ d) = show d
683showDeclImp _ (PParams f ns ps) = "parameters " ++ show ns ++ "\n" ++
684 showSep "\n" (map show ps)
687showCImp :: Bool -> PClause -> String
688showCImp impl (PClause _ n l ws r w)
689 = showImp impl l ++ showWs ws ++ " = " ++ showImp impl r
690 ++ " where " ++ show w
691 where
692 showWs [] = ""
693 showWs (x : xs) = " | " ++ showImp impl x ++ showWs xs
694showCImp impl (PWith _ n l ws r w)
695 = showImp impl l ++ showWs ws ++ " with " ++ showImp impl r
696 ++ " { " ++ show w ++ " } "
697 where
698 showWs [] = ""
699 showWs (x : xs) = " | " ++ showImp impl x ++ showWs xs
702showDImp :: Bool -> PData -> String
703showDImp impl (PDatadecl n ty cons)
704 = "data " ++ show n ++ " : " ++ showImp impl ty ++ " where\n\t"
705 ++ showSep "\n\t| "
706 (map (\ (_, n, t, _) -> show n ++ " : " ++ showImp impl t) cons)
708getImps :: [PArg] -> [(Name, PTerm)]
709getImps [] = []
710getImps (PImp _ _ n tm _ : xs) = (n, tm) : getImps xs
711getImps (_ : xs) = getImps xs
713getExps :: [PArg] -> [PTerm]
714getExps [] = []
715getExps (PExp _ _ tm _ : xs) = tm : getExps xs
716getExps (_ : xs) = getExps xs
718getConsts :: [PArg] -> [PTerm]
719getConsts [] = []
720getConsts (PConstraint _ _ tm _ : xs) = tm : getConsts xs
721getConsts (_ : xs) = getConsts xs
723getAll :: [PArg] -> [PTerm]
724getAll = map getTm
726prettyImp :: Bool -> PTerm -> Doc
727prettyImp impl = prettySe 10
728 where
729 prettySe p (PQuote r) =
730 if size r > breakingSize then
731 text "![" $$ pretty r <> text "]"
732 else
733 text "![" <> pretty r <> text "]"
734 prettySe p (PPatvar fc n) = pretty n
735 prettySe p (PRef fc n) =
736 if impl then
737 pretty n
738 else
739 prettyBasic n
740 where
741 prettyBasic n@(UN _) = pretty n
742 prettyBasic (MN _ s) = text s
743 prettyBasic (NS n s) = (foldr (<>) empty (intersperse (text ".") (map text $ reverse s))) <> prettyBasic n
744 prettySe p (PLam n ty sc) =
745 bracket p 2 $
746 if size sc > breakingSize then
747 text "λ" <> pretty n <+> text "=>" $+$ pretty sc
748 else
749 text "λ" <> pretty n <+> text "=>" <+> pretty sc
750 prettySe p (PLet n ty v sc) =
751 bracket p 2 $
752 if size sc > breakingSize then
753 text "let" <+> pretty n <+> text "=" <+> prettySe 10 v <+> text "in" $+$
754 nest nestingSize (prettySe 10 sc)
755 else
756 text "let" <+> pretty n <+> text "=" <+> prettySe 10 v <+> text "in" <+>
757 prettySe 10 sc
758 prettySe p (PPi (Exp l s _) n ty sc)
759 | n `elem` allNamesIn sc || impl =
760 let open = if l then text "|" <> lparen else lparen in
761 bracket p 2 $
762 if size sc > breakingSize then
763 open <> pretty n <+> colon <+> prettySe 10 ty <> rparen <+>
764 st <+> text "->" $+$ prettySe 10 sc
765 else
766 open <> pretty n <+> colon <+> prettySe 10 ty <> rparen <+>
767 st <+> text "->" <+> prettySe 10 sc
768 | otherwise =
769 bracket p 2 $
770 if size sc > breakingSize then
771 prettySe 0 ty <+> st <+> text "->" $+$ prettySe 10 sc
772 else
773 prettySe 0 ty <+> st <+> text "->" <+> prettySe 10 sc
774 where
775 st =
776 case s of
777 Static -> text "[static]"
778 _ -> empty
779 prettySe p (PPi (Imp l s _) n ty sc)
780 | impl =
781 let open = if l then text "|" <> lbrace else lbrace in
782 bracket p 2 $
783 if size sc > breakingSize then
784 open <> pretty n <+> colon <+> prettySe 10 ty <> rbrace <+>
785 st <+> text "->" <+> prettySe 10 sc
786 else
787 open <> pretty n <+> colon <+> prettySe 10 ty <> rbrace <+>
788 st <+> text "->" <+> prettySe 10 sc
789 | otherwise = prettySe 10 sc
790 where
791 st =
792 case s of
793 Static -> text $ "[static]"
794 _ -> empty
795 prettySe p (PPi (Constraint _ _ _) n ty sc) =
796 bracket p 2 $
797 if size sc > breakingSize then
798 prettySe 10 ty <+> text "=>" <+> prettySe 10 sc
799 else
800 prettySe 10 ty <+> text "=>" $+$ prettySe 10 sc
801 prettySe p (PPi (TacImp _ _ s _) n ty sc) =
802 bracket p 2 $
803 if size sc > breakingSize then
804 lbrace <> text "tacimp" <+> pretty n <+> colon <+> prettySe 10 ty <>
805 rbrace <+> text "->" $+$ prettySe 10 sc
806 else
807 lbrace <> text "tacimp" <+> pretty n <+> colon <+> prettySe 10 ty <>
808 rbrace <+> text "->" <+> prettySe 10 sc
809 prettySe p (PApp _ (PRef _ f) [])
810 | not impl = pretty f
811 prettySe p (PApp _ (PRef _ op@(UN (f:_))) args)
812 | length (getExps args) == 2 && (not impl) && (not $ isAlpha f) =
813 let [l, r] = getExps args in
814 bracket p 1 $
815 if size r > breakingSize then
816 prettySe 1 l <+> pretty op $+$ prettySe 0 r
817 else
818 prettySe 1 l <+> pretty op <+> prettySe 0 r
819 prettySe p (PApp _ f as) =
820 let args = getExps as in
821 bracket p 1 $
822 prettySe 1 f <+>
823 if impl then
824 foldl fS empty as
825 -- foldr (<+>) empty $ map prettyArgS as
826 else
827 foldl fSe empty args
828 -- foldr (<+>) empty $ map prettyArgSe args
829 where
830 fS l r =
831 if size r > breakingSize then
832 l $+$ nest nestingSize (prettyArgS r)
833 else
834 l <+> prettyArgS r
836 fSe l r =
837 if size r > breakingSize then
838 l $+$ nest nestingSize (prettyArgSe r)
839 else
840 l <+> prettyArgSe r
841 prettySe p (PCase _ scr opts) =
842 text "case" <+> prettySe 10 scr <+> text "of" $+$ nest nestingSize prettyBody
843 where
844 prettyBody = foldr ($$) empty $ intersperse (text "|") $ map sc opts
846 sc (l, r) = prettySe 10 l <+> text "=>" <+> prettySe 10 r
847 prettySe p (PHidden tm) = text "." <> prettySe 0 tm
848 prettySe p (PRefl _ _) = text "refl"
849 prettySe p (PResolveTC _) = text "resolvetc"
850 prettySe p (PTrue _) = text "()"
851 prettySe p (PFalse _) = text "_|_"
852 prettySe p (PEq _ l r) =
853 bracket p 2 $
854 if size r > breakingSize then
855 prettySe 10 l <+> text "=" $$ nest nestingSize (prettySe 10 r)
856 else
857 prettySe 10 l <+> text "=" <+> prettySe 10 r
858 prettySe p (PTyped l r) =
859 lparen <> prettySe 10 l <+> colon <+> prettySe 10 r <> rparen
860 prettySe p (PPair _ l r) =
861 if size r > breakingSize then
862 lparen <> prettySe 10 l <> text "," $+$
863 prettySe 10 r <> rparen
864 else
865 lparen <> prettySe 10 l <> text "," <+> prettySe 10 r <> rparen
866 prettySe p (PDPair _ l t r) =
867 if size r > breakingSize then
868 lparen <> prettySe 10 l <+> text "**" $+$
869 prettySe 10 r <> rparen
870 else
871 lparen <> prettySe 10 l <+> text "**" <+> prettySe 10 r <> rparen
872 prettySe p (PAlternative a as) =
873 lparen <> text "|" <> prettyAs <> text "|" <> rparen
874 where
875 prettyAs =
876 foldr (\l -> \r -> l <+> text "," <+> r) empty $ map (prettySe 10) as
877 prettySe p PType = text "Type"
878 prettySe p (PConstant c) = pretty c
879 -- XXX: add pretty for tactics
880 prettySe p (PProof ts) =
881 text "proof" <+> lbrace $+$ nest nestingSize (text . show $ ts) $+$ rbrace
882 prettySe p (PTactics ts) =
883 text "tactics" <+> lbrace $+$ nest nestingSize (text . show $ ts) $+$ rbrace
884 prettySe p (PMetavar n) = text "?" <> pretty n
885 prettySe p (PReturn f) = text "return"
886 prettySe p PImpossible = text "impossible"
887 prettySe p Placeholder = text "_"
888 prettySe p (PDoBlock _) = text "do block pretty not implemented"
889 prettySe p (PElabError s) = pretty s
891 prettySe p _ = text "test"
893 prettyArgS (PImp _ _ n tm _) = prettyArgSi (n, tm)
894 prettyArgS (PExp _ _ tm _) = prettyArgSe tm
895 prettyArgS (PConstraint _ _ tm _) = prettyArgSc tm
896 prettyArgS (PTacImplicit _ _ n _ tm _) = prettyArgSti (n, tm)
898 prettyArgSe arg = prettySe 0 arg
899 prettyArgSi (n, val) = lbrace <> pretty n <+> text "=" <+> prettySe 10 val <> rbrace
900 prettyArgSc val = lbrace <> lbrace <> prettySe 10 val <> rbrace <> rbrace
901 prettyArgSti (n, val) = lbrace <> text "auto" <+> pretty n <+> text "=" <+> prettySe 10 val <> rbrace
903 bracket outer inner doc
904 | inner > outer = lparen <> doc <> rparen
905 | otherwise = doc
907showImp :: Bool -> PTerm -> String
908showImp impl tm = se 10 tm where
909 se p (PQuote r) = "![" ++ show r ++ "]"
910 se p (PPatvar fc n) = show n
911 se p (PInferRef fc n) = "!" ++ show n -- ++ "[" ++ show fc ++ "]"
912 se p (PRef fc n) = if impl then show n -- ++ "[" ++ show fc ++ "]"
913 else showbasic n
914 where showbasic n@(UN _) = show n
915 showbasic (MN _ s) = s
916 showbasic (NS n s) = showSep "." (reverse s) ++ "." ++ showbasic n
917 se p (PLam n ty sc) = bracket p 2 $ "\\ " ++ show n ++
918 (if impl then " : " ++ se 10 ty else "") ++ " => "
919 ++ se 10 sc
920 se p (PLet n ty v sc) = bracket p 2 $ "let " ++ show n ++ " = " ++ se 10 v ++
921 " in " ++ se 10 sc
922 se p (PPi (Exp l s _) n ty sc)
923 | n `elem` allNamesIn sc || impl
924 = bracket p 2 $
925 (if l then "|(" else "(") ++
926 show n ++ " : " ++ se 10 ty ++
927 ") " ++ st ++
928 "-> " ++ se 10 sc
929 | otherwise = bracket p 2 $ se 0 ty ++ " " ++ st ++ "-> " ++ se 10 sc
930 where st = case s of
931 Static -> "[static] "
932 _ -> ""
933 se p (PPi (Imp l s _) n ty sc)
934 | impl = bracket p 2 $ (if l then "|{" else "{") ++
935 show n ++ " : " ++ se 10 ty ++
936 "} " ++ st ++ "-> " ++ se 10 sc
937 | otherwise = se 10 sc
938 where st = case s of
939 Static -> "[static] "
940 _ -> ""
941 se p (PPi (Constraint _ _ _) n ty sc)
942 = bracket p 2 $ se 10 ty ++ " => " ++ se 10 sc
943 se p (PPi (TacImp _ _ s _) n ty sc)
944 = bracket p 2 $ "{tacimp " ++ show n ++ " : " ++ se 10 ty ++ "} -> " ++ se 10 sc
945 se p (PApp _ (PRef _ f) [])
946 | not impl = show f
947 se p (PApp _ (PRef _ op@(UN (f:_))) args)
948 | length (getExps args) == 2 && not impl && not (isAlpha f)
949 = let [l, r] = getExps args in
950 bracket p 1 $ se 1 l ++ " " ++ show op ++ " " ++ se 0 r
951 se p (PApp _ f as)
952 = let args = getExps as in
953 bracket p 1 $ se 1 f ++ if impl then concatMap sArg as
954 else concatMap seArg args
955 se p (PCase _ scr opts) = "case " ++ se 10 scr ++ " of " ++ showSep " | " (map sc opts)
956 where sc (l, r) = se 10 l ++ " => " ++ se 10 r
957 se p (PHidden tm) = "." ++ se 0 tm
958 se p (PRefl _ t)
959 | not impl = "refl"
960 | otherwise = "refl {" ++ se 10 t ++ "}"
961 se p (PResolveTC _) = "resolvetc"
962 se p (PTrue _) = "()"
963 se p (PFalse _) = "_|_"
964 se p (PEq _ l r) = bracket p 2 $ se 10 l ++ " = " ++ se 10 r
965 se p (PTyped l r) = "(" ++ se 10 l ++ " : " ++ se 10 r ++ ")"
966 se p (PPair _ l r) = "(" ++ se 10 l ++ ", " ++ se 10 r ++ ")"
967 se p (PDPair _ l t r) = "(" ++ se 10 l ++ " ** " ++ se 10 r ++ ")"
968 se p (PAlternative a as) = "(|" ++ showSep " , " (map (se 10) as) ++ "|)"
969 se p PType = "Type"
970 se p (PConstant c) = show c
971 se p (PProof ts) = "proof { " ++ show ts ++ "}"
972 se p (PTactics ts) = "tactics { " ++ show ts ++ "}"
973 se p (PMetavar n) = "?" ++ show n
974 se p (PReturn f) = "return"
975 se p PImpossible = "impossible"
976 se p Placeholder = "_"
977 se p (PDoBlock _) = "do block show not implemented"
978 se p (PElabError s) = show s
979-- se p x = "Not implemented"
981 sArg (PImp _ _ n tm _) = siArg (n, tm)
982 sArg (PExp _ _ tm _) = seArg tm
983 sArg (PConstraint _ _ tm _) = scArg tm
984 sArg (PTacImplicit _ _ n _ tm _) = stiArg (n, tm)
986 seArg arg = " " ++ se 0 arg
987 siArg (n, val) = " {" ++ show n ++ " = " ++ se 10 val ++ "}"
988 scArg val = " {{" ++ se 10 val ++ "}}"
989 stiArg (n, val) = " {auto " ++ show n ++ " = " ++ se 10 val ++ "}"
991 bracket outer inner str | inner > outer = "(" ++ str ++ ")"
992 | otherwise = str
995instance Sized PTerm where
996 size (PQuote rawTerm) = size rawTerm
997 size (PRef fc name) = size name
998 size (PLam name ty bdy) = 1 + size ty + size bdy
999 size (PPi plicity name ty bdy) = 1 + size ty + size bdy
1000 size (PLet name ty def bdy) = 1 + size ty + size def + size bdy
1001 size (PTyped trm ty) = 1 + size trm + size ty
1002 size (PApp fc name args) = 1 + size args
1003 size (PCase fc trm bdy) = 1 + size trm + size bdy
1004 size (PTrue fc) = 1
1005 size (PFalse fc) = 1
1006 size (PRefl fc _) = 1
1007 size (PResolveTC fc) = 1
1008 size (PEq fc left right) = 1 + size left + size right
1009 size (PPair fc left right) = 1 + size left + size right
1010 size (PDPair fs left ty right) = 1 + size left + size ty + size right
1011 size (PAlternative a alts) = 1 + size alts
1012 size (PHidden hidden) = size hidden
1013 size PType = 1
1014 size (PConstant const) = 1 + size const
1015 size Placeholder = 1
1016 size (PDoBlock dos) = 1 + size dos
1017 size (PIdiom fc term) = 1 + size term
1018 size (PReturn fc) = 1
1019 size (PMetavar name) = 1
1020 size (PProof tactics) = size tactics
1021 size (PElabError err) = size err
1022 size PImpossible = 1
1024getPArity :: PTerm -> Int
1025getPArity (PPi _ _ _ sc) = 1 + getPArity sc
1026getPArity _ = 0
1028-- Return all names, free or globally bound, in the given term.
1030allNamesIn :: PTerm -> [Name]
1031allNamesIn tm = nub $ ni [] tm
1032 where
1033 ni env (PRef _ n)
1034 | not (n `elem` env) = [n]
1035 ni env (PApp _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
1036 ni env (PCase _ c os) = ni env c ++ concatMap (ni env) (map snd os)
1037 ni env (PLam n ty sc) = ni env ty ++ ni (n:env) sc
1038 ni env (PPi _ n ty sc) = ni env ty ++ ni (n:env) sc
1039 ni env (PHidden tm) = ni env tm
1040 ni env (PEq _ l r) = ni env l ++ ni env r
1041 ni env (PTyped l r) = ni env l ++ ni env r
1042 ni env (PPair _ l r) = ni env l ++ ni env r
1043 ni env (PDPair _ (PRef _ n) t r) = ni env t ++ ni (n:env) r
1044 ni env (PDPair _ l t r) = ni env l ++ ni env t ++ ni env r
1045 ni env (PAlternative a ls) = concatMap (ni env) ls
1046 ni env _ = []
1048-- Return names which are free in the given term.
1050namesIn :: [(Name, PTerm)] -> IState -> PTerm -> [Name]
1051namesIn uvars ist tm = nub $ ni [] tm
1052 where
1053 ni env (PRef _ n)
1054 | not (n `elem` env)
1055 = case lookupTy Nothing n (tt_ctxt ist) of
1056 [] -> [n]
1057 _ -> if n `elem` (map fst uvars) then [n] else []
1058 ni env (PApp _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
1059 ni env (PCase _ c os) = ni env c ++ concatMap (ni env) (map snd os)
1060 ni env (PLam n ty sc) = ni env ty ++ ni (n:env) sc
1061 ni env (PPi _ n ty sc) = ni env ty ++ ni (n:env) sc
1062 ni env (PEq _ l r) = ni env l ++ ni env r
1063 ni env (PTyped l r) = ni env l ++ ni env r
1064 ni env (PPair _ l r) = ni env l ++ ni env r
1065 ni env (PDPair _ (PRef _ n) t r) = ni env t ++ ni (n:env) r
1066 ni env (PDPair _ l t r) = ni env l ++ ni env t ++ ni env r
1067 ni env (PAlternative a as) = concatMap (ni env) as
1068 ni env (PHidden tm) = ni env tm
1069 ni env _ = []
1071-- Return which of the given names are used in the given term.
1073usedNamesIn :: [Name] -> IState -> PTerm -> [Name]
1074usedNamesIn vars ist tm = nub $ ni [] tm
1075 where
1076 ni env (PRef _ n)
1077 | n `elem` vars && not (n `elem` env)
1078 = case lookupTy Nothing n (tt_ctxt ist) of
1079 [] -> [n]
1080 _ -> []
1081 ni env (PApp _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
1082 ni env (PCase _ c os) = ni env c ++ concatMap (ni env) (map snd os)
1083 ni env (PLam n ty sc) = ni env ty ++ ni (n:env) sc
1084 ni env (PPi _ n ty sc) = ni env ty ++ ni (n:env) sc
1085 ni env (PEq _ l r) = ni env l ++ ni env r
1086 ni env (PTyped l r) = ni env l ++ ni env r
1087 ni env (PPair _ l r) = ni env l ++ ni env r
1088 ni env (PDPair _ (PRef _ n) t r) = ni env t ++ ni (n:env) r
1089 ni env (PDPair _ l t r) = ni env l ++ ni env t ++ ni env r
1090 ni env (PAlternative a as) = concatMap (ni env) as
1091 ni env (PHidden tm) = ni env tm
1092 ni env _ = []