git.iko.soy/Idris-dev
on bb02275 help sign in
Idris-dev/src/Idris/AbsSyntaxTree.hs
1613 lines 63 kB history raw
1{-# LANGUAGE MultiParamTypeClasses, FlexibleInstances, DeriveFunctor,
2 TypeSynonymInstances, PatternGuards #-}
4module Idris.AbsSyntaxTree where
6import Idris.Core.TT
7import Idris.Core.Evaluate
8import Idris.Core.Elaborate hiding (Tactic(..))
9import Idris.Core.Typecheck
10import Idris.Docstrings
11import IRTS.Lang
12import IRTS.CodegenCommon
13import Util.Pretty
14import Util.DynamicLinker
16import Idris.Colours
18import Paths_idris
20import System.Console.Haskeline
21import System.IO
23import Control.Monad.Trans.State.Strict
24import Control.Monad.Trans.Error
26import Data.List hiding (group)
27import Data.Char
28import qualified Data.Map as M
29import qualified Data.Text as T
30import qualified Data.Map as M
31import Data.Either
32import qualified Data.Set as S
33import Data.Word (Word)
35import Debug.Trace
37import Text.PrettyPrint.Annotated.Leijen
39-- Data to pass to recursively called elaborators; e.g. for where blocks,
40-- paramaterised declarations, etc.
42data ElabInfo = EInfo { params :: [(Name, PTerm)],
43 inblock :: Ctxt [Name], -- names in the block, and their params
44 liftname :: Name -> Name,
45 namespace :: Maybe [String] }
47toplevel = EInfo [] emptyContext id Nothing
49eInfoNames :: ElabInfo -> [Name]
50eInfoNames info = map fst (params info) ++ M.keys (inblock info)
52data IOption = IOption { opt_logLevel :: Int,
53 opt_typecase :: Bool,
54 opt_typeintype :: Bool,
55 opt_coverage :: Bool,
56 opt_showimp :: Bool, -- ^^ show implicits
57 opt_errContext :: Bool,
58 opt_repl :: Bool,
59 opt_verbose :: Bool,
60 opt_nobanner :: Bool,
61 opt_quiet :: Bool,
62 opt_codegen :: Codegen,
63 opt_outputTy :: OutputType,
64 opt_ibcsubdir :: FilePath,
65 opt_importdirs :: [FilePath],
66 opt_triple :: String,
67 opt_cpu :: String,
68 opt_optLevel :: Word,
69 opt_cmdline :: [Opt], -- remember whole command line
70 opt_origerr :: Bool,
71 opt_autoSolve :: Bool -- ^ automatically apply "solve" tactic in prover
72 }
73 deriving (Show, Eq)
75defaultOpts = IOption { opt_logLevel = 0
76 , opt_typecase = False
77 , opt_typeintype = False
78 , opt_coverage = True
79 , opt_showimp = False
80 , opt_errContext = False
81 , opt_repl = True
82 , opt_verbose = True
83 , opt_nobanner = False
84 , opt_quiet = False
85 , opt_codegen = ViaC
86 , opt_outputTy = Executable
87 , opt_ibcsubdir = ""
88 , opt_importdirs = []
89 , opt_triple = ""
90 , opt_cpu = ""
91 , opt_optLevel = 2
92 , opt_cmdline = []
93 , opt_origerr = False
94 , opt_autoSolve = True
95 }
97data LanguageExt = TypeProviders | ErrorReflection deriving (Show, Eq, Read, Ord)
99-- | The output mode in use
100data OutputMode = RawOutput | IdeSlave Integer deriving Show
102-- | How wide is the console?
103data ConsoleWidth = InfinitelyWide -- ^ Have pretty-printer assume that lines should not be broken
104 | ColsWide Int -- ^ Manually specified - must be positive
105 | AutomaticWidth -- ^ Attempt to determine width, or 80 otherwise
107-- | The global state used in the Idris monad
108data IState = IState {
109 tt_ctxt :: Context, -- ^ All the currently defined names and their terms
110 idris_constraints :: [(UConstraint, FC)],
111 -- ^ A list of universe constraints and their corresponding source locations
112 idris_infixes :: [FixDecl], -- ^ Currently defined infix operators
113 idris_implicits :: Ctxt [PArg],
114 idris_statics :: Ctxt [Bool],
115 idris_classes :: Ctxt ClassInfo,
116 idris_dsls :: Ctxt DSL,
117 idris_optimisation :: Ctxt OptInfo,
118 idris_datatypes :: Ctxt TypeInfo,
119 idris_namehints :: Ctxt [Name],
120 idris_patdefs :: Ctxt ([([Name], Term, Term)], [PTerm]), -- not exported
121 -- ^ list of lhs/rhs, and a list of missing clauses
122 idris_flags :: Ctxt [FnOpt],
123 idris_callgraph :: Ctxt CGInfo, -- name, args used in each pos
124 idris_calledgraph :: Ctxt [Name],
125 idris_docstrings :: Ctxt (Docstring, [(Name, Docstring)]),
126 idris_tyinfodata :: Ctxt TIData,
127 idris_totcheck :: [(FC, Name)], -- names to check totality on
128 idris_defertotcheck :: [(FC, Name)], -- names to check at the end
129 idris_options :: IOption,
130 idris_name :: Int,
131 idris_lineapps :: [((FilePath, Int), PTerm)],
132 -- ^ Full application LHS on source line
133 idris_metavars :: [(Name, (Maybe Name, Int, Bool))], -- ^ The currently defined but not proven metavariables
134 idris_coercions :: [Name],
135 idris_transforms :: [(Term, Term)],
136 idris_errRev :: [(Term, Term)],
137 syntax_rules :: [Syntax],
138 syntax_keywords :: [String],
139 imported :: [FilePath], -- ^ The imported modules
140 idris_scprims :: [(Name, (Int, PrimFn))],
141 idris_objs :: [(Codegen, FilePath)],
142 idris_libs :: [(Codegen, String)],
143 idris_cgflags :: [(Codegen, String)],
144 idris_hdrs :: [(Codegen, String)],
145 idris_imported :: [FilePath], -- ^ Imported ibc file names
146 proof_list :: [(Name, [String])],
147 errSpan :: Maybe FC,
148 parserWarnings :: [(FC, Err)],
149 lastParse :: Maybe Name,
150 indent_stack :: [Int],
151 brace_stack :: [Maybe Int],
152 lastTokenSpan :: Maybe FC, -- ^ What was the span of the latest token parsed?
153 hide_list :: [(Name, Maybe Accessibility)],
154 default_access :: Accessibility,
155 default_total :: Bool,
156 ibc_write :: [IBCWrite],
157 compiled_so :: Maybe String,
158 idris_dynamic_libs :: [DynamicLib],
159 idris_language_extensions :: [LanguageExt],
160 idris_outputmode :: OutputMode,
161 idris_colourRepl :: Bool,
162 idris_colourTheme :: ColourTheme,
163 idris_outh :: Handle,
164 idris_errorhandlers :: [Name], -- ^ Global error handlers
165 idris_nameIdx :: (Int, Ctxt (Int, Name)),
166 idris_function_errorhandlers :: Ctxt (M.Map Name (S.Set Name)), -- ^ Specific error handlers
167 module_aliases :: M.Map [T.Text] [T.Text],
168 idris_consolewidth :: ConsoleWidth -- ^ How many chars wide is the console?
169 }
171data SizeChange = Smaller | Same | Bigger | Unknown
172 deriving (Show, Eq)
173{-!
174deriving instance Binary SizeChange
175deriving instance NFData SizeChange
176!-}
178type SCGEntry = (Name, [Maybe (Int, SizeChange)])
180data CGInfo = CGInfo { argsdef :: [Name],
181 calls :: [(Name, [[Name]])],
182 scg :: [SCGEntry],
183 argsused :: [Name],
184 usedpos :: [(Int, [(Name, Int)])] } -- (used_arg#, [(using_fn, its_arg#)])
185 deriving Show
186{-!
187deriving instance Binary CGInfo
188deriving instance NFData CGInfo
189!-}
191primDefs = [sUN "unsafePerformPrimIO",
192 sUN "mkLazyForeignPrim",
193 sUN "mkForeignPrim",
194 sUN "FalseElim"]
196-- information that needs writing for the current module's .ibc file
197data IBCWrite = IBCFix FixDecl
198 | IBCImp Name
199 | IBCStatic Name
200 | IBCClass Name
201 | IBCInstance Bool Name Name
202 | IBCDSL Name
203 | IBCData Name
204 | IBCOpt Name
205 | IBCMetavar Name
206 | IBCSyntax Syntax
207 | IBCKeyword String
208 | IBCImport FilePath
209 | IBCObj Codegen FilePath
210 | IBCLib Codegen String
211 | IBCCGFlag Codegen String
212 | IBCDyLib String
213 | IBCHeader Codegen String
214 | IBCAccess Name Accessibility
215 | IBCMetaInformation Name MetaInformation
216 | IBCTotal Name Totality
217 | IBCFlags Name [FnOpt]
218 | IBCTrans (Term, Term)
219 | IBCErrRev (Term, Term)
220 | IBCCG Name
221 | IBCDoc Name
222 | IBCCoercion Name
223 | IBCDef Name -- i.e. main context
224 | IBCNameHint (Name, Name)
225 | IBCLineApp FilePath Int PTerm
226 | IBCErrorHandler Name
227 | IBCFunctionErrorHandler Name Name Name
228 deriving Show
230-- | The initial state for the compiler
231idrisInit :: IState
232idrisInit = IState initContext [] [] emptyContext emptyContext emptyContext
233 emptyContext emptyContext emptyContext emptyContext
234 emptyContext emptyContext emptyContext emptyContext
235 emptyContext emptyContext
236 [] [] defaultOpts 6 [] [] [] [] [] [] [] [] [] [] [] [] []
237 [] [] Nothing [] Nothing [] [] Nothing [] Hidden False [] Nothing [] [] RawOutput
238 True defaultTheme stdout [] (0, emptyContext) emptyContext M.empty
239 AutomaticWidth
241-- | The monad for the main REPL - reading and processing files and updating
242-- global state (hence the IO inner monad).
243--type Idris = WriterT [Either String (IO ())] (State IState a))
244type Idris = StateT IState (ErrorT Err IO)
246-- Commands in the REPL
248data Codegen = ViaC
249 | ViaJava
250 | ViaNode
251 | ViaJavaScript
252 | ViaLLVM
253 | Bytecode
254 deriving (Show, Eq)
256-- | REPL commands
257data Command = Quit
258 | Help
259 | Eval PTerm
260 | Check PTerm
261 | DocStr Name
262 | TotCheck Name
263 | Reload
264 | Load FilePath
265 | ChangeDirectory FilePath
266 | ModImport String
267 | Edit
268 | Compile Codegen String
269 | Execute
270 | ExecVal PTerm
271 | Metavars
272 | Prove Name
273 | AddProof (Maybe Name)
274 | RmProof Name
275 | ShowProof Name
276 | Proofs
277 | Universes
278 | LogLvl Int
279 | Spec PTerm
280 | HNF PTerm
281 | TestInline PTerm
282 | Defn Name
283 | Info Name
284 | Missing Name
285 | DynamicLink FilePath
286 | ListDynamic
287 | Pattelab PTerm
288 | DebugInfo Name
289 | Search PTerm
290 | CaseSplitAt Bool Int Name
291 | AddClauseFrom Bool Int Name
292 | AddProofClauseFrom Bool Int Name
293 | AddMissing Bool Int Name
294 | MakeWith Bool Int Name
295 | DoProofSearch Bool Int Name [Name]
296 | SetOpt Opt
297 | UnsetOpt Opt
298 | NOP
299 | SetColour ColourType IdrisColour
300 | ColourOn
301 | ColourOff
302 | ListErrorHandlers
303 | SetConsoleWidth ConsoleWidth
304 | Apropos String
306data Opt = Filename String
307 | Ver
308 | Usage
309 | Quiet
310 | NoBanner
311 | ColourREPL Bool
312 | Ideslave
313 | ShowLibs
314 | ShowLibdir
315 | ShowIncs
316 | NoBasePkgs
317 | NoPrelude
318 | NoBuiltins -- only for the really primitive stuff!
319 | NoREPL
320 | OLogging Int
321 | Output String
322 | TypeCase
323 | TypeInType
324 | DefaultTotal
325 | DefaultPartial
326 | WarnPartial
327 | NoCoverage
328 | ErrContext
329 | ShowImpl
330 | Verbose
331 | IBCSubDir String
332 | ImportDir String
333 | PkgBuild String
334 | PkgInstall String
335 | PkgClean String
336 | PkgCheck String
337 | PkgREPL String
338 | WarnOnly
339 | Pkg String
340 | BCAsm String
341 | DumpDefun String
342 | DumpCases String
343 | UseCodegen Codegen
344 | OutputTy OutputType
345 | Extension LanguageExt
346 | InterpretScript String
347 | TargetTriple String
348 | TargetCPU String
349 | OptLevel Word
350 | Client String
351 | ShowOrigErr
352 | AutoWidth -- ^ Automatically adjust terminal width
353 | AutoSolve -- ^ Automatically issue "solve" tactic in interactive prover
354 deriving (Show, Eq)
356-- Parsed declarations
358data Fixity = Infixl { prec :: Int }
359 | Infixr { prec :: Int }
360 | InfixN { prec :: Int }
361 | PrefixN { prec :: Int }
362 deriving Eq
363{-!
364deriving instance Binary Fixity
365deriving instance NFData Fixity
366!-}
368instance Show Fixity where
369 show (Infixl i) = "infixl " ++ show i
370 show (Infixr i) = "infixr " ++ show i
371 show (InfixN i) = "infix " ++ show i
372 show (PrefixN i) = "prefix " ++ show i
374data FixDecl = Fix Fixity String
375 deriving Eq
377instance Show FixDecl where
378 show (Fix f s) = show f ++ " " ++ s
380{-!
381deriving instance Binary FixDecl
382deriving instance NFData FixDecl
383!-}
385instance Ord FixDecl where
386 compare (Fix x _) (Fix y _) = compare (prec x) (prec y)
389data Static = Static | Dynamic
390 deriving (Show, Eq)
391{-!
392deriving instance Binary Static
393deriving instance NFData Static
394!-}
396-- Mark bindings with their explicitness, and laziness
397data Plicity = Imp { pargopts :: [ArgOpt],
398 pstatic :: Static,
399 pparam :: Bool }
400 | Exp { pargopts :: [ArgOpt],
401 pstatic :: Static,
402 pparam :: Bool } -- this is a param (rather than index)
403 | Constraint { pargopts :: [ArgOpt],
404 pstatic :: Static }
405 | TacImp { pargopts :: [ArgOpt],
406 pstatic :: Static,
407 pscript :: PTerm }
408 deriving (Show, Eq)
410plazy :: Plicity -> Bool
411plazy tm = Lazy `elem` pargopts tm
413{-!
414deriving instance Binary Plicity
415deriving instance NFData Plicity
416!-}
418impl = Imp [Lazy] Dynamic False
419expl = Exp [] Dynamic False
420expl_param = Exp [] Dynamic True
421constraint = Constraint [] Dynamic
422tacimpl t = TacImp [] Dynamic t
424data FnOpt = Inlinable -- always evaluate when simplifying
425 | TotalFn | PartialFn | CoveringFn
426 | Coinductive | AssertTotal
427 | Dictionary -- type class dictionary, eval only when
428 -- a function argument, and further evaluation resutls
429 | Implicit -- implicit coercion
430 | CExport String -- export, with a C name
431 | ErrorHandler -- ^^ an error handler for use with the ErrorReflection extension
432 | ErrorReverse -- ^^ attempt to reverse normalise before showing in error
433 | Reflection -- a reflecting function, compile-time only
434 | Specialise [(Name, Maybe Int)] -- specialise it, freeze these names
435 deriving (Show, Eq)
436{-!
437deriving instance Binary FnOpt
438deriving instance NFData FnOpt
439!-}
441type FnOpts = [FnOpt]
443inlinable :: FnOpts -> Bool
444inlinable = elem Inlinable
446dictionary :: FnOpts -> Bool
447dictionary = elem Dictionary
450-- | Data declaration options
451data DataOpt = Codata -- Set if the the data-type is coinductive
452 | DefaultEliminator -- Set if an eliminator should be generated for data type
453 | DataErrRev
454 deriving (Show, Eq)
456type DataOpts = [DataOpt]
458-- | Type provider - what to provide
459data ProvideWhat = ProvTerm -- ^ only allow providing terms
460 | ProvPostulate -- ^ only allow postulates
461 | ProvAny -- ^ either is ok
462 deriving (Show, Eq)
464-- | Top-level declarations such as compiler directives, definitions,
465-- datatypes and typeclasses.
466data PDecl' t
467 = PFix FC Fixity [String] -- ^ Fixity declaration
468 | PTy Docstring [(Name, Docstring)] SyntaxInfo FC FnOpts Name t -- ^ Type declaration
469 | PPostulate Docstring SyntaxInfo FC FnOpts Name t -- ^ Postulate
470 | PClauses FC FnOpts Name [PClause' t] -- ^ Pattern clause
471 | PCAF FC Name t -- ^ Top level constant
472 | PData Docstring [(Name, Docstring)] SyntaxInfo FC DataOpts (PData' t) -- ^ Data declaration.
473 | PParams FC [(Name, t)] [PDecl' t] -- ^ Params block
474 | PNamespace String [PDecl' t] -- ^ New namespace
475 | PRecord Docstring SyntaxInfo FC Name t Docstring Name t -- ^ Record declaration
476 | PClass Docstring SyntaxInfo FC
477 [t] -- constraints
478 Name
479 [(Name, t)] -- parameters
480 [PDecl' t] -- declarations
481 -- ^ Type class: arguments are documentation, syntax info, source location, constraints,
482 -- class name, parameters, method declarations
483 | PInstance SyntaxInfo FC [t] -- constraints
484 Name -- class
485 [t] -- parameters
486 t -- full instance type
487 (Maybe Name) -- explicit name
488 [PDecl' t]
489 -- ^ Instance declaration: arguments are syntax info, source location, constraints,
490 -- class name, parameters, full instance type, optional explicit name, and definitions
491 | PDSL Name (DSL' t) -- ^ DSL declaration
492 | PSyntax FC Syntax -- ^ Syntax definition
493 | PMutual FC [PDecl' t] -- ^ Mutual block
494 | PDirective (Idris ()) -- ^ Compiler directive. The parser inserts the corresponding action in the Idris monad.
495 | PProvider SyntaxInfo FC ProvideWhat Name t t -- ^ Type provider. The first t is the type, the second is the term
496 | PTransform FC Bool t t -- ^ Source-to-source transformation rule. If
497 -- bool is True, lhs and rhs must be convertible
498 deriving Functor
499{-!
500deriving instance Binary PDecl'
501deriving instance NFData PDecl'
502!-}
504-- For elaborator state
505type ElabD a = Elab' [PDecl] a
507-- | One clause of a top-level definition. Term arguments to constructors are:
508--
509-- 1. The whole application (missing for PClauseR and PWithR because they're within a "with" clause)
510--
511-- 2. The list of extra 'with' patterns
512--
513-- 3. The right-hand side
514--
515-- 4. The where block (PDecl' t)
517data PClause' t = PClause FC Name t [t] t [PDecl' t] -- ^ A normal top-level definition.
518 | PWith FC Name t [t] t [PDecl' t]
519 | PClauseR FC [t] t [PDecl' t]
520 | PWithR FC [t] t [PDecl' t]
521 deriving Functor
522{-!
523deriving instance Binary PClause'
524deriving instance NFData PClause'
525!-}
527-- | Data declaration
528data PData' t = PDatadecl { d_name :: Name, -- ^ The name of the datatype
529 d_tcon :: t, -- ^ Type constructor
530 d_cons :: [(Docstring, [(Name, Docstring)], Name, t, FC, [Name])] -- ^ Constructors
531 }
532 -- ^ Data declaration
533 | PLaterdecl { d_name :: Name, d_tcon :: t }
534 -- ^ "Placeholder" for data whose constructors are defined later
535 deriving Functor
536{-!
537deriving instance Binary PData'
538deriving instance NFData PData'
539!-}
541-- Handy to get a free function for applying PTerm -> PTerm functions
542-- across a program, by deriving Functor
544type PDecl = PDecl' PTerm
545type PData = PData' PTerm
546type PClause = PClause' PTerm
548-- get all the names declared in a decl
550declared :: PDecl -> [Name]
551declared (PFix _ _ _) = []
552declared (PTy _ _ _ _ _ n t) = [n]
553declared (PPostulate _ _ _ _ n t) = [n]
554declared (PClauses _ _ n _) = [] -- not a declaration
555declared (PCAF _ n _) = [n]
556declared (PData _ _ _ _ _ (PDatadecl n _ ts)) = n : map fstt ts
557 where fstt (_, _, a, _, _, _) = a
558declared (PData _ _ _ _ _ (PLaterdecl n _)) = [n]
559declared (PParams _ _ ds) = concatMap declared ds
560declared (PNamespace _ ds) = concatMap declared ds
561declared (PRecord _ _ _ n _ _ c _) = [n, c]
562declared (PClass _ _ _ _ n _ ms) = n : concatMap declared ms
563declared (PInstance _ _ _ _ _ _ _ _) = []
564declared (PDSL n _) = [n]
565declared (PSyntax _ _) = []
566declared (PMutual _ ds) = concatMap declared ds
567declared (PDirective _) = []
569-- get the names declared, not counting nested parameter blocks
570tldeclared :: PDecl -> [Name]
571tldeclared (PFix _ _ _) = []
572tldeclared (PTy _ _ _ _ _ n t) = [n]
573tldeclared (PPostulate _ _ _ _ n t) = [n]
574tldeclared (PClauses _ _ n _) = [] -- not a declaration
575tldeclared (PRecord _ _ _ n _ _ c _) = [n, c]
576tldeclared (PData _ _ _ _ _ (PDatadecl n _ ts)) = n : map fstt ts
577 where fstt (_, _, a, _, _, _) = a
578tldeclared (PParams _ _ ds) = []
579tldeclared (PMutual _ ds) = concatMap tldeclared ds
580tldeclared (PNamespace _ ds) = concatMap tldeclared ds
581tldeclared (PClass _ _ _ _ n _ ms) = concatMap tldeclared ms
582tldeclared (PInstance _ _ _ _ _ _ _ _) = []
583tldeclared _ = []
585defined :: PDecl -> [Name]
586defined (PFix _ _ _) = []
587defined (PTy _ _ _ _ _ n t) = []
588defined (PPostulate _ _ _ _ n t) = []
589defined (PClauses _ _ n _) = [n] -- not a declaration
590defined (PCAF _ n _) = [n]
591defined (PData _ _ _ _ _ (PDatadecl n _ ts)) = n : map fstt ts
592 where fstt (_, _, a, _, _, _) = a
593defined (PData _ _ _ _ _ (PLaterdecl n _)) = []
594defined (PParams _ _ ds) = concatMap defined ds
595defined (PNamespace _ ds) = concatMap defined ds
596defined (PRecord _ _ _ n _ _ c _) = [n, c]
597defined (PClass _ _ _ _ n _ ms) = n : concatMap defined ms
598defined (PInstance _ _ _ _ _ _ _ _) = []
599defined (PDSL n _) = [n]
600defined (PSyntax _ _) = []
601defined (PMutual _ ds) = concatMap defined ds
602defined (PDirective _) = []
603--defined _ = []
605updateN :: [(Name, Name)] -> Name -> Name
606updateN ns n | Just n' <- lookup n ns = n'
607updateN _ n = n
609updateNs :: [(Name, Name)] -> PTerm -> PTerm
610updateNs [] t = t
611updateNs ns t = mapPT updateRef t
612 where updateRef (PRef fc f) = PRef fc (updateN ns f)
613 updateRef t = t
615-- updateDNs :: [(Name, Name)] -> PDecl -> PDecl
616-- updateDNs [] t = t
617-- updateDNs ns (PTy s f n t) | Just n' <- lookup n ns = PTy s f n' t
618-- updateDNs ns (PClauses f n c) | Just n' <- lookup n ns = PClauses f n' (map updateCNs c)
619-- where updateCNs ns (PClause n l ts r ds)
620-- = PClause (updateN ns n) (fmap (updateNs ns) l)
621-- (map (fmap (updateNs ns)) ts)
622-- (fmap (updateNs ns) r)
623-- (map (updateDNs ns) ds)
624-- updateDNs ns c = c
626data PunInfo = IsType | IsTerm | TypeOrTerm deriving (Eq, Show)
628-- | High level language terms
629data PTerm = PQuote Raw
630 | PRef FC Name
631 | PInferRef FC Name -- ^ A name to be defined later
632 | PPatvar FC Name
633 | PLam Name PTerm PTerm
634 | PPi Plicity Name PTerm PTerm
635 | PLet Name PTerm PTerm PTerm
636 | PTyped PTerm PTerm -- ^ Term with explicit type
637 | PApp FC PTerm [PArg]
638 | PAppBind FC PTerm [PArg] -- ^ implicitly bound application
639 | PMatchApp FC Name -- ^ Make an application by type matching
640 | PCase FC PTerm [(PTerm, PTerm)]
641 | PTrue FC PunInfo
642 | PFalse FC
643 | PRefl FC PTerm
644 | PResolveTC FC
645 | PEq FC PTerm PTerm
646 | PRewrite FC PTerm PTerm (Maybe PTerm)
647 | PPair FC PunInfo PTerm PTerm
648 | PDPair FC PunInfo PTerm PTerm PTerm
649 | PAlternative Bool [PTerm] -- True if only one may work
650 | PHidden PTerm -- ^ Irrelevant or hidden pattern
651 | PType
652 | PGoal FC PTerm Name PTerm
653 | PConstant Const
654 | Placeholder
655 | PDoBlock [PDo]
656 | PIdiom FC PTerm
657 | PReturn FC
658 | PMetavar Name
659 | PProof [PTactic] -- ^ Proof script
660 | PTactics [PTactic] -- ^ As PProof, but no auto solving
661 | PElabError Err -- ^ Error to report on elaboration
662 | PImpossible -- ^ Special case for declaring when an LHS can't typecheck
663 | PCoerced PTerm -- ^ To mark a coerced argument, so as not to coerce twice
664 | PDisamb [[T.Text]] PTerm -- ^ Preferences for explicit namespaces
665 | PUnifyLog PTerm -- ^ dump a trace of unifications when building term
666 | PNoImplicits PTerm -- ^ never run implicit converions on the term
667 deriving Eq
670{-!
671deriving instance Binary PTerm
672deriving instance NFData PTerm
673!-}
675mapPT :: (PTerm -> PTerm) -> PTerm -> PTerm
676mapPT f t = f (mpt t) where
677 mpt (PLam n t s) = PLam n (mapPT f t) (mapPT f s)
678 mpt (PPi p n t s) = PPi p n (mapPT f t) (mapPT f s)
679 mpt (PLet n ty v s) = PLet n (mapPT f ty) (mapPT f v) (mapPT f s)
680 mpt (PRewrite fc t s g) = PRewrite fc (mapPT f t) (mapPT f s)
681 (fmap (mapPT f) g)
682 mpt (PApp fc t as) = PApp fc (mapPT f t) (map (fmap (mapPT f)) as)
683 mpt (PAppBind fc t as) = PAppBind fc (mapPT f t) (map (fmap (mapPT f)) as)
684 mpt (PCase fc c os) = PCase fc (mapPT f c) (map (pmap (mapPT f)) os)
685 mpt (PEq fc l r) = PEq fc (mapPT f l) (mapPT f r)
686 mpt (PTyped l r) = PTyped (mapPT f l) (mapPT f r)
687 mpt (PPair fc p l r) = PPair fc p (mapPT f l) (mapPT f r)
688 mpt (PDPair fc p l t r) = PDPair fc p (mapPT f l) (mapPT f t) (mapPT f r)
689 mpt (PAlternative a as) = PAlternative a (map (mapPT f) as)
690 mpt (PHidden t) = PHidden (mapPT f t)
691 mpt (PDoBlock ds) = PDoBlock (map (fmap (mapPT f)) ds)
692 mpt (PProof ts) = PProof (map (fmap (mapPT f)) ts)
693 mpt (PTactics ts) = PTactics (map (fmap (mapPT f)) ts)
694 mpt (PUnifyLog tm) = PUnifyLog (mapPT f tm)
695 mpt (PDisamb ns tm) = PDisamb ns (mapPT f tm)
696 mpt (PNoImplicits tm) = PNoImplicits (mapPT f tm)
697 mpt (PGoal fc r n sc) = PGoal fc (mapPT f r) n (mapPT f sc)
698 mpt x = x
701data PTactic' t = Intro [Name] | Intros | Focus Name
702 | Refine Name [Bool] | Rewrite t
703 | Induction Name
704 | Equiv t
705 | MatchRefine Name
706 | LetTac Name t | LetTacTy Name t t
707 | Exact t | Compute | Trivial | TCInstance
708 | ProofSearch (Maybe Name) [Name]
709 | Solve
710 | Attack
711 | ProofState | ProofTerm | Undo
712 | Try (PTactic' t) (PTactic' t)
713 | TSeq (PTactic' t) (PTactic' t)
714 | ApplyTactic t -- see Language.Reflection module
715 | ByReflection t
716 | Reflect t
717 | Fill t
718 | GoalType String (PTactic' t)
719 | TCheck t
720 | TEval t
721 | Qed | Abandon
722 deriving (Show, Eq, Functor)
723{-!
724deriving instance Binary PTactic'
725deriving instance NFData PTactic'
726!-}
727instance Sized a => Sized (PTactic' a) where
728 size (Intro nms) = 1 + size nms
729 size Intros = 1
730 size (Focus nm) = 1 + size nm
731 size (Refine nm bs) = 1 + size nm + length bs
732 size (Rewrite t) = 1 + size t
733 size (Induction t) = 1 + size t
734 size (LetTac nm t) = 1 + size nm + size t
735 size (Exact t) = 1 + size t
736 size Compute = 1
737 size Trivial = 1
738 size Solve = 1
739 size Attack = 1
740 size ProofState = 1
741 size ProofTerm = 1
742 size Undo = 1
743 size (Try l r) = 1 + size l + size r
744 size (TSeq l r) = 1 + size l + size r
745 size (ApplyTactic t) = 1 + size t
746 size (Reflect t) = 1 + size t
747 size (Fill t) = 1 + size t
748 size Qed = 1
749 size Abandon = 1
751type PTactic = PTactic' PTerm
753data PDo' t = DoExp FC t
754 | DoBind FC Name t
755 | DoBindP FC t t [(t,t)]
756 | DoLet FC Name t t
757 | DoLetP FC t t
758 deriving (Eq, Functor)
759{-!
760deriving instance Binary PDo'
761deriving instance NFData PDo'
762!-}
764instance Sized a => Sized (PDo' a) where
765 size (DoExp fc t) = 1 + size fc + size t
766 size (DoBind fc nm t) = 1 + size fc + size nm + size t
767 size (DoBindP fc l r alts) = 1 + size fc + size l + size r + size alts
768 size (DoLet fc nm l r) = 1 + size fc + size nm + size l + size r
769 size (DoLetP fc l r) = 1 + size fc + size l + size r
771type PDo = PDo' PTerm
773-- The priority gives a hint as to elaboration order. Best to elaborate
774-- things early which will help give a more concrete type to other
775-- variables, e.g. a before (interpTy a).
777data PArg' t = PImp { priority :: Int,
778 machine_inf :: Bool, -- true if the machine inferred it
779 argopts :: [ArgOpt],
780 pname :: Name, getTm :: t }
781 | PExp { priority :: Int,
782 argopts :: [ArgOpt],
783 pname :: Name,
784 getTm :: t }
785 | PConstraint { priority :: Int,
786 argopts :: [ArgOpt],
787 pname :: Name,
788 getTm :: t }
789 | PTacImplicit { priority :: Int,
790 argopts :: [ArgOpt],
791 pname :: Name,
792 getScript :: t,
793 getTm :: t }
794 deriving (Show, Eq, Functor)
796data ArgOpt = Lazy | HideDisplay | InaccessibleArg
797 deriving (Show, Eq)
799lazyarg :: PArg' t -> Bool
800lazyarg tm = Lazy `elem` argopts tm
802instance Sized a => Sized (PArg' a) where
803 size (PImp p _ l nm trm) = 1 + size nm + size trm
804 size (PExp p l nm trm) = 1 + size nm + size trm
805 size (PConstraint p l nm trm) = 1 + size nm +size nm + size trm
806 size (PTacImplicit p l nm scr trm) = 1 + size nm + size scr + size trm
808{-!
809deriving instance Binary PArg'
810deriving instance NFData PArg'
811!-}
813pimp n t mach = PImp 1 mach [Lazy] n t
814pexp t = PExp 1 [] (sMN 0 "arg") t
815pconst t = PConstraint 1 [] (sMN 0 "carg") t
816ptacimp n s t = PTacImplicit 2 [Lazy] n s t
818type PArg = PArg' PTerm
820-- Type class data
822data ClassInfo = CI { instanceName :: Name,
823 class_methods :: [(Name, (FnOpts, PTerm))],
824 class_defaults :: [(Name, (Name, PDecl))], -- method name -> default impl
825 class_default_superclasses :: [PDecl],
826 class_params :: [Name],
827 class_instances :: [Name] }
828 deriving Show
829{-!
830deriving instance Binary ClassInfo
831deriving instance NFData ClassInfo
832!-}
834-- Type inference data
836data TIData = TIPartial -- ^ a function with a partially defined type
837 | TISolution [Term] -- ^ possible solutions to a metavariable in a type
838 deriving Show
840-- An argument is conditionally forceable iff its forceability
841-- depends on the collapsibility of the whole type.
842data Forceability = Conditional | Unconditional deriving (Show, Enum, Bounded, Eq, Ord)
844{-!
845deriving instance Binary Forceability
846deriving instance NFData Forceability
847!-}
849data OptInfo = Optimise { collapsible :: Bool,
850 isnewtype :: Bool,
851 -- The following should actually be (IntMap Forceability)
852 -- but the corresponding Binary instance seems to be broken.
853 -- Let's store a list and convert it to IntMap whenever needed.
854 forceable :: [(Int, Forceability)],
855 recursive :: [Int],
856 inaccessible :: [(Int,Name)] } -- arg name for error reporting
857 deriving Show
858{-!
859deriving instance Binary OptInfo
860deriving instance NFData OptInfo
861!-}
864data TypeInfo = TI { con_names :: [Name],
865 codata :: Bool,
866 data_opts :: DataOpts,
867 param_pos :: [Int] }
868 deriving Show
869{-!
870deriving instance Binary TypeInfo
871deriving instance NFData TypeInfo
872!-}
874-- Syntactic sugar info
876data DSL' t = DSL { dsl_bind :: t,
877 dsl_return :: t,
878 dsl_apply :: t,
879 dsl_pure :: t,
880 dsl_var :: Maybe t,
881 index_first :: Maybe t,
882 index_next :: Maybe t,
883 dsl_lambda :: Maybe t,
884 dsl_let :: Maybe t
885 }
886 deriving (Show, Functor)
887{-!
888deriving instance Binary DSL'
889deriving instance NFData DSL'
890!-}
892type DSL = DSL' PTerm
894data SynContext = PatternSyntax | TermSyntax | AnySyntax
895 deriving Show
896{-!
897deriving instance Binary SynContext
898deriving instance NFData SynContext
899!-}
901data Syntax = Rule [SSymbol] PTerm SynContext
902 deriving Show
903{-!
904deriving instance Binary Syntax
905deriving instance NFData Syntax
906!-}
908data SSymbol = Keyword Name
909 | Symbol String
910 | Binding Name
911 | Expr Name
912 | SimpleExpr Name
913 deriving Show
914{-!
915deriving instance Binary SSymbol
916deriving instance NFData SSymbol
917!-}
919initDSL = DSL (PRef f (sUN ">>="))
920 (PRef f (sUN "return"))
921 (PRef f (sUN "<$>"))
922 (PRef f (sUN "pure"))
923 Nothing
924 Nothing
925 Nothing
926 Nothing
927 Nothing
928 where f = fileFC "(builtin)"
930data Using = UImplicit Name PTerm
931 | UConstraint Name [Name]
932 deriving (Show, Eq)
933{-!
934deriving instance Binary Using
935deriving instance NFData Using
936!-}
938data SyntaxInfo = Syn { using :: [Using],
939 syn_params :: [(Name, PTerm)],
940 syn_namespace :: [String],
941 no_imp :: [Name],
942 decoration :: Name -> Name,
943 inPattern :: Bool,
944 implicitAllowed :: Bool,
945 dsl_info :: DSL }
946 deriving Show
947{-!
948deriving instance NFData SyntaxInfo
949deriving instance Binary SyntaxInfo
950!-}
952defaultSyntax = Syn [] [] [] [] id False False initDSL
954expandNS :: SyntaxInfo -> Name -> Name
955expandNS syn n@(NS _ _) = n
956expandNS syn n = case syn_namespace syn of
957 [] -> n
958 xs -> sNS n xs
961-- For inferring types of things
963bi = fileFC "builtin"
965inferTy = sMN 0 "__Infer"
966inferCon = sMN 0 "__infer"
967inferDecl = PDatadecl inferTy
968 PType
969 [(emptyDocstring, [], inferCon, PPi impl (sMN 0 "iType") PType (
970 PPi expl (sMN 0 "ival") (PRef bi (sMN 0 "iType"))
971 (PRef bi inferTy)), bi, [])]
972inferOpts = []
974infTerm t = PApp bi (PRef bi inferCon) [pimp (sMN 0 "iType") Placeholder True, pexp t]
975infP = P (TCon 6 0) inferTy (TType (UVal 0))
977getInferTerm, getInferType :: Term -> Term
978getInferTerm (Bind n b sc) = Bind n b $ getInferTerm sc
979getInferTerm (App (App _ _) tm) = tm
980getInferTerm tm = tm -- error ("getInferTerm " ++ show tm)
982getInferType (Bind n b sc) = Bind n (toTy b) $ getInferType sc
983 where toTy (Lam t) = Pi t
984 toTy (PVar t) = PVTy t
985 toTy b = b
986getInferType (App (App _ ty) _) = ty
990-- Handy primitives: Unit, False, Pair, MkPair, =, mkForeign, Elim type class
992primNames = [unitTy, unitCon,
993 falseTy, pairTy, pairCon,
994 eqTy, eqCon, inferTy, inferCon]
996unitTy = sMN 0 "__Unit"
997unitCon = sMN 0 "__II"
998unitDecl = PDatadecl unitTy PType
999 [(emptyDocstring, [], unitCon, PRef bi unitTy, bi, [])]
1000unitOpts = [DefaultEliminator]
1002falseTy = sMN 0 "__False"
1003falseDecl = PDatadecl falseTy PType []
1004falseOpts = []
1006pairTy = sMN 0 "__Pair"
1007pairCon = sMN 0 "__MkPair"
1008pairDecl = PDatadecl pairTy (piBind [(n "A", PType), (n "B", PType)] PType)
1009 [(emptyDocstring, [], pairCon, PPi impl (n "A") PType (
1010 PPi impl (n "B") PType (
1011 PPi expl (n "a") (PRef bi (n "A")) (
1012 PPi expl (n "b") (PRef bi (n "B"))
1013 (PApp bi (PRef bi pairTy) [pexp (PRef bi (n "A")),
1014 pexp (PRef bi (n "B"))])))), bi, [])]
1015 where n a = sMN 0 a
1016pairOpts = []
1018eqTy = sUN "="
1019eqCon = sUN "refl"
1020eqDecl = PDatadecl eqTy (piBind [(n "A", PType), (n "B", PType),
1021 (n "x", PRef bi (n "A")), (n "y", PRef bi (n "B"))]
1022 PType)
1023 [(emptyDocstring, [], eqCon, PPi impl (n "A") PType (
1024 PPi impl (n "x") (PRef bi (n "A"))
1025 (PApp bi (PRef bi eqTy) [pimp (n "A") Placeholder False,
1026 pimp (n "B") Placeholder False,
1027 pexp (PRef bi (n "x")),
1028 pexp (PRef bi (n "x"))])), bi, [])]
1029 where n a = sMN 0 a
1030eqOpts = []
1032elimName = sUN "__Elim"
1033elimMethElimTy = sUN "__elimTy"
1034elimMethElim = sUN "elim"
1035elimDecl = PClass (parseDocstring . T.pack $ "Type class for eliminators") defaultSyntax bi [] elimName [(sUN "scrutineeType", PType)]
1036 [PTy emptyDocstring [] defaultSyntax bi [TotalFn] elimMethElimTy PType,
1037 PTy emptyDocstring [] defaultSyntax bi [TotalFn] elimMethElim (PRef bi elimMethElimTy)]
1039-- Defined in builtins.idr
1040sigmaTy = sUN "Exists"
1041existsCon = sUN "Ex_intro"
1043piBind :: [(Name, PTerm)] -> PTerm -> PTerm
1044piBind = piBindp expl
1046piBindp :: Plicity -> [(Name, PTerm)] -> PTerm -> PTerm
1047piBindp p [] t = t
1048piBindp p ((n, ty):ns) t = PPi p n ty (piBindp p ns t)
1051-- Pretty-printing declarations and terms
1053-- These "show" instances render to an absurdly wide screen because inserted line breaks
1054-- could interfere with interactive editing, which calls "show".
1056instance Show PTerm where
1057 showsPrec _ tm = (displayS . renderPretty 1.0 10000000 . prettyImp False) tm
1059instance Show PDecl where
1060 showsPrec _ d = (displayS . renderPretty 1.0 10000000 . showDeclImp False) d
1062instance Show PClause where
1063 showsPrec _ c = (displayS . renderPretty 1.0 10000000 . showCImp True) c
1065instance Show PData where
1066 showsPrec _ d = (displayS . renderPretty 1.0 10000000 . showDImp False) d
1068instance Pretty PTerm OutputAnnotation where
1069 pretty = prettyImp False
1071-- | Colourise annotations according to an Idris state. It ignores the names
1072-- in the annotation, as there's no good way to show extended information on a
1073-- terminal.
1074consoleDecorate :: IState -> OutputAnnotation -> String -> String
1075consoleDecorate ist _ | not (idris_colourRepl ist) = id
1076consoleDecorate ist AnnConstData = let theme = idris_colourTheme ist
1077 in colouriseData theme
1078consoleDecorate ist AnnConstType = let theme = idris_colourTheme ist
1079 in colouriseType theme
1080consoleDecorate ist (AnnBoundName _ True) = colouriseImplicit (idris_colourTheme ist)
1081consoleDecorate ist (AnnBoundName _ False) = colouriseBound (idris_colourTheme ist)
1082consoleDecorate ist AnnKeyword = colouriseKeyword (idris_colourTheme ist)
1083consoleDecorate ist (AnnName n _ _ _) = let ctxt = tt_ctxt ist
1084 theme = idris_colourTheme ist
1085 in case () of
1086 _ | isDConName n ctxt -> colouriseData theme
1087 _ | isFnName n ctxt -> colouriseFun theme
1088 _ | isTConName n ctxt -> colouriseType theme
1089 _ | otherwise -> id -- don't colourise unknown names
1090consoleDecorate ist (AnnFC _) = id
1091consoleDecorate ist (AnnTextFmt fmt) = Idris.Colours.colourise (colour fmt)
1092 where colour BoldText = IdrisColour Nothing True False True False
1093 colour UnderlineText = IdrisColour Nothing True True False False
1094 colour ItalicText = IdrisColour Nothing True False False True
1096-- | Pretty-print a high-level closed Idris term
1097prettyImp :: Bool -- ^^ whether to show implicits
1098 -> PTerm -- ^^ the term to pretty-print
1099 -> Doc OutputAnnotation
1100prettyImp impl = pprintPTerm impl [] []
1102-- | Pretty-print a high-level Idris term in some bindings context
1103pprintPTerm :: Bool -- ^^ whether to show implicits
1104 -> [(Name, Bool)] -- ^^ the currently-bound names and whether they are implicit
1105 -> [Name] -- ^^ names to always show in pi, even if not used
1106 -> PTerm -- ^^ the term to pretty-print
1107 -> Doc OutputAnnotation
1108pprintPTerm impl bnd docArgs = prettySe 10 bnd
1109 where
1110 prettySe :: Int -> [(Name, Bool)] -> PTerm -> Doc OutputAnnotation
1111 prettySe p bnd (PQuote r) =
1112 text "![" <> pretty r <> text "]"
1113 prettySe p bnd (PPatvar fc n) = pretty n
1114 prettySe p bnd e
1115 | Just str <- slist p bnd e = str
1116 | Just n <- snat p e = annotate AnnConstData (text (show n))
1117 prettySe p bnd (PRef fc n) = prettyName impl bnd n
1118 prettySe p bnd (PLam n ty sc) =
1119 bracket p 2 . group . align . hang 2 $
1120 text "\\" <> bindingOf n False <+> text "=>" <$>
1121 prettySe 10 ((n, False):bnd) sc
1122 prettySe p bnd (PLet n ty v sc) =
1123 bracket p 2 $
1124 kwd "let" <+> bindingOf n False <+> text "=" </>
1125 prettySe 10 bnd v <+> kwd "in" </>
1126 prettySe 10 ((n, False):bnd) sc
1127 prettySe p bnd (PPi (Exp l s _) n ty sc)
1128 | n `elem` allNamesIn sc || impl || n `elem` docArgs =
1129 let open = if Lazy `elem` l then text "|" <> lparen else lparen in
1130 bracket p 2 . group $
1131 enclose open rparen (group . align $ bindingOf n False <+> colon <+> prettySe 10 bnd ty) <+>
1132 st <> text "->" <$> prettySe 10 ((n, False):bnd) sc
1133 | otherwise =
1134 bracket p 2 . group $
1135 group (prettySe 0 bnd ty <+> st) <> text "->" <$> group (prettySe 10 ((n, False):bnd) sc)
1136 where
1137 st =
1138 case s of
1139 Static -> text "[static]" <> space
1140 _ -> empty
1141 prettySe p bnd (PPi (Imp l s _) n ty sc)
1142 | impl =
1143 let open = if Lazy `elem` l then text "|" <> lbrace else lbrace in
1144 bracket p 2 $
1145 open <> bindingOf n True <+> colon <+> prettySe 10 bnd ty <> rbrace <+>
1146 st <> text "->" </> prettySe 10 ((n, True):bnd) sc
1147 | otherwise = prettySe 10 ((n, True):bnd) sc
1148 where
1149 st =
1150 case s of
1151 Static -> text "[static]" <> space
1152 _ -> empty
1153 prettySe p bnd (PPi (Constraint _ _) n ty sc) =
1154 bracket p 2 $
1155 prettySe 10 bnd ty <+> text "=>" </> prettySe 10 ((n, True):bnd) sc
1156 prettySe p bnd (PPi (TacImp _ _ s) n ty sc) =
1157 bracket p 2 $
1158 lbrace <> kwd "tacimp" <+> pretty n <+> colon <+> prettySe 10 bnd ty <>
1159 rbrace <+> text "->" </> prettySe 10 ((n, True):bnd) sc
1160 prettySe p bnd (PApp _ (PRef _ f) args) -- normal names, no explicit args
1161 | UN nm <- basename f
1162 , not impl && null (getExps args) = if isAlpha (thead nm)
1163 then prettyName impl bnd f
1164 else enclose lparen rparen $
1165 prettyName impl bnd f
1166 prettySe p bnd (PAppBind _ (PRef _ f) [])
1167 | not impl = text "!" <> prettyName impl bnd f
1168 prettySe p bnd (PApp _ (PRef _ op) args)
1169 | UN nm <- basename op
1170 , not (tnull nm) &&
1171 (not impl) && (not $ isAlpha (thead nm)) =
1172 case getExps args of
1173 [] -> enclose lparen rparen opName
1174 [x] -> group (enclose lparen rparen opName <$> group (prettySe 0 bnd x))
1175 [l,r] -> bracket p 1 $ inFix l r
1176 (l:r:rest) -> bracket p 1 $
1177 enclose lparen rparen (inFix l r) <+>
1178 align (group (vsep (map (prettyArgSe bnd) rest)))
1179 where opName = prettyName impl bnd op
1180 inFix l r = align . group $
1181 (prettySe 1 bnd l <+> opName) <$> group (prettySe 0 bnd r)
1182 prettySe p bnd (PApp _ hd@(PRef fc f) [tm])
1183 | PConstant (Idris.Core.TT.Str str) <- getTm tm,
1184 f == sUN "Symbol_" = char '\'' <> prettySe 10 bnd (PRef fc (sUN str))
1185 prettySe p bnd (PApp _ f as) =
1186 let args = getExps as
1187 fp = prettySe 1 bnd f
1188 in
1189 bracket p 1 . group $
1190 if impl
1191 then if null as
1192 then fp
1193 else fp <+> align (vsep (map (prettyArgS bnd) as))
1194 else if null args
1195 then fp
1196 else fp <+> align (vsep (map (prettyArgSe bnd) args))
1197 prettySe p bnd (PCase _ scr opts) =
1198 kwd "case" <+> prettySe 10 bnd scr <+> kwd "of" <> prettyBody
1199 where
1200 prettyBody = foldr (<>) empty $ intersperse (text "|") $ map sc opts
1202 sc (l, r) = nest nestingSize $ prettySe 10 bnd l <+> text "=>" <+> prettySe 10 bnd r
1203 prettySe p bnd (PHidden tm) = text "." <> prettySe 0 bnd tm
1204 prettySe p bnd (PRefl _ _) = annName eqCon $ text "refl"
1205 prettySe p bnd (PResolveTC _) = text "resolvetc"
1206 prettySe p bnd (PTrue _ IsType) = annName unitTy $ text "()"
1207 prettySe p bnd (PTrue _ IsTerm) = annName unitCon $ text "()"
1208 prettySe p bnd (PTrue _ TypeOrTerm) = text "()"
1209 prettySe p bnd (PFalse _) = annName falseTy $ text "_|_"
1210 prettySe p bnd (PEq _ l r) =
1211 bracket p 2 . align . group $
1212 prettySe 10 bnd l <+> eq <$> group (prettySe 10 bnd r)
1213 where eq = annName eqTy (text "=")
1214 prettySe p bnd (PRewrite _ l r _) =
1215 bracket p 2 $
1216 text "rewrite" <+> prettySe 10 bnd l <+> text "in" <+> prettySe 10 bnd r
1217 prettySe p bnd (PTyped l r) =
1218 lparen <> prettySe 10 bnd l <+> colon <+> prettySe 10 bnd r <> rparen
1219 prettySe p bnd pair@(PPair _ pun _ _) -- flatten tuples to the right, like parser
1220 | Just elts <- pairElts pair = enclose (ann lparen) (ann rparen) .
1221 align . group . vsep . punctuate (ann comma) $
1222 map (prettySe 10 bnd) elts
1223 where ann = case pun of
1224 TypeOrTerm -> id
1225 IsType -> annName pairTy
1226 IsTerm -> annName pairCon
1227 prettySe p bnd (PDPair _ TypeOrTerm l t r) =
1228 lparen <> prettySe 10 bnd l <+> text "**" <+> prettySe 10 bnd r <> rparen
1229 prettySe p bnd (PDPair _ IsType (PRef _ n) t r) =
1230 annName sigmaTy lparen <>
1231 bindingOf n False <+>
1232 annName sigmaTy (text "**") <+>
1233 prettySe 10 ((n, False):bnd) r <>
1234 annName sigmaTy rparen
1235 prettySe p bnd (PDPair _ IsType l t r) =
1236 annName sigmaTy lparen <>
1237 prettySe 10 bnd l <+>
1238 annName sigmaTy (text "**") <+>
1239 prettySe 10 bnd r <>
1240 annName sigmaTy rparen
1241 prettySe p bnd (PDPair _ IsTerm l t r) =
1242 annName existsCon lparen <>
1243 prettySe 10 bnd l <+>
1244 annName existsCon (text "**") <+>
1245 prettySe 10 bnd r <>
1246 annName existsCon rparen
1247 prettySe p bnd (PAlternative a as) =
1248 lparen <> text "|" <> prettyAs <> text "|" <> rparen
1249 where
1250 prettyAs =
1251 foldr (\l -> \r -> l <+> text "," <+> r) empty $ map (prettySe 10 bnd) as
1252 prettySe p bnd PType = annotate AnnConstType $ text "Type"
1253 prettySe p bnd (PConstant c) = annotate (annot c) (text (show c))
1254 where annot (AType _) = AnnConstType
1255 annot StrType = AnnConstType
1256 annot PtrType = AnnConstType
1257 annot VoidType = AnnConstType
1258 annot _ = AnnConstData
1259 -- XXX: add pretty for tactics
1260 prettySe p bnd (PProof ts) =
1261 text "proof" <+> lbrace <> nest nestingSize (text . show $ ts) <> rbrace
1262 prettySe p bnd (PTactics ts) =
1263 text "tactics" <+> lbrace <> nest nestingSize (text . show $ ts) <> rbrace
1264 prettySe p bnd (PMetavar n) = text "?" <> pretty n
1265 prettySe p bnd (PReturn f) = kwd "return"
1266 prettySe p bnd PImpossible = kwd "impossible"
1267 prettySe p bnd Placeholder = text "_"
1268 prettySe p bnd (PDoBlock _) = text "do block pretty not implemented"
1269 prettySe p bnd (PElabError s) = pretty s
1271 prettySe p bnd _ = text "test"
1273 prettyArgS bnd (PImp _ _ _ n tm) = prettyArgSi bnd (n, tm)
1274 prettyArgS bnd (PExp _ _ _ tm) = prettyArgSe bnd tm
1275 prettyArgS bnd (PConstraint _ _ _ tm) = prettyArgSc bnd tm
1276 prettyArgS bnd (PTacImplicit _ _ n _ tm) = prettyArgSti bnd (n, tm)
1278 prettyArgSe bnd arg = prettySe 0 bnd arg
1279 prettyArgSi bnd (n, val) = lbrace <> pretty n <+> text "=" <+> prettySe 10 bnd val <> rbrace
1280 prettyArgSc bnd val = lbrace <> lbrace <> prettySe 10 bnd val <> rbrace <> rbrace
1281 prettyArgSti bnd (n, val) = lbrace <> kwd "auto" <+> pretty n <+> text "=" <+> prettySe 10 bnd val <> rbrace
1283 annName :: Name -> Doc OutputAnnotation -> Doc OutputAnnotation
1284 annName n = annotate (AnnName n Nothing Nothing Nothing)
1286 basename :: Name -> Name
1287 basename (NS n _) = basename n
1288 basename n = n
1290 slist' p bnd (PApp _ (PRef _ nil) _)
1291 | not impl && nsroot nil == sUN "Nil" = Just []
1292 slist' p bnd (PRef _ nil)
1293 | not impl && nsroot nil == sUN "Nil" = Just []
1294 slist' p bnd (PApp _ (PRef _ cons) args)
1295 | nsroot cons == sUN "::",
1296 (PExp {getTm=tl}):(PExp {getTm=hd}):imps <- reverse args,
1297 all isImp imps,
1298 Just tl' <- slist' p bnd tl
1299 = Just (hd:tl')
1300 where
1301 isImp (PImp {}) = True
1302 isImp _ = False
1303 slist' _ _ tm = Nothing
1305 slist p bnd e | Just es <- slist' p bnd e = Just $
1306 case es of [] -> annotate AnnConstData $ text "[]"
1307 [x] -> enclose left right . group $
1308 prettySe p bnd x
1309 xs -> (enclose left right .
1310 align . group . vsep .
1311 punctuate comma .
1312 map (prettySe p bnd)) xs
1313 where left = (annotate AnnConstData (text "["))
1314 right = (annotate AnnConstData (text "]"))
1315 comma = (annotate AnnConstData (text ","))
1316 slist _ _ _ = Nothing
1318 pairElts :: PTerm -> Maybe [PTerm]
1319 pairElts (PPair _ _ x y) | Just elts <- pairElts y = Just (x:elts)
1320 | otherwise = Just [x, y]
1321 pairElts _ = Nothing
1323 natns = "Prelude.Nat."
1325 snat p (PRef _ z)
1326 | show z == (natns++"Z") || show z == "Z" = Just 0
1327 snat p (PApp _ s [PExp {getTm=n}])
1328 | show s == (natns++"S") || show s == "S",
1329 Just n' <- snat p n
1330 = Just $ 1 + n'
1331 snat _ _ = Nothing
1333 bracket outer inner doc
1334 | inner > outer = lparen <> doc <> rparen
1335 | otherwise = doc
1337 kwd = annotate AnnKeyword . text
1339-- | Pretty-printer helper for the binding site of a name
1340bindingOf :: Name -- ^^ the bound name
1341 -> Bool -- ^^ whether the name is implicit
1342 -> Doc OutputAnnotation
1343bindingOf n imp = annotate (AnnBoundName n imp) (text (show n))
1345-- | Pretty-printer helper for names that attaches the correct annotations
1346prettyName :: Bool -- ^^ whether to show namespaces
1347 -> [(Name, Bool)] -- ^^ the current bound variables and whether they are implicit
1348 -> Name -- ^^ the name to pprint
1349 -> Doc OutputAnnotation
1350prettyName showNS bnd n | Just imp <- lookup n bnd = annotate (AnnBoundName n imp) (text (strName n))
1351 | otherwise = annotate (AnnName n Nothing Nothing Nothing) (text (strName n))
1352 where strName (UN n) = T.unpack n
1353 strName (NS n ns) | showNS = (concatMap (++ ".") . map T.unpack . reverse) ns ++ strName n
1354 | otherwise = strName n
1355 strName (MN i s) = T.unpack s
1356 strName other = show other
1359showCImp :: Bool -> PClause -> Doc OutputAnnotation
1360showCImp impl (PClause _ n l ws r w)
1361 = prettyImp impl l <+> showWs ws <+> text "=" <+> prettyImp impl r
1362 <+> text "where" <+> text (show w)
1363 where
1364 showWs [] = empty
1365 showWs (x : xs) = text "|" <+> prettyImp impl x <+> showWs xs
1366showCImp impl (PWith _ n l ws r w)
1367 = prettyImp impl l <+> showWs ws <+> text "with" <+> prettyImp impl r
1368 <+> braces (text (show w))
1369 where
1370 showWs [] = empty
1371 showWs (x : xs) = text "|" <+> prettyImp impl x <+> showWs xs
1374showDImp :: Bool -> PData -> Doc OutputAnnotation
1375showDImp impl (PDatadecl n ty cons)
1376 = text "data" <+> text (show n) <+> colon <+> prettyImp impl ty <+> text "where" <$>
1377 (indent 2 $ vsep (map (\ (_, _, n, t, _, _) -> pipe <+> prettyName False [] n <+> colon <+> prettyImp impl t) cons))
1379showDecls :: Bool -> [PDecl] -> Doc OutputAnnotation
1380showDecls i ds = vsep (map (showDeclImp i) ds)
1382showDeclImp _ (PFix _ f ops) = text (show f) <+> cat (punctuate (text ",") (map text ops))
1383showDeclImp i (PTy _ _ _ _ _ n t) = text "tydecl" <+> text (showCG n) <+> colon <+> prettyImp i t
1384showDeclImp i (PClauses _ _ n cs) = text "pat" <+> text (showCG n) <+> text "\t" <+>
1385 indent 2 (vsep (map (showCImp i) cs))
1386showDeclImp _ (PData _ _ _ _ _ d) = showDImp True d
1387showDeclImp i (PParams _ ns ps) = text "params" <+> braces (text (show ns) <> line <> showDecls i ps <> line)
1388showDeclImp i (PNamespace n ps) = text "namespace" <+> text n <> braces (line <> showDecls i ps <> line)
1389showDeclImp _ (PSyntax _ syn) = text "syntax" <+> text (show syn)
1390showDeclImp i (PClass _ _ _ cs n ps ds)
1391 = text "class" <+> text (show cs) <+> text (show n) <+> text (show ps) <> line <> showDecls i ds
1392showDeclImp i (PInstance _ _ cs n _ t _ ds)
1393 = text "instance" <+> text (show cs) <+> text (show n) <+> prettyImp i t <> line <> showDecls i ds
1394showDeclImp _ _ = text "..."
1395-- showDeclImp (PImport i) = "import " ++ i
1397instance Show (Doc OutputAnnotation) where
1398 show = flip (displayS . renderCompact) ""
1400getImps :: [PArg] -> [(Name, PTerm)]
1401getImps [] = []
1402getImps (PImp _ _ _ n tm : xs) = (n, tm) : getImps xs
1403getImps (_ : xs) = getImps xs
1405getExps :: [PArg] -> [PTerm]
1406getExps [] = []
1407getExps (PExp _ _ _ tm : xs) = tm : getExps xs
1408getExps (_ : xs) = getExps xs
1410getConsts :: [PArg] -> [PTerm]
1411getConsts [] = []
1412getConsts (PConstraint _ _ _ tm : xs) = tm : getConsts xs
1413getConsts (_ : xs) = getConsts xs
1415getAll :: [PArg] -> [PTerm]
1416getAll = map getTm
1419-- | Show Idris name
1420showName :: Maybe IState -- ^^ the Idris state, for information about names and colours
1421 -> [(Name, Bool)] -- ^^ the bound variables and whether they're implicit
1422 -> Bool -- ^^ whether to show implicits
1423 -> Bool -- ^^ whether to colourise
1424 -> Name -- ^^ the term to show
1425 -> String
1426showName ist bnd impl colour n = case ist of
1427 Just i -> if colour then colourise n (idris_colourTheme i) else showbasic n
1428 Nothing -> showbasic n
1429 where name = if impl then show n else showbasic n
1430 showbasic n@(UN _) = showCG n
1431 showbasic (MN _ s) = str s
1432 showbasic (NS n s) = showSep "." (map str (reverse s)) ++ "." ++ showbasic n
1433 showbasic (SN s) = show s
1434 fst3 (x, _, _) = x
1435 colourise n t = let ctxt' = fmap tt_ctxt ist in
1436 case ctxt' of
1437 Nothing -> name
1438 Just ctxt | Just impl <- lookup n bnd -> if impl then colouriseImplicit t name
1439 else colouriseBound t name
1440 | isDConName n ctxt -> colouriseData t name
1441 | isFnName n ctxt -> colouriseFun t name
1442 | isTConName n ctxt -> colouriseType t name
1443 -- The assumption is that if a name is not bound and does not exist in the
1444 -- global context, then we're somewhere in which implicit info has been lost
1445 -- (like error messages). Thus, unknown vars are colourised as implicits.
1446 | otherwise -> colouriseImplicit t name
1448showTm :: IState -- ^^ the Idris state, for information about identifiers and colours
1449 -> PTerm -- ^^ the term to show
1450 -> String
1451showTm ist = displayDecorated (consoleDecorate ist) .
1452 renderPretty 0.8 100000 .
1453 prettyImp (opt_showimp (idris_options ist))
1455-- | Show a term with implicits, no colours
1456showTmImpls :: PTerm -> String
1457showTmImpls = flip (displayS . renderCompact . prettyImp True) ""
1460instance Sized PTerm where
1461 size (PQuote rawTerm) = size rawTerm
1462 size (PRef fc name) = size name
1463 size (PLam name ty bdy) = 1 + size ty + size bdy
1464 size (PPi plicity name ty bdy) = 1 + size ty + size bdy
1465 size (PLet name ty def bdy) = 1 + size ty + size def + size bdy
1466 size (PTyped trm ty) = 1 + size trm + size ty
1467 size (PApp fc name args) = 1 + size args
1468 size (PAppBind fc name args) = 1 + size args
1469 size (PCase fc trm bdy) = 1 + size trm + size bdy
1470 size (PTrue fc _) = 1
1471 size (PFalse fc) = 1
1472 size (PRefl fc _) = 1
1473 size (PResolveTC fc) = 1
1474 size (PEq fc left right) = 1 + size left + size right
1475 size (PRewrite fc left right _) = 1 + size left + size right
1476 size (PPair fc _ left right) = 1 + size left + size right
1477 size (PDPair fs _ left ty right) = 1 + size left + size ty + size right
1478 size (PAlternative a alts) = 1 + size alts
1479 size (PHidden hidden) = size hidden
1480 size (PUnifyLog tm) = size tm
1481 size (PDisamb _ tm) = size tm
1482 size (PNoImplicits tm) = size tm
1483 size PType = 1
1484 size (PConstant const) = 1 + size const
1485 size Placeholder = 1
1486 size (PDoBlock dos) = 1 + size dos
1487 size (PIdiom fc term) = 1 + size term
1488 size (PReturn fc) = 1
1489 size (PMetavar name) = 1
1490 size (PProof tactics) = size tactics
1491 size (PElabError err) = size err
1492 size PImpossible = 1
1494getPArity :: PTerm -> Int
1495getPArity (PPi _ _ _ sc) = 1 + getPArity sc
1496getPArity _ = 0
1498-- Return all names, free or globally bound, in the given term.
1500allNamesIn :: PTerm -> [Name]
1501allNamesIn tm = nub $ ni [] tm
1502 where -- TODO THINK added niTacImp, but is it right?
1503 ni env (PRef _ n)
1504 | not (n `elem` env) = [n]
1505 ni env (PPatvar _ n) = [n]
1506 ni env (PApp _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
1507 ni env (PAppBind _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
1508 ni env (PCase _ c os) = ni env c ++ concatMap (ni env) (map snd os)
1509 ni env (PLam n ty sc) = ni env ty ++ ni (n:env) sc
1510 ni env (PPi p n ty sc) = niTacImp env p ++ ni env ty ++ ni (n:env) sc
1511 ni env (PHidden tm) = ni env tm
1512 ni env (PEq _ l r) = ni env l ++ ni env r
1513 ni env (PRewrite _ l r _) = ni env l ++ ni env r
1514 ni env (PTyped l r) = ni env l ++ ni env r
1515 ni env (PPair _ _ l r) = ni env l ++ ni env r
1516 ni env (PDPair _ _ (PRef _ n) t r) = ni env t ++ ni (n:env) r
1517 ni env (PDPair _ _ l t r) = ni env l ++ ni env t ++ ni env r
1518 ni env (PAlternative a ls) = concatMap (ni env) ls
1519 ni env (PUnifyLog tm) = ni env tm
1520 ni env (PDisamb _ tm) = ni env tm
1521 ni env (PNoImplicits tm) = ni env tm
1522 ni env _ = []
1524 niTacImp env (TacImp _ _ scr) = ni env scr
1525 niTacImp _ _ = []
1527-- Return all names defined in binders in the given term
1528boundNamesIn :: PTerm -> [Name]
1529boundNamesIn tm = nub $ ni tm
1530 where -- TODO THINK Added niTacImp, but is it right?
1531 ni (PApp _ f as) = ni f ++ concatMap (ni) (map getTm as)
1532 ni (PAppBind _ f as) = ni f ++ concatMap (ni) (map getTm as)
1533 ni (PCase _ c os) = ni c ++ concatMap (ni) (map snd os)
1534 ni (PLam n ty sc) = n : (ni ty ++ ni sc)
1535 ni (PLet n ty val sc) = n : (ni ty ++ ni val ++ ni sc)
1536 ni (PPi p n ty sc) = niTacImp p ++ (n : (ni ty ++ ni sc))
1537 ni (PEq _ l r) = ni l ++ ni r
1538 ni (PRewrite _ l r _) = ni l ++ ni r
1539 ni (PTyped l r) = ni l ++ ni r
1540 ni (PPair _ _ l r) = ni l ++ ni r
1541 ni (PDPair _ _ (PRef _ n) t r) = ni t ++ ni r
1542 ni (PDPair _ _ l t r) = ni l ++ ni t ++ ni r
1543 ni (PAlternative a as) = concatMap (ni) as
1544 ni (PHidden tm) = ni tm
1545 ni (PUnifyLog tm) = ni tm
1546 ni (PDisamb _ tm) = ni tm
1547 ni (PNoImplicits tm) = ni tm
1548 ni _ = []
1550 niTacImp (TacImp _ _ scr) = ni scr
1551 niTacImp _ = []
1553-- Return names which are free in the given term.
1554namesIn :: [(Name, PTerm)] -> IState -> PTerm -> [Name]
1555namesIn uvars ist tm = nub $ ni [] tm
1556 where
1557 ni env (PRef _ n)
1558 | not (n `elem` env)
1559 = case lookupTy n (tt_ctxt ist) of
1560 [] -> [n]
1561 _ -> if n `elem` (map fst uvars) then [n] else []
1562 ni env (PApp _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
1563 ni env (PAppBind _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
1564 ni env (PCase _ c os) = ni env c ++ concatMap (ni env) (map snd os)
1565 ni env (PLam n ty sc) = ni env ty ++ ni (n:env) sc
1566 ni env (PPi p n ty sc) = niTacImp env p ++ ni env ty ++ ni (n:env) sc
1567 ni env (PEq _ l r) = ni env l ++ ni env r
1568 ni env (PRewrite _ l r _) = ni env l ++ ni env r
1569 ni env (PTyped l r) = ni env l ++ ni env r
1570 ni env (PPair _ _ l r) = ni env l ++ ni env r
1571 ni env (PDPair _ _ (PRef _ n) t r) = ni env t ++ ni (n:env) r
1572 ni env (PDPair _ _ l t r) = ni env l ++ ni env t ++ ni env r
1573 ni env (PAlternative a as) = concatMap (ni env) as
1574 ni env (PHidden tm) = ni env tm
1575 ni env (PUnifyLog tm) = ni env tm
1576 ni env (PDisamb _ tm) = ni env tm
1577 ni env (PNoImplicits tm) = ni env tm
1578 ni env _ = []
1580 niTacImp env (TacImp _ _ scr) = ni env scr
1581 niTacImp _ _ = []
1583-- Return which of the given names are used in the given term.
1585usedNamesIn :: [Name] -> IState -> PTerm -> [Name]
1586usedNamesIn vars ist tm = nub $ ni [] tm
1587 where -- TODO THINK added niTacImp, but is it right?
1588 ni env (PRef _ n)
1589 | n `elem` vars && not (n `elem` env)
1590 = case lookupTy n (tt_ctxt ist) of
1591 [] -> [n]
1592 _ -> []
1593 ni env (PApp _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
1594 ni env (PAppBind _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
1595 ni env (PCase _ c os) = ni env c ++ concatMap (ni env) (map snd os)
1596 ni env (PLam n ty sc) = ni env ty ++ ni (n:env) sc
1597 ni env (PPi p n ty sc) = niTacImp env p ++ ni env ty ++ ni (n:env) sc
1598 ni env (PEq _ l r) = ni env l ++ ni env r
1599 ni env (PRewrite _ l r _) = ni env l ++ ni env r
1600 ni env (PTyped l r) = ni env l ++ ni env r
1601 ni env (PPair _ _ l r) = ni env l ++ ni env r
1602 ni env (PDPair _ _ (PRef _ n) t r) = ni env t ++ ni (n:env) r
1603 ni env (PDPair _ _ l t r) = ni env l ++ ni env t ++ ni env r
1604 ni env (PAlternative a as) = concatMap (ni env) as
1605 ni env (PHidden tm) = ni env tm
1606 ni env (PUnifyLog tm) = ni env tm
1607 ni env (PDisamb _ tm) = ni env tm
1608 ni env (PNoImplicits tm) = ni env tm
1609 ni env _ = []
1611 niTacImp env (TacImp _ _ scr) = ni env scr
1612 niTacImp _ _ = []