git.iko.soy/Idris-dev
on 157ffad help sign in
Idris-dev/src/Idris/AbsSyntaxTree.hs
1714 lines 68 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)
34import Data.Maybe (fromMaybe)
36import Debug.Trace
38import Text.PrettyPrint.Annotated.Leijen
40-- Data to pass to recursively called elaborators; e.g. for where blocks,
41-- paramaterised declarations, etc.
43data ElabInfo = EInfo { params :: [(Name, PTerm)],
44 inblock :: Ctxt [Name], -- names in the block, and their params
45 liftname :: Name -> Name,
46 namespace :: Maybe [String] }
48toplevel = EInfo [] emptyContext id Nothing
50eInfoNames :: ElabInfo -> [Name]
51eInfoNames info = map fst (params info) ++ M.keys (inblock info)
53data IOption = IOption { opt_logLevel :: Int,
54 opt_typecase :: Bool,
55 opt_typeintype :: Bool,
56 opt_coverage :: Bool,
57 opt_showimp :: Bool, -- ^^ show implicits
58 opt_errContext :: Bool,
59 opt_repl :: Bool,
60 opt_verbose :: Bool,
61 opt_nobanner :: Bool,
62 opt_quiet :: Bool,
63 opt_codegen :: Codegen,
64 opt_outputTy :: OutputType,
65 opt_ibcsubdir :: FilePath,
66 opt_importdirs :: [FilePath],
67 opt_triple :: String,
68 opt_cpu :: String,
69 opt_optLevel :: Word,
70 opt_cmdline :: [Opt], -- remember whole command line
71 opt_origerr :: Bool,
72 opt_autoSolve :: Bool -- ^ automatically apply "solve" tactic in prover
73 }
74 deriving (Show, Eq)
76defaultOpts = IOption { opt_logLevel = 0
77 , opt_typecase = False
78 , opt_typeintype = False
79 , opt_coverage = True
80 , opt_showimp = False
81 , opt_errContext = False
82 , opt_repl = True
83 , opt_verbose = True
84 , opt_nobanner = False
85 , opt_quiet = False
86 , opt_codegen = ViaC
87 , opt_outputTy = Executable
88 , opt_ibcsubdir = ""
89 , opt_importdirs = []
90 , opt_triple = ""
91 , opt_cpu = ""
92 , opt_optLevel = 2
93 , opt_cmdline = []
94 , opt_origerr = False
95 , opt_autoSolve = True
96 }
98data PPOption = PPOption {
99 ppopt_impl :: Bool -- ^^ whether to show implicits
100} deriving (Show)
102-- | Pretty printing options with default verbosity.
103defaultPPOption :: PPOption
104defaultPPOption = PPOption { ppopt_impl = False }
106-- | Pretty printing options with the most verbosity.
107verbosePPOption :: PPOption
108verbosePPOption = PPOption { ppopt_impl = True }
110-- | Get pretty printing options from the big options record.
111ppOption :: IOption -> PPOption
112ppOption opt = PPOption {
113 ppopt_impl = opt_showimp opt
116-- | Get pretty printing options from an idris state record.
117ppOptionIst :: IState -> PPOption
118ppOptionIst = ppOption . idris_options
120data LanguageExt = TypeProviders | ErrorReflection deriving (Show, Eq, Read, Ord)
122-- | The output mode in use
123data OutputMode = RawOutput | IdeSlave Integer deriving Show
125-- | How wide is the console?
126data ConsoleWidth = InfinitelyWide -- ^ Have pretty-printer assume that lines should not be broken
127 | ColsWide Int -- ^ Manually specified - must be positive
128 | AutomaticWidth -- ^ Attempt to determine width, or 80 otherwise
130-- | The global state used in the Idris monad
131data IState = IState {
132 tt_ctxt :: Context, -- ^ All the currently defined names and their terms
133 idris_constraints :: [(UConstraint, FC)],
134 -- ^ A list of universe constraints and their corresponding source locations
135 idris_infixes :: [FixDecl], -- ^ Currently defined infix operators
136 idris_implicits :: Ctxt [PArg],
137 idris_statics :: Ctxt [Bool],
138 idris_classes :: Ctxt ClassInfo,
139 idris_dsls :: Ctxt DSL,
140 idris_optimisation :: Ctxt OptInfo,
141 idris_datatypes :: Ctxt TypeInfo,
142 idris_namehints :: Ctxt [Name],
143 idris_patdefs :: Ctxt ([([Name], Term, Term)], [PTerm]), -- not exported
144 -- ^ list of lhs/rhs, and a list of missing clauses
145 idris_flags :: Ctxt [FnOpt],
146 idris_callgraph :: Ctxt CGInfo, -- name, args used in each pos
147 idris_calledgraph :: Ctxt [Name],
148 idris_docstrings :: Ctxt (Docstring, [(Name, Docstring)]),
149 idris_tyinfodata :: Ctxt TIData,
150 idris_totcheck :: [(FC, Name)], -- names to check totality on
151 idris_defertotcheck :: [(FC, Name)], -- names to check at the end
152 idris_totcheckfail :: [(FC, String)],
153 idris_options :: IOption,
154 idris_name :: Int,
155 idris_lineapps :: [((FilePath, Int), PTerm)],
156 -- ^ Full application LHS on source line
157 idris_metavars :: [(Name, (Maybe Name, Int, Bool))], -- ^ The currently defined but not proven metavariables
158 idris_coercions :: [Name],
159 idris_transforms :: [(Term, Term)],
160 idris_errRev :: [(Term, Term)],
161 syntax_rules :: [Syntax],
162 syntax_keywords :: [String],
163 imported :: [FilePath], -- ^ The imported modules
164 idris_scprims :: [(Name, (Int, PrimFn))],
165 idris_objs :: [(Codegen, FilePath)],
166 idris_libs :: [(Codegen, String)],
167 idris_cgflags :: [(Codegen, String)],
168 idris_hdrs :: [(Codegen, String)],
169 idris_imported :: [FilePath], -- ^ Imported ibc file names
170 proof_list :: [(Name, [String])],
171 errSpan :: Maybe FC,
172 parserWarnings :: [(FC, Err)],
173 lastParse :: Maybe Name,
174 indent_stack :: [Int],
175 brace_stack :: [Maybe Int],
176 lastTokenSpan :: Maybe FC, -- ^ What was the span of the latest token parsed?
177 idris_parsedSpan :: Maybe FC,
178 hide_list :: [(Name, Maybe Accessibility)],
179 default_access :: Accessibility,
180 default_total :: Bool,
181 ibc_write :: [IBCWrite],
182 compiled_so :: Maybe String,
183 idris_dynamic_libs :: [DynamicLib],
184 idris_language_extensions :: [LanguageExt],
185 idris_outputmode :: OutputMode,
186 idris_colourRepl :: Bool,
187 idris_colourTheme :: ColourTheme,
188 idris_outh :: Handle,
189 idris_errorhandlers :: [Name], -- ^ Global error handlers
190 idris_nameIdx :: (Int, Ctxt (Int, Name)),
191 idris_function_errorhandlers :: Ctxt (M.Map Name (S.Set Name)), -- ^ Specific error handlers
192 module_aliases :: M.Map [T.Text] [T.Text],
193 idris_consolewidth :: ConsoleWidth, -- ^ How many chars wide is the console?
194 idris_postulates :: S.Set Name,
195 idris_whocalls :: Maybe (M.Map Name [Name]),
196 idris_callswho :: Maybe (M.Map Name [Name])
197 }
199data SizeChange = Smaller | Same | Bigger | Unknown
200 deriving (Show, Eq)
201{-!
202deriving instance Binary SizeChange
203deriving instance NFData SizeChange
204!-}
206type SCGEntry = (Name, [Maybe (Int, SizeChange)])
207type UsageReason = (Name, Int) -- fn_name, its_arg_number
209data CGInfo = CGInfo { argsdef :: [Name],
210 calls :: [(Name, [[Name]])],
211 scg :: [SCGEntry],
212 argsused :: [Name],
213 usedpos :: [(Int, [UsageReason])] }
214 deriving Show
215{-!
216deriving instance Binary CGInfo
217deriving instance NFData CGInfo
218!-}
220primDefs = [sUN "unsafePerformPrimIO",
221 sUN "mkLazyForeignPrim",
222 sUN "mkForeignPrim",
223 sUN "FalseElim"]
225-- information that needs writing for the current module's .ibc file
226data IBCWrite = IBCFix FixDecl
227 | IBCImp Name
228 | IBCStatic Name
229 | IBCClass Name
230 | IBCInstance Bool Name Name
231 | IBCDSL Name
232 | IBCData Name
233 | IBCOpt Name
234 | IBCMetavar Name
235 | IBCSyntax Syntax
236 | IBCKeyword String
237 | IBCImport FilePath
238 | IBCObj Codegen FilePath
239 | IBCLib Codegen String
240 | IBCCGFlag Codegen String
241 | IBCDyLib String
242 | IBCHeader Codegen String
243 | IBCAccess Name Accessibility
244 | IBCMetaInformation Name MetaInformation
245 | IBCTotal Name Totality
246 | IBCFlags Name [FnOpt]
247 | IBCTrans (Term, Term)
248 | IBCErrRev (Term, Term)
249 | IBCCG Name
250 | IBCDoc Name
251 | IBCCoercion Name
252 | IBCDef Name -- i.e. main context
253 | IBCNameHint (Name, Name)
254 | IBCLineApp FilePath Int PTerm
255 | IBCErrorHandler Name
256 | IBCFunctionErrorHandler Name Name Name
257 | IBCPostulate Name
258 | IBCTotCheckErr FC String
259 | IBCParsedRegion FC
260 deriving Show
262-- | The initial state for the compiler
263idrisInit :: IState
264idrisInit = IState initContext [] [] emptyContext emptyContext emptyContext
265 emptyContext emptyContext emptyContext emptyContext
266 emptyContext emptyContext emptyContext emptyContext
267 emptyContext emptyContext
268 [] [] [] defaultOpts 6 [] [] [] [] [] [] [] [] [] [] [] [] []
269 [] [] Nothing [] Nothing [] [] Nothing Nothing [] Hidden False [] Nothing [] [] RawOutput
270 True defaultTheme stdout [] (0, emptyContext) emptyContext M.empty
271 AutomaticWidth S.empty Nothing Nothing
273-- | The monad for the main REPL - reading and processing files and updating
274-- global state (hence the IO inner monad).
275--type Idris = WriterT [Either String (IO ())] (State IState a))
276type Idris = StateT IState (ErrorT Err IO)
278-- Commands in the REPL
280data Codegen = ViaC
281 | ViaJava
282 | ViaNode
283 | ViaJavaScript
284 | ViaLLVM
285 | Bytecode
286 deriving (Show, Eq)
288-- | REPL commands
289data Command = Quit
290 | Help
291 | Eval PTerm
292 | Check PTerm
293 | DocStr (Either Name Const)
294 | TotCheck Name
295 | Reload
296 | Load FilePath (Maybe Int) -- up to maximum line number
297 | ChangeDirectory FilePath
298 | ModImport String
299 | Edit
300 | Compile Codegen String
301 | Execute
302 | ExecVal PTerm
303 | Metavars
304 | Prove Name
305 | AddProof (Maybe Name)
306 | RmProof Name
307 | ShowProof Name
308 | Proofs
309 | Universes
310 | LogLvl Int
311 | Spec PTerm
312 | HNF PTerm
313 | TestInline PTerm
314 | Defn Name
315 | Missing Name
316 | DynamicLink FilePath
317 | ListDynamic
318 | Pattelab PTerm
319 | DebugInfo Name
320 | Search PTerm
321 | CaseSplitAt Bool Int Name
322 | AddClauseFrom Bool Int Name
323 | AddProofClauseFrom Bool Int Name
324 | AddMissing Bool Int Name
325 | MakeWith Bool Int Name
326 | MakeLemma Bool Int Name
327 | DoProofSearch Bool Bool Int Name [Name]
328 -- ^ the first bool is whether to update,
329 -- the second is whether to search recursively (i.e. for the arguments)
330 | SetOpt Opt
331 | UnsetOpt Opt
332 | NOP
333 | SetColour ColourType IdrisColour
334 | ColourOn
335 | ColourOff
336 | ListErrorHandlers
337 | SetConsoleWidth ConsoleWidth
338 | Apropos String
339 | WhoCalls Name
340 | CallsWho Name
341 | MakeDoc String -- IdrisDoc
342 | Warranty
344data Opt = Filename String
345 | Quiet
346 | NoBanner
347 | ColourREPL Bool
348 | Ideslave
349 | ShowLibs
350 | ShowLibdir
351 | ShowIncs
352 | NoBasePkgs
353 | NoPrelude
354 | NoBuiltins -- only for the really primitive stuff!
355 | NoREPL
356 | OLogging Int
357 | Output String
358 | TypeCase
359 | TypeInType
360 | DefaultTotal
361 | DefaultPartial
362 | WarnPartial
363 | WarnReach
364 | NoCoverage
365 | ErrContext
366 | ShowImpl
367 | Verbose
368 | IBCSubDir String
369 | ImportDir String
370 | PkgBuild String
371 | PkgInstall String
372 | PkgClean String
373 | PkgCheck String
374 | PkgREPL String
375 | PkgMkDoc String -- IdrisDoc
376 | PkgTest String
377 | WarnOnly
378 | Pkg String
379 | BCAsm String
380 | DumpDefun String
381 | DumpCases String
382 | UseCodegen Codegen
383 | OutputTy OutputType
384 | Extension LanguageExt
385 | InterpretScript String
386 | EvalExpr String
387 | TargetTriple String
388 | TargetCPU String
389 | OptLevel Word
390 | Client String
391 | ShowOrigErr
392 | AutoWidth -- ^ Automatically adjust terminal width
393 | AutoSolve -- ^ Automatically issue "solve" tactic in interactive prover
394 deriving (Show, Eq)
396-- Parsed declarations
398data Fixity = Infixl { prec :: Int }
399 | Infixr { prec :: Int }
400 | InfixN { prec :: Int }
401 | PrefixN { prec :: Int }
402 deriving Eq
403{-!
404deriving instance Binary Fixity
405deriving instance NFData Fixity
406!-}
408instance Show Fixity where
409 show (Infixl i) = "infixl " ++ show i
410 show (Infixr i) = "infixr " ++ show i
411 show (InfixN i) = "infix " ++ show i
412 show (PrefixN i) = "prefix " ++ show i
414data FixDecl = Fix Fixity String
415 deriving Eq
417instance Show FixDecl where
418 show (Fix f s) = show f ++ " " ++ s
420{-!
421deriving instance Binary FixDecl
422deriving instance NFData FixDecl
423!-}
425instance Ord FixDecl where
426 compare (Fix x _) (Fix y _) = compare (prec x) (prec y)
429data Static = Static | Dynamic
430 deriving (Show, Eq)
431{-!
432deriving instance Binary Static
433deriving instance NFData Static
434!-}
436-- Mark bindings with their explicitness, and laziness
437data Plicity = Imp { pargopts :: [ArgOpt],
438 pstatic :: Static,
439 pparam :: Bool }
440 | Exp { pargopts :: [ArgOpt],
441 pstatic :: Static,
442 pparam :: Bool } -- this is a param (rather than index)
443 | Constraint { pargopts :: [ArgOpt],
444 pstatic :: Static }
445 | TacImp { pargopts :: [ArgOpt],
446 pstatic :: Static,
447 pscript :: PTerm }
448 deriving (Show, Eq)
450{-!
451deriving instance Binary Plicity
452deriving instance NFData Plicity
453!-}
455impl = Imp [] Dynamic False
456expl = Exp [] Dynamic False
457expl_param = Exp [] Dynamic True
458constraint = Constraint [] Dynamic
459tacimpl t = TacImp [] Dynamic t
461data FnOpt = Inlinable -- always evaluate when simplifying
462 | TotalFn | PartialFn | CoveringFn
463 | Coinductive | AssertTotal
464 | Dictionary -- type class dictionary, eval only when
465 -- a function argument, and further evaluation resutls
466 | Implicit -- implicit coercion
467 | CExport String -- export, with a C name
468 | ErrorHandler -- ^^ an error handler for use with the ErrorReflection extension
469 | ErrorReverse -- ^^ attempt to reverse normalise before showing in error
470 | Reflection -- a reflecting function, compile-time only
471 | Specialise [(Name, Maybe Int)] -- specialise it, freeze these names
472 deriving (Show, Eq)
473{-!
474deriving instance Binary FnOpt
475deriving instance NFData FnOpt
476!-}
478type FnOpts = [FnOpt]
480inlinable :: FnOpts -> Bool
481inlinable = elem Inlinable
483dictionary :: FnOpts -> Bool
484dictionary = elem Dictionary
487-- | Data declaration options
488data DataOpt = Codata -- ^ Set if the the data-type is coinductive
489 | DefaultEliminator -- ^ Set if an eliminator should be generated for data type
490 | DefaultCaseFun -- ^ Set if a case function should be generated for data type
491 | DataErrRev
492 deriving (Show, Eq)
494type DataOpts = [DataOpt]
496-- | Type provider - what to provide
497data ProvideWhat' t = ProvTerm t t -- ^ the first is the goal type, the second is the term
498 | ProvPostulate t -- ^ goal type must be Type, so only term
499 deriving (Show, Eq, Functor)
501type ProvideWhat = ProvideWhat' PTerm
503-- | Top-level declarations such as compiler directives, definitions,
504-- datatypes and typeclasses.
505data PDecl' t
506 = PFix FC Fixity [String] -- ^ Fixity declaration
507 | PTy Docstring [(Name, Docstring)] SyntaxInfo FC FnOpts Name t -- ^ Type declaration
508 | PPostulate Docstring SyntaxInfo FC FnOpts Name t -- ^ Postulate
509 | PClauses FC FnOpts Name [PClause' t] -- ^ Pattern clause
510 | PCAF FC Name t -- ^ Top level constant
511 | PData Docstring [(Name, Docstring)] SyntaxInfo FC DataOpts (PData' t) -- ^ Data declaration.
512 | PParams FC [(Name, t)] [PDecl' t] -- ^ Params block
513 | PNamespace String [PDecl' t] -- ^ New namespace
514 | PRecord Docstring SyntaxInfo FC Name t DataOpts Docstring Name t -- ^ Record declaration
515 | PClass Docstring SyntaxInfo FC
516 [t] -- constraints
517 Name
518 [(Name, t)] -- parameters
519 [(Name, Docstring)] -- parameter docstrings
520 [PDecl' t] -- declarations
521 -- ^ Type class: arguments are documentation, syntax info, source location, constraints,
522 -- class name, parameters, method declarations
523 | PInstance SyntaxInfo FC [t] -- constraints
524 Name -- class
525 [t] -- parameters
526 t -- full instance type
527 (Maybe Name) -- explicit name
528 [PDecl' t]
529 -- ^ Instance declaration: arguments are syntax info, source location, constraints,
530 -- class name, parameters, full instance type, optional explicit name, and definitions
531 | PDSL Name (DSL' t) -- ^ DSL declaration
532 | PSyntax FC Syntax -- ^ Syntax definition
533 | PMutual FC [PDecl' t] -- ^ Mutual block
534 | PDirective (Idris ()) -- ^ Compiler directive. The parser inserts the corresponding action in the Idris monad.
535 | PProvider SyntaxInfo FC (ProvideWhat' t) Name -- ^ Type provider. The first t is the type, the second is the term
536 | PTransform FC Bool t t -- ^ Source-to-source transformation rule. If
537 -- bool is True, lhs and rhs must be convertible
538 deriving Functor
539{-!
540deriving instance Binary PDecl'
541deriving instance NFData PDecl'
542!-}
544-- For elaborator state
545type ElabD a = Elab' [PDecl] a
547-- | One clause of a top-level definition. Term arguments to constructors are:
548--
549-- 1. The whole application (missing for PClauseR and PWithR because they're within a "with" clause)
550--
551-- 2. The list of extra 'with' patterns
552--
553-- 3. The right-hand side
554--
555-- 4. The where block (PDecl' t)
557data PClause' t = PClause FC Name t [t] t [PDecl' t] -- ^ A normal top-level definition.
558 | PWith FC Name t [t] t [PDecl' t]
559 | PClauseR FC [t] t [PDecl' t]
560 | PWithR FC [t] t [PDecl' t]
561 deriving Functor
562{-!
563deriving instance Binary PClause'
564deriving instance NFData PClause'
565!-}
567-- | Data declaration
568data PData' t = PDatadecl { d_name :: Name, -- ^ The name of the datatype
569 d_tcon :: t, -- ^ Type constructor
570 d_cons :: [(Docstring, [(Name, Docstring)], Name, t, FC, [Name])] -- ^ Constructors
571 }
572 -- ^ Data declaration
573 | PLaterdecl { d_name :: Name, d_tcon :: t }
574 -- ^ "Placeholder" for data whose constructors are defined later
575 deriving Functor
576{-!
577deriving instance Binary PData'
578deriving instance NFData PData'
579!-}
581-- Handy to get a free function for applying PTerm -> PTerm functions
582-- across a program, by deriving Functor
584type PDecl = PDecl' PTerm
585type PData = PData' PTerm
586type PClause = PClause' PTerm
588-- get all the names declared in a decl
590declared :: PDecl -> [Name]
591declared (PFix _ _ _) = []
592declared (PTy _ _ _ _ _ n t) = [n]
593declared (PPostulate _ _ _ _ n t) = [n]
594declared (PClauses _ _ n _) = [] -- not a declaration
595declared (PCAF _ n _) = [n]
596declared (PData _ _ _ _ _ (PDatadecl n _ ts)) = n : map fstt ts
597 where fstt (_, _, a, _, _, _) = a
598declared (PData _ _ _ _ _ (PLaterdecl n _)) = [n]
599declared (PParams _ _ ds) = concatMap declared ds
600declared (PNamespace _ ds) = concatMap declared ds
601declared (PRecord _ _ _ n _ _ _ c _) = [n, c]
602declared (PClass _ _ _ _ n _ _ ms) = n : concatMap declared ms
603declared (PInstance _ _ _ _ _ _ _ _) = []
604declared (PDSL n _) = [n]
605declared (PSyntax _ _) = []
606declared (PMutual _ ds) = concatMap declared ds
607declared (PDirective _) = []
609-- get the names declared, not counting nested parameter blocks
610tldeclared :: PDecl -> [Name]
611tldeclared (PFix _ _ _) = []
612tldeclared (PTy _ _ _ _ _ n t) = [n]
613tldeclared (PPostulate _ _ _ _ n t) = [n]
614tldeclared (PClauses _ _ n _) = [] -- not a declaration
615tldeclared (PRecord _ _ _ n _ _ _ c _) = [n, c]
616tldeclared (PData _ _ _ _ _ (PDatadecl n _ ts)) = n : map fstt ts
617 where fstt (_, _, a, _, _, _) = a
618tldeclared (PParams _ _ ds) = []
619tldeclared (PMutual _ ds) = concatMap tldeclared ds
620tldeclared (PNamespace _ ds) = concatMap tldeclared ds
621tldeclared (PClass _ _ _ _ n _ _ ms) = concatMap tldeclared ms
622tldeclared (PInstance _ _ _ _ _ _ _ _) = []
623tldeclared _ = []
625defined :: PDecl -> [Name]
626defined (PFix _ _ _) = []
627defined (PTy _ _ _ _ _ n t) = []
628defined (PPostulate _ _ _ _ n t) = []
629defined (PClauses _ _ n _) = [n] -- not a declaration
630defined (PCAF _ n _) = [n]
631defined (PData _ _ _ _ _ (PDatadecl n _ ts)) = n : map fstt ts
632 where fstt (_, _, a, _, _, _) = a
633defined (PData _ _ _ _ _ (PLaterdecl n _)) = []
634defined (PParams _ _ ds) = concatMap defined ds
635defined (PNamespace _ ds) = concatMap defined ds
636defined (PRecord _ _ _ n _ _ _ c _) = [n, c]
637defined (PClass _ _ _ _ n _ _ ms) = n : concatMap defined ms
638defined (PInstance _ _ _ _ _ _ _ _) = []
639defined (PDSL n _) = [n]
640defined (PSyntax _ _) = []
641defined (PMutual _ ds) = concatMap defined ds
642defined (PDirective _) = []
643--defined _ = []
645updateN :: [(Name, Name)] -> Name -> Name
646updateN ns n | Just n' <- lookup n ns = n'
647updateN _ n = n
649updateNs :: [(Name, Name)] -> PTerm -> PTerm
650updateNs [] t = t
651updateNs ns t = mapPT updateRef t
652 where updateRef (PRef fc f) = PRef fc (updateN ns f)
653 updateRef t = t
655-- updateDNs :: [(Name, Name)] -> PDecl -> PDecl
656-- updateDNs [] t = t
657-- updateDNs ns (PTy s f n t) | Just n' <- lookup n ns = PTy s f n' t
658-- updateDNs ns (PClauses f n c) | Just n' <- lookup n ns = PClauses f n' (map updateCNs c)
659-- where updateCNs ns (PClause n l ts r ds)
660-- = PClause (updateN ns n) (fmap (updateNs ns) l)
661-- (map (fmap (updateNs ns)) ts)
662-- (fmap (updateNs ns) r)
663-- (map (updateDNs ns) ds)
664-- updateDNs ns c = c
666data PunInfo = IsType | IsTerm | TypeOrTerm deriving (Eq, Show)
668-- | High level language terms
669data PTerm = PQuote Raw
670 | PRef FC Name
671 | PInferRef FC Name -- ^ A name to be defined later
672 | PPatvar FC Name
673 | PLam Name PTerm PTerm
674 | PPi Plicity Name PTerm PTerm -- ^ (n : t1) -> t2
675 | PLet Name PTerm PTerm PTerm
676 | PTyped PTerm PTerm -- ^ Term with explicit type
677 | PApp FC PTerm [PArg] -- ^ e.g. IO (), List Char, length x
678 | PAppBind FC PTerm [PArg] -- ^ implicitly bound application
679 | PMatchApp FC Name -- ^ Make an application by type matching
680 | PCase FC PTerm [(PTerm, PTerm)]
681 | PTrue FC PunInfo -- ^ Unit type..?
682 | PFalse FC -- ^ _|_
683 | PRefl FC PTerm
684 | PResolveTC FC
685 | PEq FC PTerm PTerm -- ^ Equality type: A = B
686 | PRewrite FC PTerm PTerm (Maybe PTerm)
687 | PPair FC PunInfo PTerm PTerm
688 | PDPair FC PunInfo PTerm PTerm PTerm
689 | PAlternative Bool [PTerm] -- True if only one may work
690 | PHidden PTerm -- ^ Irrelevant or hidden pattern
691 | PType -- ^ 'Type' type
692 | PGoal FC PTerm Name PTerm
693 | PConstant Const -- ^ Builtin types
694 | Placeholder
695 | PDoBlock [PDo]
696 | PIdiom FC PTerm
697 | PReturn FC
698 | PMetavar Name
699 | PProof [PTactic] -- ^ Proof script
700 | PTactics [PTactic] -- ^ As PProof, but no auto solving
701 | PElabError Err -- ^ Error to report on elaboration
702 | PImpossible -- ^ Special case for declaring when an LHS can't typecheck
703 | PCoerced PTerm -- ^ To mark a coerced argument, so as not to coerce twice
704 | PDisamb [[T.Text]] PTerm -- ^ Preferences for explicit namespaces
705 | PUnifyLog PTerm -- ^ dump a trace of unifications when building term
706 | PNoImplicits PTerm -- ^ never run implicit converions on the term
707 deriving Eq
710{-!
711deriving instance Binary PTerm
712deriving instance NFData PTerm
713!-}
715mapPT :: (PTerm -> PTerm) -> PTerm -> PTerm
716mapPT f t = f (mpt t) where
717 mpt (PLam n t s) = PLam n (mapPT f t) (mapPT f s)
718 mpt (PPi p n t s) = PPi p n (mapPT f t) (mapPT f s)
719 mpt (PLet n ty v s) = PLet n (mapPT f ty) (mapPT f v) (mapPT f s)
720 mpt (PRewrite fc t s g) = PRewrite fc (mapPT f t) (mapPT f s)
721 (fmap (mapPT f) g)
722 mpt (PApp fc t as) = PApp fc (mapPT f t) (map (fmap (mapPT f)) as)
723 mpt (PAppBind fc t as) = PAppBind fc (mapPT f t) (map (fmap (mapPT f)) as)
724 mpt (PCase fc c os) = PCase fc (mapPT f c) (map (pmap (mapPT f)) os)
725 mpt (PEq fc l r) = PEq fc (mapPT f l) (mapPT f r)
726 mpt (PTyped l r) = PTyped (mapPT f l) (mapPT f r)
727 mpt (PPair fc p l r) = PPair fc p (mapPT f l) (mapPT f r)
728 mpt (PDPair fc p l t r) = PDPair fc p (mapPT f l) (mapPT f t) (mapPT f r)
729 mpt (PAlternative a as) = PAlternative a (map (mapPT f) as)
730 mpt (PHidden t) = PHidden (mapPT f t)
731 mpt (PDoBlock ds) = PDoBlock (map (fmap (mapPT f)) ds)
732 mpt (PProof ts) = PProof (map (fmap (mapPT f)) ts)
733 mpt (PTactics ts) = PTactics (map (fmap (mapPT f)) ts)
734 mpt (PUnifyLog tm) = PUnifyLog (mapPT f tm)
735 mpt (PDisamb ns tm) = PDisamb ns (mapPT f tm)
736 mpt (PNoImplicits tm) = PNoImplicits (mapPT f tm)
737 mpt (PGoal fc r n sc) = PGoal fc (mapPT f r) n (mapPT f sc)
738 mpt x = x
741data PTactic' t = Intro [Name] | Intros | Focus Name
742 | Refine Name [Bool] | Rewrite t | DoUnify
743 | Induction t
744 | CaseTac t
745 | Equiv t
746 | MatchRefine Name
747 | LetTac Name t | LetTacTy Name t t
748 | Exact t | Compute | Trivial | TCInstance
749 | ProofSearch Bool Bool Int (Maybe Name) [Name]
750 -- ^ the bool is whether to search recursively
751 | Solve
752 | Attack
753 | ProofState | ProofTerm | Undo
754 | Try (PTactic' t) (PTactic' t)
755 | TSeq (PTactic' t) (PTactic' t)
756 | ApplyTactic t -- see Language.Reflection module
757 | ByReflection t
758 | Reflect t
759 | Fill t
760 | GoalType String (PTactic' t)
761 | TCheck t
762 | TEval t
763 | Qed | Abandon
764 deriving (Show, Eq, Functor)
765{-!
766deriving instance Binary PTactic'
767deriving instance NFData PTactic'
768!-}
769instance Sized a => Sized (PTactic' a) where
770 size (Intro nms) = 1 + size nms
771 size Intros = 1
772 size (Focus nm) = 1 + size nm
773 size (Refine nm bs) = 1 + size nm + length bs
774 size (Rewrite t) = 1 + size t
775 size (Induction t) = 1 + size t
776 size (LetTac nm t) = 1 + size nm + size t
777 size (Exact t) = 1 + size t
778 size Compute = 1
779 size Trivial = 1
780 size Solve = 1
781 size Attack = 1
782 size ProofState = 1
783 size ProofTerm = 1
784 size Undo = 1
785 size (Try l r) = 1 + size l + size r
786 size (TSeq l r) = 1 + size l + size r
787 size (ApplyTactic t) = 1 + size t
788 size (Reflect t) = 1 + size t
789 size (Fill t) = 1 + size t
790 size Qed = 1
791 size Abandon = 1
793type PTactic = PTactic' PTerm
795data PDo' t = DoExp FC t
796 | DoBind FC Name t
797 | DoBindP FC t t [(t,t)]
798 | DoLet FC Name t t
799 | DoLetP FC t t
800 deriving (Eq, Functor)
801{-!
802deriving instance Binary PDo'
803deriving instance NFData PDo'
804!-}
806instance Sized a => Sized (PDo' a) where
807 size (DoExp fc t) = 1 + size fc + size t
808 size (DoBind fc nm t) = 1 + size fc + size nm + size t
809 size (DoBindP fc l r alts) = 1 + size fc + size l + size r + size alts
810 size (DoLet fc nm l r) = 1 + size fc + size nm + size l + size r
811 size (DoLetP fc l r) = 1 + size fc + size l + size r
813type PDo = PDo' PTerm
815-- The priority gives a hint as to elaboration order. Best to elaborate
816-- things early which will help give a more concrete type to other
817-- variables, e.g. a before (interpTy a).
819data PArg' t = PImp { priority :: Int,
820 machine_inf :: Bool, -- true if the machine inferred it
821 argopts :: [ArgOpt],
822 pname :: Name, getTm :: t }
823 | PExp { priority :: Int,
824 argopts :: [ArgOpt],
825 pname :: Name,
826 getTm :: t }
827 | PConstraint { priority :: Int,
828 argopts :: [ArgOpt],
829 pname :: Name,
830 getTm :: t }
831 | PTacImplicit { priority :: Int,
832 argopts :: [ArgOpt],
833 pname :: Name,
834 getScript :: t,
835 getTm :: t }
836 deriving (Show, Eq, Functor)
838data ArgOpt = HideDisplay | InaccessibleArg
839 deriving (Show, Eq)
841instance Sized a => Sized (PArg' a) where
842 size (PImp p _ l nm trm) = 1 + size nm + size trm
843 size (PExp p l nm trm) = 1 + size nm + size trm
844 size (PConstraint p l nm trm) = 1 + size nm +size nm + size trm
845 size (PTacImplicit p l nm scr trm) = 1 + size nm + size scr + size trm
847{-!
848deriving instance Binary PArg'
849deriving instance NFData PArg'
850!-}
852pimp n t mach = PImp 1 mach [] n t
853pexp t = PExp 1 [] (sMN 0 "arg") t
854pconst t = PConstraint 1 [] (sMN 0 "carg") t
855ptacimp n s t = PTacImplicit 2 [] n s t
857type PArg = PArg' PTerm
859-- Type class data
861data ClassInfo = CI { instanceName :: Name,
862 class_methods :: [(Name, (FnOpts, PTerm))],
863 class_defaults :: [(Name, (Name, PDecl))], -- method name -> default impl
864 class_default_superclasses :: [PDecl],
865 class_params :: [Name],
866 class_instances :: [Name] }
867 deriving Show
868{-!
869deriving instance Binary ClassInfo
870deriving instance NFData ClassInfo
871!-}
873-- Type inference data
875data TIData = TIPartial -- ^ a function with a partially defined type
876 | TISolution [Term] -- ^ possible solutions to a metavariable in a type
877 deriving Show
879data OptInfo = Optimise { inaccessible :: [(Int,Name)], -- includes names for error reporting
880 detaggable :: Bool }
881 deriving Show
882{-!
883deriving instance Binary OptInfo
884deriving instance NFData OptInfo
885!-}
888data TypeInfo = TI { con_names :: [Name],
889 codata :: Bool,
890 data_opts :: DataOpts,
891 param_pos :: [Int],
892 mutual_types :: [Name] }
893 deriving Show
894{-!
895deriving instance Binary TypeInfo
896deriving instance NFData TypeInfo
897!-}
899-- Syntactic sugar info
901data DSL' t = DSL { dsl_bind :: t,
902 dsl_return :: t,
903 dsl_apply :: t,
904 dsl_pure :: t,
905 dsl_var :: Maybe t,
906 index_first :: Maybe t,
907 index_next :: Maybe t,
908 dsl_lambda :: Maybe t,
909 dsl_let :: Maybe t,
910 dsl_pi :: Maybe t
911 }
912 deriving (Show, Functor)
913{-!
914deriving instance Binary DSL'
915deriving instance NFData DSL'
916!-}
918type DSL = DSL' PTerm
920data SynContext = PatternSyntax | TermSyntax | AnySyntax
921 deriving Show
922{-!
923deriving instance Binary SynContext
924deriving instance NFData SynContext
925!-}
927data Syntax = Rule [SSymbol] PTerm SynContext
928 deriving Show
929{-!
930deriving instance Binary Syntax
931deriving instance NFData Syntax
932!-}
934data SSymbol = Keyword Name
935 | Symbol String
936 | Binding Name
937 | Expr Name
938 | SimpleExpr Name
939 deriving Show
940{-!
941deriving instance Binary SSymbol
942deriving instance NFData SSymbol
943!-}
945initDSL = DSL (PRef f (sUN ">>="))
946 (PRef f (sUN "return"))
947 (PRef f (sUN "<$>"))
948 (PRef f (sUN "pure"))
949 Nothing
950 Nothing
951 Nothing
952 Nothing
953 Nothing
954 Nothing
955 where f = fileFC "(builtin)"
957data Using = UImplicit Name PTerm
958 | UConstraint Name [Name]
959 deriving (Show, Eq)
960{-!
961deriving instance Binary Using
962deriving instance NFData Using
963!-}
965data SyntaxInfo = Syn { using :: [Using],
966 syn_params :: [(Name, PTerm)],
967 syn_namespace :: [String],
968 no_imp :: [Name],
969 decoration :: Name -> Name,
970 inPattern :: Bool,
971 implicitAllowed :: Bool,
972 maxline :: Maybe Int,
973 mut_nesting :: Int,
974 dsl_info :: DSL }
975 deriving Show
976{-!
977deriving instance NFData SyntaxInfo
978deriving instance Binary SyntaxInfo
979!-}
981defaultSyntax = Syn [] [] [] [] id False False Nothing 0 initDSL
983expandNS :: SyntaxInfo -> Name -> Name
984expandNS syn n@(NS _ _) = n
985expandNS syn n = case syn_namespace syn of
986 [] -> n
987 xs -> sNS n xs
990-- For inferring types of things
992bi = fileFC "builtin"
994inferTy = sMN 0 "__Infer"
995inferCon = sMN 0 "__infer"
996inferDecl = PDatadecl inferTy
997 PType
998 [(emptyDocstring, [], inferCon, PPi impl (sMN 0 "iType") PType (
999 PPi expl (sMN 0 "ival") (PRef bi (sMN 0 "iType"))
1000 (PRef bi inferTy)), bi, [])]
1001inferOpts = []
1003infTerm t = PApp bi (PRef bi inferCon) [pimp (sMN 0 "iType") Placeholder True, pexp t]
1004infP = P (TCon 6 0) inferTy (TType (UVal 0))
1006getInferTerm, getInferType :: Term -> Term
1007getInferTerm (Bind n b sc) = Bind n b $ getInferTerm sc
1008getInferTerm (App (App _ _) tm) = tm
1009getInferTerm tm = tm -- error ("getInferTerm " ++ show tm)
1011getInferType (Bind n b sc) = Bind n (toTy b) $ getInferType sc
1012 where toTy (Lam t) = Pi t
1013 toTy (PVar t) = PVTy t
1014 toTy b = b
1015getInferType (App (App _ ty) _) = ty
1019-- Handy primitives: Unit, False, Pair, MkPair, =, mkForeign, Elim type class
1021primNames = [unitTy, unitCon,
1022 falseTy, pairTy, pairCon,
1023 eqTy, eqCon, inferTy, inferCon]
1025unitDoc = parseDocstring . T.pack $ "The canonical single-element type, also known as the trivially true proposition."
1026unitTy = sMN 0 "__Unit"
1027unitCon = sMN 0 "__II"
1028unitDecl = PDatadecl unitTy PType
1029 [(parseDocstring . T.pack $ "The trivial constructor for `()`. ", [], unitCon, PRef bi unitTy, bi, [])]
1030unitOpts = [DefaultEliminator]
1032falseDoc = parseDocstring . T.pack $
1033 "The empty type, also known as the trivially false proposition." ++
1034 "\n\n" ++
1035 "Use `FalseElim` or `absurd` to prove anything if you have a variable " ++
1036 "of type `_|_` in scope."
1037falseTy = sMN 0 "__False"
1038falseDecl = PDatadecl falseTy PType []
1039falseOpts = []
1041pairDoc = parseDocstring . T.pack $ "The non-dependent pair type, also known as conjunction."
1042pairTy = sMN 0 "__Pair"
1043pairCon = sMN 0 "__MkPair"
1044pairDecl = PDatadecl pairTy (piBind [(n "A", PType), (n "B", PType)] PType)
1045 [(pairConDoc, pairConParamDoc,
1046 pairCon, PPi impl (n "A") PType (
1047 PPi impl (n "B") PType (
1048 PPi expl (n "a") (PRef bi (n "A")) (
1049 PPi expl (n "b") (PRef bi (n "B"))
1050 (PApp bi (PRef bi pairTy) [pexp (PRef bi (n "A")),
1051 pexp (PRef bi (n "B"))])))), bi, [])]
1052 where n a = sMN 0 a
1053 pairConDoc = parseDocstring . T.pack $ "A pair of elements"
1054 pairConParamDoc = [(n "a", parseDocstring . T.pack $ "the left element of the pair"),
1055 (n "b", parseDocstring . T.pack $ "the right element of the pair")]
1056pairOpts = []
1057pairParamDoc = [(n "A", parseDocstring . T.pack $ "the type of the left elements in the pair"),
1058 (n "B", parseDocstring . T.pack $ "the type of the left elements in the pair")]
1059 where n a = sMN 0 a
1061eqTy = sUN "="
1062eqCon = sUN "refl"
1063eqDoc = parseDocstring . T.pack $
1064 "The propositional equality type. A proof that `x` = `y`." ++
1065 "\n\n" ++
1066 "To use such a proof, pattern-match on it, and the two equal things will " ++
1067 "then need to be the _same_ pattern." ++
1068 "\n\n" ++
1069 "**Note**: Idris's equality type is _heterogeneous_, which means that it " ++
1070 "is possible to state equalities between values of potentially different " ++
1071 "types. This is sometimes referred to in the literature as \"John Major\" " ++
1072 "equality." ++
1073 "\n\n" ++
1074 "Thus, if Idris can't infer the type of one side of the equality, then " ++
1075 "you may need to annotate it. See the function `the`."
1077eqDecl = PDatadecl eqTy (piBind [(n "A", PType), (n "B", PType),
1078 (n "x", PRef bi (n "A")), (n "y", PRef bi (n "B"))]
1079 PType)
1080 [(reflDoc, reflParamDoc,
1081 eqCon, PPi impl (n "A") PType (
1082 PPi impl (n "x") (PRef bi (n "A"))
1083 (PApp bi (PRef bi eqTy) [pimp (n "A") Placeholder False,
1084 pimp (n "B") Placeholder False,
1085 pexp (PRef bi (n "x")),
1086 pexp (PRef bi (n "x"))])), bi, [])]
1087 where n a = sMN 0 a
1088 reflDoc = parseDocstring . T.pack $
1089 "A proof that `x` in fact equals `x`. To construct this, you must have already " ++
1090 "shown that both sides are in fact equal."
1091 reflParamDoc = [(n "A", parseDocstring . T.pack $ "the type at which the equality is proven"),
1092 (n "x", parseDocstring . T.pack $ "the element shown to be equal to itself.")]
1094eqParamDoc = [(n "A", parseDocstring . T.pack $ "the type of the left side of the equality"),
1095 (n "B", parseDocstring . T.pack $ "the type of the right side of the equality")
1097 where n a = sMN 0 a
1099eqOpts = []
1101elimName = sUN "__Elim"
1102elimMethElimTy = sUN "__elimTy"
1103elimMethElim = sUN "elim"
1104elimDecl = PClass (parseDocstring . T.pack $ "Type class for eliminators") defaultSyntax bi [] elimName [(sUN "scrutineeType", PType)] []
1105 [PTy emptyDocstring [] defaultSyntax bi [TotalFn] elimMethElimTy PType,
1106 PTy emptyDocstring [] defaultSyntax bi [TotalFn] elimMethElim (PRef bi elimMethElimTy)]
1108-- Defined in builtins.idr
1109sigmaTy = sUN "Sigma"
1110existsCon = sUN "Sg_intro"
1112piBind :: [(Name, PTerm)] -> PTerm -> PTerm
1113piBind = piBindp expl
1115piBindp :: Plicity -> [(Name, PTerm)] -> PTerm -> PTerm
1116piBindp p [] t = t
1117piBindp p ((n, ty):ns) t = PPi p n ty (piBindp p ns t)
1120-- Pretty-printing declarations and terms
1122-- These "show" instances render to an absurdly wide screen because inserted line breaks
1123-- could interfere with interactive editing, which calls "show".
1125instance Show PTerm where
1126 showsPrec _ tm = (displayS . renderPretty 1.0 10000000 . prettyImp defaultPPOption) tm
1128instance Show PDecl where
1129 showsPrec _ d = (displayS . renderPretty 1.0 10000000 . showDeclImp defaultPPOption) d
1131instance Show PClause where
1132 showsPrec _ c = (displayS . renderPretty 1.0 10000000 . showCImp verbosePPOption) c
1134instance Show PData where
1135 showsPrec _ d = (displayS . renderPretty 1.0 10000000 . showDImp defaultPPOption) d
1137instance Pretty PTerm OutputAnnotation where
1138 pretty = prettyImp defaultPPOption
1140-- | Colourise annotations according to an Idris state. It ignores the names
1141-- in the annotation, as there's no good way to show extended information on a
1142-- terminal.
1143consoleDecorate :: IState -> OutputAnnotation -> String -> String
1144consoleDecorate ist _ | not (idris_colourRepl ist) = id
1145consoleDecorate ist (AnnConst c) = let theme = idris_colourTheme ist
1146 in if constIsType c
1147 then colouriseType theme
1148 else colouriseData theme
1149consoleDecorate ist (AnnData _ _) = colouriseData (idris_colourTheme ist)
1150consoleDecorate ist (AnnType _ _) = colouriseType (idris_colourTheme ist)
1151consoleDecorate ist (AnnBoundName _ True) = colouriseImplicit (idris_colourTheme ist)
1152consoleDecorate ist (AnnBoundName _ False) = colouriseBound (idris_colourTheme ist)
1153consoleDecorate ist AnnKeyword = colouriseKeyword (idris_colourTheme ist)
1154consoleDecorate ist (AnnName n _ _ _) = let ctxt = tt_ctxt ist
1155 theme = idris_colourTheme ist
1156 in case () of
1157 _ | isDConName n ctxt -> colouriseData theme
1158 _ | isFnName n ctxt -> colouriseFun theme
1159 _ | isTConName n ctxt -> colouriseType theme
1160 _ | isPostulateName n ist -> colourisePostulate theme
1161 _ | otherwise -> id -- don't colourise unknown names
1162consoleDecorate ist (AnnFC _) = id
1163consoleDecorate ist (AnnTextFmt fmt) = Idris.Colours.colourise (colour fmt)
1164 where colour BoldText = IdrisColour Nothing True False True False
1165 colour UnderlineText = IdrisColour Nothing True True False False
1166 colour ItalicText = IdrisColour Nothing True False False True
1168isPostulateName :: Name -> IState -> Bool
1169isPostulateName n ist = S.member n (idris_postulates ist)
1171-- | Pretty-print a high-level closed Idris term with no information about precedence/associativity
1172prettyImp :: PPOption -- ^^ pretty printing options
1173 -> PTerm -- ^^ the term to pretty-print
1174 -> Doc OutputAnnotation
1175prettyImp impl = pprintPTerm impl [] [] []
1177-- | Do the right thing for rendering a term in an IState
1178prettyIst :: IState -> PTerm -> Doc OutputAnnotation
1179prettyIst ist = pprintPTerm (ppOptionIst ist) [] [] (idris_infixes ist)
1181-- | Pretty-print a high-level Idris term in some bindings context with infix info
1182pprintPTerm :: PPOption -- ^^ pretty printing options
1183 -> [(Name, Bool)] -- ^^ the currently-bound names and whether they are implicit
1184 -> [Name] -- ^^ names to always show in pi, even if not used
1185 -> [FixDecl] -- ^^ Fixity declarations
1186 -> PTerm -- ^^ the term to pretty-print
1187 -> Doc OutputAnnotation
1188pprintPTerm ppo bnd docArgs infixes = prettySe 10 bnd
1189 where
1190 prettySe :: Int -> [(Name, Bool)] -> PTerm -> Doc OutputAnnotation
1191 prettySe p bnd (PQuote r) =
1192 text "![" <> pretty r <> text "]"
1193 prettySe p bnd (PPatvar fc n) = pretty n
1194 prettySe p bnd e
1195 | Just str <- slist p bnd e = str
1196 | Just n <- snat p e = annotate (AnnData "Nat" "") (text (show n))
1197 prettySe p bnd (PRef fc n) = prettyName (ppopt_impl ppo) bnd n
1198 prettySe p bnd (PLam n ty sc) =
1199 bracket p 2 . group . align . hang 2 $
1200 text "\\" <> bindingOf n False <+> text "=>" <$>
1201 prettySe 10 ((n, False):bnd) sc
1202 prettySe p bnd (PLet n ty v sc) =
1203 bracket p 2 $
1204 kwd "let" <+> bindingOf n False <+> text "=" </>
1205 prettySe 10 bnd v <+> kwd "in" </>
1206 prettySe 10 ((n, False):bnd) sc
1207 prettySe p bnd (PPi (Exp l s _) n ty sc)
1208 | n `elem` allNamesIn sc || ppopt_impl ppo || n `elem` docArgs =
1209 bracket p 2 . group $
1210 enclose lparen rparen (group . align $ bindingOf n False <+> colon <+> prettySe 10 bnd ty) <+>
1211 st <> text "->" <$> prettySe 10 ((n, False):bnd) sc
1212 | otherwise =
1213 bracket p 2 . group $
1214 group (prettySe 1 bnd ty <+> st) <> text "->" <$> group (prettySe 10 ((n, False):bnd) sc)
1215 where
1216 st =
1217 case s of
1218 Static -> text "[static]" <> space
1219 _ -> empty
1220 prettySe p bnd (PPi (Imp l s _) n ty sc)
1221 | ppopt_impl ppo =
1222 bracket p 2 $
1223 lbrace <> bindingOf n True <+> colon <+> prettySe 10 bnd ty <> rbrace <+>
1224 st <> text "->" </> prettySe 10 ((n, True):bnd) sc
1225 | otherwise = prettySe 10 ((n, True):bnd) sc
1226 where
1227 st =
1228 case s of
1229 Static -> text "[static]" <> space
1230 _ -> empty
1231 prettySe p bnd (PPi (Constraint _ _) n ty sc) =
1232 bracket p 2 $
1233 prettySe 10 bnd ty <+> text "=>" </> prettySe 10 ((n, True):bnd) sc
1234 prettySe p bnd (PPi (TacImp _ _ s) n ty sc) =
1235 bracket p 2 $
1236 lbrace <> kwd "tacimp" <+> pretty n <+> colon <+> prettySe 10 bnd ty <>
1237 rbrace <+> text "->" </> prettySe 10 ((n, True):bnd) sc
1238 prettySe p bnd (PApp _ (PRef _ f) args) -- normal names, no explicit args
1239 | UN nm <- basename f
1240 , not (ppopt_impl ppo) && null (getExps args) =
1241 if isAlpha (thead nm)
1242 then prettyName (ppopt_impl ppo) bnd f
1243 else enclose lparen rparen $ prettyName (ppopt_impl ppo) bnd f
1244 prettySe p bnd (PAppBind _ (PRef _ f) [])
1245 | not (ppopt_impl ppo) = text "!" <> prettyName (ppopt_impl ppo) bnd f
1246 prettySe p bnd (PApp _ (PRef _ op) args) -- infix operators
1247 | UN nm <- basename op
1248 , not (tnull nm) &&
1249 (not (ppopt_impl ppo)) && (not $ isAlpha (thead nm)) =
1250 case getExps args of
1251 [] -> enclose lparen rparen opName
1252 [x] -> group (enclose lparen rparen opName <$> group (prettySe 0 bnd x))
1253 [l,r] -> let precedence = fromMaybe 20 (fmap prec f)
1254 in bracket p precedence $ inFix l r
1255 (l:r:rest) -> bracket p 1 $
1256 enclose lparen rparen (inFix l r) <+>
1257 align (group (vsep (map (prettyArgSe bnd) rest)))
1258 where opName = prettyName (ppopt_impl ppo) bnd op
1259 f = getFixity (opStr op)
1260 left l = case f of
1261 Nothing -> prettySe (-1) bnd l
1262 Just (Infixl p') -> prettySe p' bnd l
1263 Just f' -> prettySe (prec f'-1) bnd l
1264 right r = case f of
1265 Nothing -> prettySe (-1) bnd r
1266 Just (Infixr p') -> prettySe p' bnd r
1267 Just f' -> prettySe (prec f'-1) bnd r
1268 inFix l r = align . group $
1269 (left l <+> opName) <$> group (right r)
1270 prettySe p bnd (PApp _ hd@(PRef fc f) [tm]) -- symbols, like 'foo
1271 | PConstant (Idris.Core.TT.Str str) <- getTm tm,
1272 f == sUN "Symbol_" = annotate (AnnType ("'" ++ str) ("The symbol " ++ str)) $
1273 char '\'' <> prettySe 10 bnd (PRef fc (sUN str))
1274 prettySe p bnd (PApp _ f as) = -- Normal prefix applications
1275 let args = getExps as
1276 fp = prettySe 1 bnd f
1277 in
1278 bracket p 1 . group $
1279 if ppopt_impl ppo
1280 then if null as
1281 then fp
1282 else fp <+> align (vsep (map (prettyArgS bnd) as))
1283 else if null args
1284 then fp
1285 else fp <+> align (vsep (map (prettyArgSe bnd) args))
1286 prettySe p bnd (PCase _ scr opts) =
1287 kwd "case" <+> prettySe 10 bnd scr <+> kwd "of" <> prettyBody
1288 where
1289 prettyBody = foldr (<>) empty $ intersperse (text "|") $ map sc opts
1291 sc (l, r) = nest nestingSize $ prettySe 10 bnd l <+> text "=>" <+> prettySe 10 bnd r
1292 prettySe p bnd (PHidden tm) = text "." <> prettySe 0 bnd tm
1293 prettySe p bnd (PRefl _ _) = annName eqCon $ text "refl"
1294 prettySe p bnd (PResolveTC _) = text "resolvetc"
1295 prettySe p bnd (PTrue _ IsType) = annName unitTy $ text "()"
1296 prettySe p bnd (PTrue _ IsTerm) = annName unitCon $ text "()"
1297 prettySe p bnd (PTrue _ TypeOrTerm) = text "()"
1298 prettySe p bnd (PFalse _) = annName falseTy $ text "_|_"
1299 prettySe p bnd (PEq _ l r) =
1300 bracket p 2 . align . group $
1301 prettySe 10 bnd l <+> eq <$> group (prettySe 10 bnd r)
1302 where eq = annName eqTy (text "=")
1303 prettySe p bnd (PRewrite _ l r _) =
1304 bracket p 2 $
1305 text "rewrite" <+> prettySe 10 bnd l <+> text "in" <+> prettySe 10 bnd r
1306 prettySe p bnd (PTyped l r) =
1307 lparen <> prettySe 10 bnd l <+> colon <+> prettySe 10 bnd r <> rparen
1308 prettySe p bnd pair@(PPair _ pun _ _) -- flatten tuples to the right, like parser
1309 | Just elts <- pairElts pair = enclose (ann lparen) (ann rparen) .
1310 align . group . vsep . punctuate (ann comma) $
1311 map (prettySe 10 bnd) elts
1312 where ann = case pun of
1313 TypeOrTerm -> id
1314 IsType -> annName pairTy
1315 IsTerm -> annName pairCon
1316 prettySe p bnd (PDPair _ TypeOrTerm l t r) =
1317 lparen <> prettySe 10 bnd l <+> text "**" <+> prettySe 10 bnd r <> rparen
1318 prettySe p bnd (PDPair _ IsType (PRef _ n) t r) =
1319 annName sigmaTy lparen <>
1320 bindingOf n False <+>
1321 annName sigmaTy (text "**") <+>
1322 prettySe 10 ((n, False):bnd) r <>
1323 annName sigmaTy rparen
1324 prettySe p bnd (PDPair _ IsType l t r) =
1325 annName sigmaTy lparen <>
1326 prettySe 10 bnd l <+>
1327 annName sigmaTy (text "**") <+>
1328 prettySe 10 bnd r <>
1329 annName sigmaTy rparen
1330 prettySe p bnd (PDPair _ IsTerm l t r) =
1331 annName existsCon lparen <>
1332 prettySe 10 bnd l <+>
1333 annName existsCon (text "**") <+>
1334 prettySe 10 bnd r <>
1335 annName existsCon rparen
1336 prettySe p bnd (PAlternative a as) =
1337 lparen <> text "|" <> prettyAs <> text "|" <> rparen
1338 where
1339 prettyAs =
1340 foldr (\l -> \r -> l <+> text "," <+> r) empty $ map (prettySe 10 bnd) as
1341 prettySe p bnd PType = annotate (AnnType "Type" "The type of types") $ text "Type"
1342 prettySe p bnd (PConstant c) = annotate (AnnConst c) (text (show c))
1343 -- XXX: add pretty for tactics
1344 prettySe p bnd (PProof ts) =
1345 text "proof" <+> lbrace <> nest nestingSize (text . show $ ts) <> rbrace
1346 prettySe p bnd (PTactics ts) =
1347 text "tactics" <+> lbrace <> nest nestingSize (text . show $ ts) <> rbrace
1348 prettySe p bnd (PMetavar n) = text "?" <> pretty n
1349 prettySe p bnd (PReturn f) = kwd "return"
1350 prettySe p bnd PImpossible = kwd "impossible"
1351 prettySe p bnd Placeholder = text "_"
1352 prettySe p bnd (PDoBlock _) = text "do block pretty not implemented"
1353 prettySe p bnd (PCoerced t) = prettySe p bnd t
1354 prettySe p bnd (PElabError s) = pretty s
1356 prettySe p bnd _ = text "test"
1358 prettyArgS bnd (PImp _ _ _ n tm) = prettyArgSi bnd (n, tm)
1359 prettyArgS bnd (PExp _ _ _ tm) = prettyArgSe bnd tm
1360 prettyArgS bnd (PConstraint _ _ _ tm) = prettyArgSc bnd tm
1361 prettyArgS bnd (PTacImplicit _ _ n _ tm) = prettyArgSti bnd (n, tm)
1363 prettyArgSe bnd arg = prettySe 0 bnd arg
1364 prettyArgSi bnd (n, val) = lbrace <> pretty n <+> text "=" <+> prettySe 10 bnd val <> rbrace
1365 prettyArgSc bnd val = lbrace <> lbrace <> prettySe 10 bnd val <> rbrace <> rbrace
1366 prettyArgSti bnd (n, val) = lbrace <> kwd "auto" <+> pretty n <+> text "=" <+> prettySe 10 bnd val <> rbrace
1368 annName :: Name -> Doc OutputAnnotation -> Doc OutputAnnotation
1369 annName n = annotate (AnnName n Nothing Nothing Nothing)
1371 opStr :: Name -> String
1372 opStr (NS n _) = opStr n
1373 opStr (UN n) = T.unpack n
1375 basename :: Name -> Name
1376 basename (NS n _) = basename n
1377 basename n = n
1379 slist' p bnd (PApp _ (PRef _ nil) _)
1380 | not (ppopt_impl ppo) && nsroot nil == sUN "Nil" = Just []
1381 slist' p bnd (PRef _ nil)
1382 | not (ppopt_impl ppo) && nsroot nil == sUN "Nil" = Just []
1383 slist' p bnd (PApp _ (PRef _ cons) args)
1384 | nsroot cons == sUN "::",
1385 (PExp {getTm=tl}):(PExp {getTm=hd}):imps <- reverse args,
1386 all isImp imps,
1387 Just tl' <- slist' p bnd tl
1388 = Just (hd:tl')
1389 where
1390 isImp (PImp {}) = True
1391 isImp _ = False
1392 slist' _ _ tm = Nothing
1394 slist p bnd e | Just es <- slist' p bnd e = Just $
1395 case es of [] -> annotate (AnnData "" "") $ text "[]"
1396 [x] -> enclose left right . group $
1397 prettySe p bnd x
1398 xs -> (enclose left right .
1399 align . group . vsep .
1400 punctuate comma .
1401 map (prettySe p bnd)) xs
1402 where left = (annotate (AnnData "" "") (text "["))
1403 right = (annotate (AnnData "" "") (text "]"))
1404 comma = (annotate (AnnData "" "") (text ","))
1405 slist _ _ _ = Nothing
1407 pairElts :: PTerm -> Maybe [PTerm]
1408 pairElts (PPair _ _ x y) | Just elts <- pairElts y = Just (x:elts)
1409 | otherwise = Just [x, y]
1410 pairElts _ = Nothing
1412 natns = "Prelude.Nat."
1414 snat p (PRef _ z)
1415 | show z == (natns++"Z") || show z == "Z" = Just 0
1416 snat p (PApp _ s [PExp {getTm=n}])
1417 | show s == (natns++"S") || show s == "S",
1418 Just n' <- snat p n
1419 = Just $ 1 + n'
1420 snat _ _ = Nothing
1422 bracket outer inner doc
1423 | inner > outer = lparen <> doc <> rparen
1424 | otherwise = doc
1426 kwd = annotate AnnKeyword . text
1428 fixities :: M.Map String Fixity
1429 fixities = M.fromList [(s, f) | (Fix f s) <- infixes]
1431 getFixity :: String -> Maybe Fixity
1432 getFixity = flip M.lookup fixities
1434prettyDocumentedIst :: IState -> (Name, PTerm, Maybe Docstring) -> Doc OutputAnnotation
1435prettyDocumentedIst ist (name, ty, docs) =
1436 prettyName True [] name <+> colon <+> align (prettyIst ist ty) <$>
1437 fromMaybe empty (fmap (\d -> renderDocstring d <> line) docs)
1439-- | Pretty-printer helper for the binding site of a name
1440bindingOf :: Name -- ^^ the bound name
1441 -> Bool -- ^^ whether the name is implicit
1442 -> Doc OutputAnnotation
1443bindingOf n imp = annotate (AnnBoundName n imp) (text (show n))
1445-- | Pretty-printer helper for names that attaches the correct annotations
1446prettyName :: Bool -- ^^ whether to show namespaces
1447 -> [(Name, Bool)] -- ^^ the current bound variables and whether they are implicit
1448 -> Name -- ^^ the name to pprint
1449 -> Doc OutputAnnotation
1450prettyName showNS bnd n | Just imp <- lookup n bnd = annotate (AnnBoundName n imp) (text (strName n))
1451 | otherwise = annotate (AnnName n Nothing Nothing Nothing) (text (strName n))
1452 where strName (UN n) = T.unpack n
1453 strName (NS n ns) | showNS = (concatMap (++ ".") . map T.unpack . reverse) ns ++ strName n
1454 | otherwise = strName n
1455 strName n | n == falseTy = "_|_"
1456 strName (MN i s) = T.unpack s
1457 strName other = show other
1460showCImp :: PPOption -> PClause -> Doc OutputAnnotation
1461showCImp ppo (PClause _ n l ws r w)
1462 = prettyImp ppo l <+> showWs ws <+> text "=" <+> prettyImp ppo r
1463 <+> text "where" <+> text (show w)
1464 where
1465 showWs [] = empty
1466 showWs (x : xs) = text "|" <+> prettyImp ppo x <+> showWs xs
1467showCImp ppo (PWith _ n l ws r w)
1468 = prettyImp ppo l <+> showWs ws <+> text "with" <+> prettyImp ppo r
1469 <+> braces (text (show w))
1470 where
1471 showWs [] = empty
1472 showWs (x : xs) = text "|" <+> prettyImp ppo x <+> showWs xs
1475showDImp :: PPOption -> PData -> Doc OutputAnnotation
1476showDImp ppo (PDatadecl n ty cons)
1477 = text "data" <+> text (show n) <+> colon <+> prettyImp ppo ty <+> text "where" <$>
1478 (indent 2 $ vsep (map (\ (_, _, n, t, _, _) -> pipe <+> prettyName False [] n <+> colon <+> prettyImp ppo t) cons))
1480showDecls :: PPOption -> [PDecl] -> Doc OutputAnnotation
1481showDecls o ds = vsep (map (showDeclImp o) ds)
1483showDeclImp _ (PFix _ f ops) = text (show f) <+> cat (punctuate (text ",") (map text ops))
1484showDeclImp o (PTy _ _ _ _ _ n t) = text "tydecl" <+> text (showCG n) <+> colon <+> prettyImp o t
1485showDeclImp o (PClauses _ _ n cs) = text "pat" <+> text (showCG n) <+> text "\t" <+>
1486 indent 2 (vsep (map (showCImp o) cs))
1487showDeclImp o (PData _ _ _ _ _ d) = showDImp o { ppopt_impl = True } d
1488showDeclImp o (PParams _ ns ps) = text "params" <+> braces (text (show ns) <> line <> showDecls o ps <> line)
1489showDeclImp o (PNamespace n ps) = text "namespace" <+> text n <> braces (line <> showDecls o ps <> line)
1490showDeclImp _ (PSyntax _ syn) = text "syntax" <+> text (show syn)
1491showDeclImp o (PClass _ _ _ cs n ps _ ds)
1492 = text "class" <+> text (show cs) <+> text (show n) <+> text (show ps) <> line <> showDecls o ds
1493showDeclImp o (PInstance _ _ cs n _ t _ ds)
1494 = text "instance" <+> text (show cs) <+> text (show n) <+> prettyImp o t <> line <> showDecls o ds
1495showDeclImp _ _ = text "..."
1496-- showDeclImp (PImport o) = "import " ++ o
1498instance Show (Doc OutputAnnotation) where
1499 show = flip (displayS . renderCompact) ""
1501getImps :: [PArg] -> [(Name, PTerm)]
1502getImps [] = []
1503getImps (PImp _ _ _ n tm : xs) = (n, tm) : getImps xs
1504getImps (_ : xs) = getImps xs
1506getExps :: [PArg] -> [PTerm]
1507getExps [] = []
1508getExps (PExp _ _ _ tm : xs) = tm : getExps xs
1509getExps (_ : xs) = getExps xs
1511getConsts :: [PArg] -> [PTerm]
1512getConsts [] = []
1513getConsts (PConstraint _ _ _ tm : xs) = tm : getConsts xs
1514getConsts (_ : xs) = getConsts xs
1516getAll :: [PArg] -> [PTerm]
1517getAll = map getTm
1520-- | Show Idris name
1521showName :: Maybe IState -- ^^ the Idris state, for information about names and colours
1522 -> [(Name, Bool)] -- ^^ the bound variables and whether they're implicit
1523 -> PPOption -- ^^ pretty printing options
1524 -> Bool -- ^^ whether to colourise
1525 -> Name -- ^^ the term to show
1526 -> String
1527showName ist bnd ppo colour n = case ist of
1528 Just i -> if colour then colourise n (idris_colourTheme i) else showbasic n
1529 Nothing -> showbasic n
1530 where name = if ppopt_impl ppo then show n else showbasic n
1531 showbasic n@(UN _) = showCG n
1532 showbasic (MN _ s) = str s
1533 showbasic (NS n s) = showSep "." (map str (reverse s)) ++ "." ++ showbasic n
1534 showbasic (SN s) = show s
1535 fst3 (x, _, _) = x
1536 colourise n t = let ctxt' = fmap tt_ctxt ist in
1537 case ctxt' of
1538 Nothing -> name
1539 Just ctxt | Just impl <- lookup n bnd -> if impl then colouriseImplicit t name
1540 else colouriseBound t name
1541 | isDConName n ctxt -> colouriseData t name
1542 | isFnName n ctxt -> colouriseFun t name
1543 | isTConName n ctxt -> colouriseType t name
1544 -- The assumption is that if a name is not bound and does not exist in the
1545 -- global context, then we're somewhere in which implicit info has been lost
1546 -- (like error messages). Thus, unknown vars are colourised as implicits.
1547 | otherwise -> colouriseImplicit t name
1549showTm :: IState -- ^^ the Idris state, for information about identifiers and colours
1550 -> PTerm -- ^^ the term to show
1551 -> String
1552showTm ist = displayDecorated (consoleDecorate ist) .
1553 renderPretty 0.8 100000 .
1554 prettyImp (ppOptionIst ist)
1556-- | Show a term with implicits, no colours
1557showTmImpls :: PTerm -> String
1558showTmImpls = flip (displayS . renderCompact . prettyImp verbosePPOption) ""
1562instance Sized PTerm where
1563 size (PQuote rawTerm) = size rawTerm
1564 size (PRef fc name) = size name
1565 size (PLam name ty bdy) = 1 + size ty + size bdy
1566 size (PPi plicity name ty bdy) = 1 + size ty + size bdy
1567 size (PLet name ty def bdy) = 1 + size ty + size def + size bdy
1568 size (PTyped trm ty) = 1 + size trm + size ty
1569 size (PApp fc name args) = 1 + size args
1570 size (PAppBind fc name args) = 1 + size args
1571 size (PCase fc trm bdy) = 1 + size trm + size bdy
1572 size (PTrue fc _) = 1
1573 size (PFalse fc) = 1
1574 size (PRefl fc _) = 1
1575 size (PResolveTC fc) = 1
1576 size (PEq fc left right) = 1 + size left + size right
1577 size (PRewrite fc left right _) = 1 + size left + size right
1578 size (PPair fc _ left right) = 1 + size left + size right
1579 size (PDPair fs _ left ty right) = 1 + size left + size ty + size right
1580 size (PAlternative a alts) = 1 + size alts
1581 size (PHidden hidden) = size hidden
1582 size (PUnifyLog tm) = size tm
1583 size (PDisamb _ tm) = size tm
1584 size (PNoImplicits tm) = size tm
1585 size PType = 1
1586 size (PConstant const) = 1 + size const
1587 size Placeholder = 1
1588 size (PDoBlock dos) = 1 + size dos
1589 size (PIdiom fc term) = 1 + size term
1590 size (PReturn fc) = 1
1591 size (PMetavar name) = 1
1592 size (PProof tactics) = size tactics
1593 size (PElabError err) = size err
1594 size PImpossible = 1
1596getPArity :: PTerm -> Int
1597getPArity (PPi _ _ _ sc) = 1 + getPArity sc
1598getPArity _ = 0
1600-- Return all names, free or globally bound, in the given term.
1602allNamesIn :: PTerm -> [Name]
1603allNamesIn tm = nub $ ni [] tm
1604 where -- TODO THINK added niTacImp, but is it right?
1605 ni env (PRef _ n)
1606 | not (n `elem` env) = [n]
1607 ni env (PPatvar _ n) = [n]
1608 ni env (PApp _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
1609 ni env (PAppBind _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
1610 ni env (PCase _ c os) = ni env c ++ concatMap (ni env) (map snd os)
1611 ni env (PLam n ty sc) = ni env ty ++ ni (n:env) sc
1612 ni env (PPi p n ty sc) = niTacImp env p ++ ni env ty ++ ni (n:env) sc
1613 ni env (PHidden tm) = ni env tm
1614 ni env (PEq _ l r) = ni env l ++ ni env r
1615 ni env (PRewrite _ l r _) = ni env l ++ ni env r
1616 ni env (PTyped l r) = ni env l ++ ni env r
1617 ni env (PPair _ _ l r) = ni env l ++ ni env r
1618 ni env (PDPair _ _ (PRef _ n) t r) = ni env t ++ ni (n:env) r
1619 ni env (PDPair _ _ l t r) = ni env l ++ ni env t ++ ni env r
1620 ni env (PAlternative a ls) = concatMap (ni env) ls
1621 ni env (PUnifyLog tm) = ni env tm
1622 ni env (PDisamb _ tm) = ni env tm
1623 ni env (PNoImplicits tm) = ni env tm
1624 ni env _ = []
1626 niTacImp env (TacImp _ _ scr) = ni env scr
1627 niTacImp _ _ = []
1629-- Return all names defined in binders in the given term
1630boundNamesIn :: PTerm -> [Name]
1631boundNamesIn tm = nub $ ni tm
1632 where -- TODO THINK Added niTacImp, but is it right?
1633 ni (PApp _ f as) = ni f ++ concatMap (ni) (map getTm as)
1634 ni (PAppBind _ f as) = ni f ++ concatMap (ni) (map getTm as)
1635 ni (PCase _ c os) = ni c ++ concatMap (ni) (map snd os)
1636 ni (PLam n ty sc) = n : (ni ty ++ ni sc)
1637 ni (PLet n ty val sc) = n : (ni ty ++ ni val ++ ni sc)
1638 ni (PPi p n ty sc) = niTacImp p ++ (n : (ni ty ++ ni sc))
1639 ni (PEq _ l r) = ni l ++ ni r
1640 ni (PRewrite _ l r _) = ni l ++ ni r
1641 ni (PTyped l r) = ni l ++ ni r
1642 ni (PPair _ _ l r) = ni l ++ ni r
1643 ni (PDPair _ _ (PRef _ n) t r) = ni t ++ ni r
1644 ni (PDPair _ _ l t r) = ni l ++ ni t ++ ni r
1645 ni (PAlternative a as) = concatMap (ni) as
1646 ni (PHidden tm) = ni tm
1647 ni (PUnifyLog tm) = ni tm
1648 ni (PDisamb _ tm) = ni tm
1649 ni (PNoImplicits tm) = ni tm
1650 ni _ = []
1652 niTacImp (TacImp _ _ scr) = ni scr
1653 niTacImp _ = []
1655-- Return names which are free in the given term.
1656namesIn :: [(Name, PTerm)] -> IState -> PTerm -> [Name]
1657namesIn uvars ist tm = nub $ ni [] tm
1658 where
1659 ni env (PRef _ n)
1660 | not (n `elem` env)
1661 = case lookupTy n (tt_ctxt ist) of
1662 [] -> [n]
1663 _ -> if n `elem` (map fst uvars) then [n] else []
1664 ni env (PApp _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
1665 ni env (PAppBind _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
1666 ni env (PCase _ c os) = ni env c ++ concatMap (ni env) (map snd os)
1667 ni env (PLam n ty sc) = ni env ty ++ ni (n:env) sc
1668 ni env (PPi p n ty sc) = niTacImp env p ++ ni env ty ++ ni (n:env) sc
1669 ni env (PEq _ l r) = ni env l ++ ni env r
1670 ni env (PRewrite _ l r _) = ni env l ++ ni env r
1671 ni env (PTyped l r) = ni env l ++ ni env r
1672 ni env (PPair _ _ l r) = ni env l ++ ni env r
1673 ni env (PDPair _ _ (PRef _ n) t r) = ni env t ++ ni (n:env) r
1674 ni env (PDPair _ _ l t r) = ni env l ++ ni env t ++ ni env r
1675 ni env (PAlternative a as) = concatMap (ni env) as
1676 ni env (PHidden tm) = ni env tm
1677 ni env (PUnifyLog tm) = ni env tm
1678 ni env (PDisamb _ tm) = ni env tm
1679 ni env (PNoImplicits tm) = ni env tm
1680 ni env _ = []
1682 niTacImp env (TacImp _ _ scr) = ni env scr
1683 niTacImp _ _ = []
1685-- Return which of the given names are used in the given term.
1687usedNamesIn :: [Name] -> IState -> PTerm -> [Name]
1688usedNamesIn vars ist tm = nub $ ni [] tm
1689 where -- TODO THINK added niTacImp, but is it right?
1690 ni env (PRef _ n)
1691 | n `elem` vars && not (n `elem` env)
1692 = case lookupDefExact n (tt_ctxt ist) of
1693 Nothing -> [n]
1694 _ -> []
1695 ni env (PApp _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
1696 ni env (PAppBind _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
1697 ni env (PCase _ c os) = ni env c ++ concatMap (ni env) (map snd os)
1698 ni env (PLam n ty sc) = ni env ty ++ ni (n:env) sc
1699 ni env (PPi p n ty sc) = niTacImp env p ++ ni env ty ++ ni (n:env) sc
1700 ni env (PEq _ l r) = ni env l ++ ni env r
1701 ni env (PRewrite _ l r _) = ni env l ++ ni env r
1702 ni env (PTyped l r) = ni env l ++ ni env r
1703 ni env (PPair _ _ l r) = ni env l ++ ni env r
1704 ni env (PDPair _ _ (PRef _ n) t r) = ni env t ++ ni (n:env) r
1705 ni env (PDPair _ _ l t r) = ni env l ++ ni env t ++ ni env r
1706 ni env (PAlternative a as) = concatMap (ni env) as
1707 ni env (PHidden tm) = ni env tm
1708 ni env (PUnifyLog tm) = ni env tm
1709 ni env (PDisamb _ tm) = ni env tm
1710 ni env (PNoImplicits tm) = ni env tm
1711 ni env _ = []
1713 niTacImp env (TacImp _ _ scr) = ni env scr
1714 niTacImp _ _ = []