git.iko.soy/Idris-dev
on ed85b4e help sign in
Idris-dev/src/Idris/AbsSyntaxTree.hs
1051 lines 36 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
361-- declared (PImport _) = []
363defined :: PDecl -> [Name]
364defined (PFix _ _ _) = []
365defined (PTy _ _ _ _ n t) = []
366defined (PPostulate _ _ _ _ n t) = []
367defined (PClauses _ _ n _) = [n] -- not a declaration
368defined (PRecord _ _ _ n _ _ c _) = [n, c]
369defined (PData _ _ _ _ (PDatadecl n _ ts)) = n : map fstt ts
370 where fstt (_, a, _, _) = a
371defined (PParams _ _ ds) = concatMap defined ds
372defined (PMutual _ ds) = concatMap defined ds
373defined (PNamespace _ ds) = concatMap defined ds
374-- declared (PImport _) = []
376updateN :: [(Name, Name)] -> Name -> Name
377updateN ns n | Just n' <- lookup n ns = n'
378updateN _ n = n
380updateNs :: [(Name, Name)] -> PTerm -> PTerm
381updateNs [] t = t
382updateNs ns t = mapPT updateRef t
383 where updateRef (PRef fc f) = PRef fc (updateN ns f)
384 updateRef t = t
386-- updateDNs :: [(Name, Name)] -> PDecl -> PDecl
387-- updateDNs [] t = t
388-- updateDNs ns (PTy s f n t) | Just n' <- lookup n ns = PTy s f n' t
389-- updateDNs ns (PClauses f n c) | Just n' <- lookup n ns = PClauses f n' (map updateCNs c)
390-- where updateCNs ns (PClause n l ts r ds)
391-- = PClause (updateN ns n) (fmap (updateNs ns) l)
392-- (map (fmap (updateNs ns)) ts)
393-- (fmap (updateNs ns) r)
394-- (map (updateDNs ns) ds)
395-- updateDNs ns c = c
397-- High level language terms
399data PTerm = PQuote Raw
400 | PRef FC Name
401 | PInferRef FC Name -- a name to be defined later
402 | PPatvar FC Name
403 | PLam Name PTerm PTerm
404 | PPi Plicity Name PTerm PTerm
405 | PLet Name PTerm PTerm PTerm
406 | PTyped PTerm PTerm -- term with explicit type
407 | PApp FC PTerm [PArg]
408 | PCase FC PTerm [(PTerm, PTerm)]
409 | PTrue FC
410 | PFalse FC
411 | PRefl FC PTerm
412 | PResolveTC FC
413 | PEq FC PTerm PTerm
414 | PPair FC PTerm PTerm
415 | PDPair FC PTerm PTerm PTerm
416 | PAlternative Bool [PTerm] -- True if only one may work
417 | PHidden PTerm -- irrelevant or hidden pattern
418 | PSet
419 | PConstant Const
420 | Placeholder
421 | PDoBlock [PDo]
422 | PIdiom FC PTerm
423 | PReturn FC
424 | PMetavar Name
425 | PProof [PTactic]
426 | PTactics [PTactic] -- as PProof, but no auto solving
427 | PElabError Err -- error to report on elaboration
428 | PImpossible -- special case for declaring when an LHS can't typecheck
429 deriving Eq
430{-!
431deriving instance Binary PTerm
432!-}
434mapPT :: (PTerm -> PTerm) -> PTerm -> PTerm
435mapPT f t = f (mpt t) where
436 mpt (PLam n t s) = PLam n (mapPT f t) (mapPT f s)
437 mpt (PPi p n t s) = PPi p n (mapPT f t) (mapPT f s)
438 mpt (PLet n ty v s) = PLet n (mapPT f ty) (mapPT f v) (mapPT f s)
439 mpt (PApp fc t as) = PApp fc (mapPT f t) (map (fmap (mapPT f)) as)
440 mpt (PCase fc c os) = PCase fc (mapPT f c) (map (pmap (mapPT f)) os)
441 mpt (PEq fc l r) = PEq fc (mapPT f l) (mapPT f r)
442 mpt (PTyped l r) = PTyped (mapPT f l) (mapPT f r)
443 mpt (PPair fc l r) = PPair fc (mapPT f l) (mapPT f r)
444 mpt (PDPair fc l t r) = PDPair fc (mapPT f l) (mapPT f t) (mapPT f r)
445 mpt (PAlternative a as) = PAlternative a (map (mapPT f) as)
446 mpt (PHidden t) = PHidden (mapPT f t)
447 mpt (PDoBlock ds) = PDoBlock (map (fmap (mapPT f)) ds)
448 mpt (PProof ts) = PProof (map (fmap (mapPT f)) ts)
449 mpt (PTactics ts) = PTactics (map (fmap (mapPT f)) ts)
450 mpt x = x
453data PTactic' t = Intro [Name] | Intros | Focus Name
454 | Refine Name [Bool] | Rewrite t
455 | LetTac Name t | LetTacTy Name t t
456 | Exact t | Compute | Trivial
457 | Solve
458 | Attack
459 | ProofState | ProofTerm | Undo
460 | Try (PTactic' t) (PTactic' t)
461 | TSeq (PTactic' t) (PTactic' t)
462 | Qed | Abandon
463 deriving (Show, Eq, Functor)
464{-!
465deriving instance Binary PTactic'
466!-}
468instance Sized a => Sized (PTactic' a) where
469 size (Intro nms) = 1 + size nms
470 size Intros = 1
471 size (Focus nm) = 1 + size nm
472 size (Refine nm bs) = 1 + size nm + length bs
473 size (Rewrite t) = 1 + size t
474 size (LetTac nm t) = 1 + size nm + size t
475 size (Exact t) = 1 + size t
476 size Compute = 1
477 size Trivial = 1
478 size Solve = 1
479 size Attack = 1
480 size ProofState = 1
481 size ProofTerm = 1
482 size Undo = 1
483 size (Try l r) = 1 + size l + size r
484 size (TSeq l r) = 1 + size l + size r
485 size Qed = 1
486 size Abandon = 1
488type PTactic = PTactic' PTerm
490data PDo' t = DoExp FC t
491 | DoBind FC Name t
492 | DoBindP FC t t
493 | DoLet FC Name t t
494 | DoLetP FC t t
495 deriving (Eq, Functor)
496{-!
497deriving instance Binary PDo'
498!-}
500instance Sized a => Sized (PDo' a) where
501 size (DoExp fc t) = 1 + size fc + size t
502 size (DoBind fc nm t) = 1 + size fc + size nm + size t
503 size (DoBindP fc l r) = 1 + size fc + size l + size r
504 size (DoLet fc nm l r) = 1 + size fc + size nm + size l + size r
505 size (DoLetP fc l r) = 1 + size fc + size l + size r
507type PDo = PDo' PTerm
509-- The priority gives a hint as to elaboration order. Best to elaborate
510-- things early which will help give a more concrete type to other
511-- variables, e.g. a before (interpTy a).
513data PArg' t = PImp { priority :: Int,
514 lazyarg :: Bool, pname :: Name, getTm :: t,
515 pargdoc :: String }
516 | PExp { priority :: Int,
517 lazyarg :: Bool, getTm :: t,
518 pargdoc :: String }
519 | PConstraint { priority :: Int,
520 lazyarg :: Bool, getTm :: t,
521 pargdoc :: String }
522 | PTacImplicit { priority :: Int,
523 lazyarg :: Bool, pname :: Name,
524 getScript :: t,
525 getTm :: t,
526 pargdoc :: String }
527 deriving (Show, Eq, Functor)
529instance Sized a => Sized (PArg' a) where
530 size (PImp p l nm trm _) = 1 + size nm + size trm
531 size (PExp p l trm _) = 1 + size trm
532 size (PConstraint p l trm _) = 1 + size trm
533 size (PTacImplicit p l nm scr trm _) = 1 + size nm + size scr + size trm
535{-!
536deriving instance Binary PArg'
537!-}
539pimp n t = PImp 0 True n t ""
540pexp t = PExp 0 False t ""
541pconst t = PConstraint 0 False t ""
542ptacimp n s t = PTacImplicit 0 True n s t ""
544type PArg = PArg' PTerm
546-- Type class data
548data ClassInfo = CI { instanceName :: Name,
549 class_methods :: [(Name, (FnOpts, PTerm))],
550 class_defaults :: [(Name, (Name, PDecl))], -- method name -> default impl
551 class_params :: [Name],
552 class_instances :: [Name] }
553 deriving Show
554{-!
555deriving instance Binary ClassInfo
556!-}
558data OptInfo = Optimise { collapsible :: Bool,
559 forceable :: [Int], -- argument positions
560 recursive :: [Int] }
561 deriving Show
562{-!
563deriving instance Binary OptInfo
564!-}
567data TypeInfo = TI { con_names :: [Name], codata :: Bool }
568 deriving Show
569{-!
570deriving instance Binary TypeInfo
571!-}
573-- Syntactic sugar info
575data DSL' t = DSL { dsl_bind :: t,
576 dsl_return :: t,
577 dsl_apply :: t,
578 dsl_pure :: t,
579 dsl_var :: Maybe t,
580 index_first :: Maybe t,
581 index_next :: Maybe t,
582 dsl_lambda :: Maybe t,
583 dsl_let :: Maybe t
584 }
585 deriving (Show, Functor)
586{-!
587deriving instance Binary DSL'
588!-}
590type DSL = DSL' PTerm
592data SynContext = PatternSyntax | TermSyntax | AnySyntax
593 deriving Show
594{-!
595deriving instance Binary SynContext
596!-}
598data Syntax = Rule [SSymbol] PTerm SynContext
599 deriving Show
600{-!
601deriving instance Binary Syntax
602!-}
604data SSymbol = Keyword Name
605 | Symbol String
606 | Binding Name
607 | Expr Name
608 | SimpleExpr Name
609 deriving Show
610{-!
611deriving instance Binary SSymbol
612!-}
614initDSL = DSL (PRef f (UN ">>="))
615 (PRef f (UN "return"))
616 (PRef f (UN "<$>"))
617 (PRef f (UN "pure"))
618 Nothing
619 Nothing
620 Nothing
621 Nothing
622 Nothing
623 where f = FC "(builtin)" 0
625data SyntaxInfo = Syn { using :: [(Name, PTerm)],
626 syn_params :: [(Name, PTerm)],
627 syn_namespace :: [String],
628 no_imp :: [Name],
629 decoration :: Name -> Name,
630 inPattern :: Bool,
631 implicitAllowed :: Bool,
632 dsl_info :: DSL }
633 deriving Show
634{-!
635deriving instance Binary SyntaxInfo
636!-}
638defaultSyntax = Syn [] [] [] [] id False False initDSL
640expandNS :: SyntaxInfo -> Name -> Name
641expandNS syn n@(NS _ _) = n
642expandNS syn n = case syn_namespace syn of
643 [] -> n
644 xs -> NS n xs
647--- Pretty printing declarations and terms
649instance Show PTerm where
650 show tm = showImp False tm
652instance Pretty PTerm where
653 pretty = prettyImp False
655instance Show PDecl where
656 show d = showDeclImp False d
658instance Show PClause where
659 show c = showCImp True c
661instance Show PData where
662 show d = showDImp False d
664showDeclImp _ (PFix _ f ops) = show f ++ " " ++ showSep ", " ops
665showDeclImp t (PTy _ _ _ _ n ty) = show n ++ " : " ++ showImp t ty
666showDeclImp t (PPostulate _ _ _ _ n ty) = show n ++ " : " ++ showImp t ty
667showDeclImp _ (PClauses _ _ n c) = showSep "\n" (map show c)
668showDeclImp _ (PData _ _ _ _ d) = show d
669showDeclImp _ (PParams f ns ps) = "parameters " ++ show ns ++ "\n" ++
670 showSep "\n" (map show ps)
673showCImp :: Bool -> PClause -> String
674showCImp impl (PClause _ n l ws r w)
675 = showImp impl l ++ showWs ws ++ " = " ++ showImp impl r
676 ++ " where " ++ show w
677 where
678 showWs [] = ""
679 showWs (x : xs) = " | " ++ showImp impl x ++ showWs xs
680showCImp impl (PWith _ n l ws r w)
681 = showImp impl l ++ showWs ws ++ " with " ++ showImp impl r
682 ++ " { " ++ show w ++ " } "
683 where
684 showWs [] = ""
685 showWs (x : xs) = " | " ++ showImp impl x ++ showWs xs
688showDImp :: Bool -> PData -> String
689showDImp impl (PDatadecl n ty cons)
690 = "data " ++ show n ++ " : " ++ showImp impl ty ++ " where\n\t"
691 ++ showSep "\n\t| "
692 (map (\ (_, n, t, _) -> show n ++ " : " ++ showImp impl t) cons)
694getImps :: [PArg] -> [(Name, PTerm)]
695getImps [] = []
696getImps (PImp _ _ n tm _ : xs) = (n, tm) : getImps xs
697getImps (_ : xs) = getImps xs
699getExps :: [PArg] -> [PTerm]
700getExps [] = []
701getExps (PExp _ _ tm _ : xs) = tm : getExps xs
702getExps (_ : xs) = getExps xs
704getConsts :: [PArg] -> [PTerm]
705getConsts [] = []
706getConsts (PConstraint _ _ tm _ : xs) = tm : getConsts xs
707getConsts (_ : xs) = getConsts xs
709getAll :: [PArg] -> [PTerm]
710getAll = map getTm
712prettyImp :: Bool -> PTerm -> Doc
713prettyImp impl = prettySe 10
714 where
715 prettySe p (PQuote r) =
716 if size r > breakingSize then
717 text "![" $$ pretty r <> text "]"
718 else
719 text "![" <> pretty r <> text "]"
720 prettySe p (PPatvar fc n) = pretty n
721 prettySe p (PRef fc n) =
722 if impl then
723 pretty n
724 else
725 prettyBasic n
726 where
727 prettyBasic n@(UN _) = pretty n
728 prettyBasic (MN _ s) = text s
729 prettyBasic (NS n s) = (foldr (<>) empty (intersperse (text ".") (map text $ reverse s))) <> prettyBasic n
730 prettySe p (PLam n ty sc) =
731 bracket p 2 $
732 if size sc > breakingSize then
733 text "λ" <> pretty n <+> text "=>" $+$ pretty sc
734 else
735 text "λ" <> pretty n <+> text "=>" <+> pretty sc
736 prettySe p (PLet n ty v sc) =
737 bracket p 2 $
738 if size sc > breakingSize then
739 text "let" <+> pretty n <+> text "=" <+> prettySe 10 v <+> text "in" $+$
740 nest nestingSize (prettySe 10 sc)
741 else
742 text "let" <+> pretty n <+> text "=" <+> prettySe 10 v <+> text "in" <+>
743 prettySe 10 sc
744 prettySe p (PPi (Exp l s _) n ty sc)
745 | n `elem` allNamesIn sc || impl =
746 let open = if l then text "|" <> lparen else lparen in
747 bracket p 2 $
748 if size sc > breakingSize then
749 open <> pretty n <+> colon <+> prettySe 10 ty <> rparen <+>
750 st <+> text "->" $+$ prettySe 10 sc
751 else
752 open <> pretty n <+> colon <+> prettySe 10 ty <> rparen <+>
753 st <+> text "->" <+> prettySe 10 sc
754 | otherwise =
755 bracket p 2 $
756 if size sc > breakingSize then
757 prettySe 0 ty <+> st <+> text "->" $+$ prettySe 10 sc
758 else
759 prettySe 0 ty <+> st <+> text "->" <+> prettySe 10 sc
760 where
761 st =
762 case s of
763 Static -> text "[static]"
764 _ -> empty
765 prettySe p (PPi (Imp l s _) n ty sc)
766 | impl =
767 let open = if l then text "|" <> lbrace else lbrace in
768 bracket p 2 $
769 if size sc > breakingSize then
770 open <> pretty n <+> colon <+> prettySe 10 ty <> rbrace <+>
771 st <+> text "->" <+> prettySe 10 sc
772 else
773 open <> pretty n <+> colon <+> prettySe 10 ty <> rbrace <+>
774 st <+> text "->" <+> prettySe 10 sc
775 | otherwise = prettySe 10 sc
776 where
777 st =
778 case s of
779 Static -> text $ "[static]"
780 _ -> empty
781 prettySe p (PPi (Constraint _ _ _) n ty sc) =
782 bracket p 2 $
783 if size sc > breakingSize then
784 prettySe 10 ty <+> text "=>" <+> prettySe 10 sc
785 else
786 prettySe 10 ty <+> text "=>" $+$ prettySe 10 sc
787 prettySe p (PPi (TacImp _ _ s _) n ty sc) =
788 bracket p 2 $
789 if size sc > breakingSize then
790 lbrace <> text "tacimp" <+> pretty n <+> colon <+> prettySe 10 ty <>
791 rbrace <+> text "->" $+$ prettySe 10 sc
792 else
793 lbrace <> text "tacimp" <+> pretty n <+> colon <+> prettySe 10 ty <>
794 rbrace <+> text "->" <+> prettySe 10 sc
795 prettySe p (PApp _ (PRef _ f) [])
796 | not impl = pretty f
797 prettySe p (PApp _ (PRef _ op@(UN (f:_))) args)
798 | length (getExps args) == 2 && (not impl) && (not $ isAlpha f) =
799 let [l, r] = getExps args in
800 bracket p 1 $
801 if size r > breakingSize then
802 prettySe 1 l <+> pretty op $+$ prettySe 0 r
803 else
804 prettySe 1 l <+> pretty op <+> prettySe 0 r
805 prettySe p (PApp _ f as) =
806 let args = getExps as in
807 bracket p 1 $
808 prettySe 1 f <+>
809 if impl then
810 foldl fS empty as
811 -- foldr (<+>) empty $ map prettyArgS as
812 else
813 foldl fSe empty args
814 -- foldr (<+>) empty $ map prettyArgSe args
815 where
816 fS l r =
817 if size r > breakingSize then
818 l $+$ nest nestingSize (prettyArgS r)
819 else
820 l <+> prettyArgS r
822 fSe l r =
823 if size r > breakingSize then
824 l $+$ nest nestingSize (prettyArgSe r)
825 else
826 l <+> prettyArgSe r
827 prettySe p (PCase _ scr opts) =
828 text "case" <+> prettySe 10 scr <+> text "of" $+$ nest nestingSize prettyBody
829 where
830 prettyBody = foldr ($$) empty $ intersperse (text "|") $ map sc opts
832 sc (l, r) = prettySe 10 l <+> text "=>" <+> prettySe 10 r
833 prettySe p (PHidden tm) = text "." <> prettySe 0 tm
834 prettySe p (PRefl _ _) = text "refl"
835 prettySe p (PResolveTC _) = text "resolvetc"
836 prettySe p (PTrue _) = text "()"
837 prettySe p (PFalse _) = text "_|_"
838 prettySe p (PEq _ l r) =
839 bracket p 2 $
840 if size r > breakingSize then
841 prettySe 10 l <+> text "=" $$ nest nestingSize (prettySe 10 r)
842 else
843 prettySe 10 l <+> text "=" <+> prettySe 10 r
844 prettySe p (PTyped l r) =
845 lparen <> prettySe 10 l <+> colon <+> prettySe 10 r <> rparen
846 prettySe p (PPair _ l r) =
847 if size r > breakingSize then
848 lparen <> prettySe 10 l <> text "," $+$
849 prettySe 10 r <> rparen
850 else
851 lparen <> prettySe 10 l <> text "," <+> prettySe 10 r <> rparen
852 prettySe p (PDPair _ l t r) =
853 if size r > breakingSize then
854 lparen <> prettySe 10 l <+> text "**" $+$
855 prettySe 10 r <> rparen
856 else
857 lparen <> prettySe 10 l <+> text "**" <+> prettySe 10 r <> rparen
858 prettySe p (PAlternative a as) =
859 lparen <> text "|" <> prettyAs <> text "|" <> rparen
860 where
861 prettyAs =
862 foldr (\l -> \r -> l <+> text "," <+> r) empty $ map (prettySe 10) as
863 prettySe p PSet = text "Set"
864 prettySe p (PConstant c) = pretty c
865 -- XXX: add pretty for tactics
866 prettySe p (PProof ts) =
867 text "proof" <+> lbrace $+$ nest nestingSize (text . show $ ts) $+$ rbrace
868 prettySe p (PTactics ts) =
869 text "tactics" <+> lbrace $+$ nest nestingSize (text . show $ ts) $+$ rbrace
870 prettySe p (PMetavar n) = text "?" <> pretty n
871 prettySe p (PReturn f) = text "return"
872 prettySe p PImpossible = text "impossible"
873 prettySe p Placeholder = text "_"
874 prettySe p (PDoBlock _) = text "do block pretty not implemented"
875 prettySe p (PElabError s) = pretty s
877 prettySe p _ = text "test"
879 prettyArgS (PImp _ _ n tm _) = prettyArgSi (n, tm)
880 prettyArgS (PExp _ _ tm _) = prettyArgSe tm
881 prettyArgS (PConstraint _ _ tm _) = prettyArgSc tm
882 prettyArgS (PTacImplicit _ _ n _ tm _) = prettyArgSti (n, tm)
884 prettyArgSe arg = prettySe 0 arg
885 prettyArgSi (n, val) = lbrace <> pretty n <+> text "=" <+> prettySe 10 val <> rbrace
886 prettyArgSc val = lbrace <> lbrace <> prettySe 10 val <> rbrace <> rbrace
887 prettyArgSti (n, val) = lbrace <> text "auto" <+> pretty n <+> text "=" <+> prettySe 10 val <> rbrace
889 bracket outer inner doc
890 | inner > outer = lparen <> doc <> rparen
891 | otherwise = doc
893showImp :: Bool -> PTerm -> String
894showImp impl tm = se 10 tm where
895 se p (PQuote r) = "![" ++ show r ++ "]"
896 se p (PPatvar fc n) = show n
897 se p (PInferRef fc n) = "!" ++ show n -- ++ "[" ++ show fc ++ "]"
898 se p (PRef fc n) = if impl then show n -- ++ "[" ++ show fc ++ "]"
899 else showbasic n
900 where showbasic n@(UN _) = show n
901 showbasic (MN _ s) = s
902 showbasic (NS n s) = showSep "." (reverse s) ++ "." ++ showbasic n
903 se p (PLam n ty sc) = bracket p 2 $ "\\ " ++ show n ++
904 (if impl then " : " ++ se 10 ty else "") ++ " => "
905 ++ se 10 sc
906 se p (PLet n ty v sc) = bracket p 2 $ "let " ++ show n ++ " = " ++ se 10 v ++
907 " in " ++ se 10 sc
908 se p (PPi (Exp l s _) n ty sc)
909 | n `elem` allNamesIn sc || impl
910 = bracket p 2 $
911 (if l then "|(" else "(") ++
912 show n ++ " : " ++ se 10 ty ++
913 ") " ++ st ++
914 "-> " ++ se 10 sc
915 | otherwise = bracket p 2 $ se 0 ty ++ " " ++ st ++ "-> " ++ se 10 sc
916 where st = case s of
917 Static -> "[static] "
918 _ -> ""
919 se p (PPi (Imp l s _) n ty sc)
920 | impl = bracket p 2 $ (if l then "|{" else "{") ++
921 show n ++ " : " ++ se 10 ty ++
922 "} " ++ st ++ "-> " ++ se 10 sc
923 | otherwise = se 10 sc
924 where st = case s of
925 Static -> "[static] "
926 _ -> ""
927 se p (PPi (Constraint _ _ _) n ty sc)
928 = bracket p 2 $ se 10 ty ++ " => " ++ se 10 sc
929 se p (PPi (TacImp _ _ s _) n ty sc)
930 = bracket p 2 $ "{tacimp " ++ show n ++ " : " ++ se 10 ty ++ "} -> " ++ se 10 sc
931 se p (PApp _ (PRef _ f) [])
932 | not impl = show f
933 se p (PApp _ (PRef _ op@(UN (f:_))) args)
934 | length (getExps args) == 2 && not impl && not (isAlpha f)
935 = let [l, r] = getExps args in
936 bracket p 1 $ se 1 l ++ " " ++ show op ++ " " ++ se 0 r
937 se p (PApp _ f as)
938 = let args = getExps as in
939 bracket p 1 $ se 1 f ++ if impl then concatMap sArg as
940 else concatMap seArg args
941 se p (PCase _ scr opts) = "case " ++ se 10 scr ++ " of " ++ showSep " | " (map sc opts)
942 where sc (l, r) = se 10 l ++ " => " ++ se 10 r
943 se p (PHidden tm) = "." ++ se 0 tm
944 se p (PRefl _ t)
945 | not impl = "refl"
946 | otherwise = "refl {" ++ se 10 t ++ "}"
947 se p (PResolveTC _) = "resolvetc"
948 se p (PTrue _) = "()"
949 se p (PFalse _) = "_|_"
950 se p (PEq _ l r) = bracket p 2 $ se 10 l ++ " = " ++ se 10 r
951 se p (PTyped l r) = "(" ++ se 10 l ++ " : " ++ se 10 r ++ ")"
952 se p (PPair _ l r) = "(" ++ se 10 l ++ ", " ++ se 10 r ++ ")"
953 se p (PDPair _ l t r) = "(" ++ se 10 l ++ " ** " ++ se 10 r ++ ")"
954 se p (PAlternative a as) = "(|" ++ showSep " , " (map (se 10) as) ++ "|)"
955 se p PSet = "Set"
956 se p (PConstant c) = show c
957 se p (PProof ts) = "proof { " ++ show ts ++ "}"
958 se p (PTactics ts) = "tactics { " ++ show ts ++ "}"
959 se p (PMetavar n) = "?" ++ show n
960 se p (PReturn f) = "return"
961 se p PImpossible = "impossible"
962 se p Placeholder = "_"
963 se p (PDoBlock _) = "do block show not implemented"
964 se p (PElabError s) = show s
965-- se p x = "Not implemented"
967 sArg (PImp _ _ n tm _) = siArg (n, tm)
968 sArg (PExp _ _ tm _) = seArg tm
969 sArg (PConstraint _ _ tm _) = scArg tm
970 sArg (PTacImplicit _ _ n _ tm _) = stiArg (n, tm)
972 seArg arg = " " ++ se 0 arg
973 siArg (n, val) = " {" ++ show n ++ " = " ++ se 10 val ++ "}"
974 scArg val = " {{" ++ se 10 val ++ "}}"
975 stiArg (n, val) = " {auto " ++ show n ++ " = " ++ se 10 val ++ "}"
977 bracket outer inner str | inner > outer = "(" ++ str ++ ")"
978 | otherwise = str
981instance Sized PTerm where
982 size (PQuote rawTerm) = size rawTerm
983 size (PRef fc name) = size name
984 size (PLam name ty bdy) = 1 + size ty + size bdy
985 size (PPi plicity name ty bdy) = 1 + size ty + size bdy
986 size (PLet name ty def bdy) = 1 + size ty + size def + size bdy
987 size (PTyped trm ty) = 1 + size trm + size ty
988 size (PApp fc name args) = 1 + size args
989 size (PCase fc trm bdy) = 1 + size trm + size bdy
990 size (PTrue fc) = 1
991 size (PFalse fc) = 1
992 size (PRefl fc _) = 1
993 size (PResolveTC fc) = 1
994 size (PEq fc left right) = 1 + size left + size right
995 size (PPair fc left right) = 1 + size left + size right
996 size (PDPair fs left ty right) = 1 + size left + size ty + size right
997 size (PAlternative a alts) = 1 + size alts
998 size (PHidden hidden) = size hidden
999 size PSet = 1
1000 size (PConstant const) = 1 + size const
1001 size Placeholder = 1
1002 size (PDoBlock dos) = 1 + size dos
1003 size (PIdiom fc term) = 1 + size term
1004 size (PReturn fc) = 1
1005 size (PMetavar name) = 1
1006 size (PProof tactics) = size tactics
1007 size (PElabError err) = size err
1008 size PImpossible = 1
1010getPArity :: PTerm -> Int
1011getPArity (PPi _ _ _ sc) = 1 + getPArity sc
1012getPArity _ = 0
1014allNamesIn :: PTerm -> [Name]
1015allNamesIn tm = nub $ ni [] tm
1016 where
1017 ni env (PRef _ n)
1018 | not (n `elem` env) = [n]
1019 ni env (PApp _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
1020 ni env (PCase _ c os) = ni env c ++ concatMap (ni env) (map snd os)
1021 ni env (PLam n ty sc) = ni env ty ++ ni (n:env) sc
1022 ni env (PPi _ n ty sc) = ni env ty ++ ni (n:env) sc
1023 ni env (PHidden tm) = ni env tm
1024 ni env (PEq _ l r) = ni env l ++ ni env r
1025 ni env (PTyped l r) = ni env l ++ ni env r
1026 ni env (PPair _ l r) = ni env l ++ ni env r
1027 ni env (PDPair _ (PRef _ n) t r) = ni env t ++ ni (n:env) r
1028 ni env (PDPair _ l t r) = ni env l ++ ni env t ++ ni env r
1029 ni env (PAlternative a ls) = concatMap (ni env) ls
1030 ni env _ = []
1032namesIn :: [(Name, PTerm)] -> IState -> PTerm -> [Name]
1033namesIn uvars ist tm = nub $ ni [] tm
1034 where
1035 ni env (PRef _ n)
1036 | not (n `elem` env)
1037 = case lookupTy Nothing n (tt_ctxt ist) of
1038 [] -> [n]
1039 _ -> if n `elem` (map fst uvars) then [n] else []
1040 ni env (PApp _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
1041 ni env (PCase _ c os) = ni env c ++ concatMap (ni env) (map snd os)
1042 ni env (PLam n ty sc) = ni env ty ++ ni (n:env) sc
1043 ni env (PPi _ n ty sc) = ni env ty ++ ni (n:env) sc
1044 ni env (PEq _ l r) = ni env l ++ ni env r
1045 ni env (PTyped l r) = ni env l ++ ni env r
1046 ni env (PPair _ l r) = ni env l ++ ni env r
1047 ni env (PDPair _ (PRef _ n) t r) = ni env t ++ ni (n:env) r
1048 ni env (PDPair _ l t r) = ni env l ++ ni env t ++ ni env r
1049 ni env (PAlternative a as) = concatMap (ni env) as
1050 ni env (PHidden tm) = ni env tm
1051 ni env _ = []