git.iko.soy/Idris-dev
on 4dddfaf help sign in
Idris-dev/src/Idris/AbsSyntaxTree.hs
1262 lines 45 kB history raw
1{-# LANGUAGE MultiParamTypeClasses, FlexibleInstances, DeriveFunctor,
2 TypeSynonymInstances, PatternGuards #-}
4module Idris.AbsSyntaxTree where
6import Core.TT
7import Core.Evaluate
8import Core.Elaborate hiding (Tactic(..))
9import Core.Typecheck
10import IRTS.Lang
11import IRTS.CodegenCommon
12import Util.Pretty
13import Util.DynamicLinker
15import Paths_idris
17import System.Console.Haskeline
19import Control.Monad.Trans.State.Strict
21import Data.List
22import Data.Char
23import Data.Either
25import Debug.Trace
27data IOption = IOption { opt_logLevel :: Int,
28 opt_typecase :: Bool,
29 opt_typeintype :: Bool,
30 opt_coverage :: Bool,
31 opt_showimp :: Bool,
32 opt_errContext :: Bool,
33 opt_repl :: Bool,
34 opt_verbose :: Bool,
35 opt_quiet :: Bool,
36 opt_codegen :: Codegen,
37 opt_outputTy :: OutputType,
38 opt_ibcsubdir :: FilePath,
39 opt_importdirs :: [FilePath],
40 opt_triple :: String,
41 opt_cpu :: String,
42 opt_optLevel :: Int,
43 opt_cmdline :: [Opt] -- remember whole command line
44 }
45 deriving (Show, Eq)
47defaultOpts = IOption { opt_logLevel = 0
48 , opt_typecase = False
49 , opt_typeintype = False
50 , opt_coverage = True
51 , opt_showimp = False
52 , opt_errContext = False
53 , opt_repl = True
54 , opt_verbose = True
55 , opt_quiet = False
56 , opt_codegen = ViaC
57 , opt_outputTy = Executable
58 , opt_ibcsubdir = ""
59 , opt_importdirs = []
60 , opt_triple = ""
61 , opt_cpu = ""
62 , opt_optLevel = 2
63 , opt_cmdline = []
64 }
66data LanguageExt = TypeProviders deriving (Show, Eq, Read, Ord)
68-- | The output mode in use
69data OutputMode = RawOutput | IdeSlave Integer deriving Show
71-- TODO: Add 'module data' to IState, which can be saved out and reloaded quickly (i.e
72-- without typechecking).
73-- This will include all the functions and data declarations, plus fixity declarations
74-- and syntax macros.
76-- | The global state used in the Idris monad
77data IState = IState {
78 tt_ctxt :: Context, -- ^ All the currently defined names and their terms
79 idris_constraints :: [(UConstraint, FC)],
80 -- ^ A list of universe constraints and their corresponding source locations
81 idris_infixes :: [FixDecl], -- ^ Currently defined infix operators
82 idris_implicits :: Ctxt [PArg],
83 idris_statics :: Ctxt [Bool],
84 idris_classes :: Ctxt ClassInfo,
85 idris_dsls :: Ctxt DSL,
86 idris_optimisation :: Ctxt OptInfo,
87 idris_datatypes :: Ctxt TypeInfo,
88 idris_patdefs :: Ctxt ([([Name], Term, Term)], [PTerm]), -- not exported
89 -- ^ list of lhs/rhs, and a list of missing clauses
90 idris_flags :: Ctxt [FnOpt],
91 idris_callgraph :: Ctxt CGInfo, -- name, args used in each pos
92 idris_calledgraph :: Ctxt [Name],
93 idris_docstrings :: Ctxt String,
94 idris_totcheck :: [(FC, Name)],
95 idris_log :: String,
96 idris_options :: IOption,
97 idris_name :: Int,
98 idris_metavars :: [Name], -- ^ The currently defined but not proven metavariables
99 idris_coercions :: [Name],
100 idris_transforms :: [(Term, Term)],
101 syntax_rules :: [Syntax],
102 syntax_keywords :: [String],
103 imported :: [FilePath], -- ^ The imported modules
104 idris_scprims :: [(Name, (Int, PrimFn))],
105 idris_objs :: [(Codegen, FilePath)],
106 idris_libs :: [(Codegen, String)],
107 idris_hdrs :: [(Codegen, String)],
108 proof_list :: [(Name, [String])],
109 errLine :: Maybe Int,
110 lastParse :: Maybe Name,
111 indent_stack :: [Int],
112 brace_stack :: [Maybe Int],
113 hide_list :: [(Name, Maybe Accessibility)],
114 default_access :: Accessibility,
115 default_total :: Bool,
116 ibc_write :: [IBCWrite],
117 compiled_so :: Maybe String,
118 idris_dynamic_libs :: [DynamicLib],
119 idris_language_extensions :: [LanguageExt],
120 idris_outputmode :: OutputMode
121 }
123data SizeChange = Smaller | Same | Bigger | Unknown
124 deriving (Show, Eq)
125{-!
126deriving instance Binary SizeChange
127!-}
129type SCGEntry = (Name, [Maybe (Int, SizeChange)])
131data CGInfo = CGInfo { argsdef :: [Name],
132 calls :: [(Name, [[Name]])],
133 scg :: [SCGEntry],
134 argsused :: [Name],
135 unusedpos :: [Int] }
136 deriving Show
137{-!
138deriving instance Binary CGInfo
139!-}
141primDefs = [UN "unsafePerformIO", UN "mkLazyForeign", UN "mkForeign", UN "FalseElim"]
143-- information that needs writing for the current module's .ibc file
144data IBCWrite = IBCFix FixDecl
145 | IBCImp Name
146 | IBCStatic Name
147 | IBCClass Name
148 | IBCInstance Bool Name Name
149 | IBCDSL Name
150 | IBCData Name
151 | IBCOpt Name
152 | IBCSyntax Syntax
153 | IBCKeyword String
154 | IBCImport FilePath
155 | IBCObj Codegen FilePath
156 | IBCLib Codegen String
157 | IBCDyLib String
158 | IBCHeader Codegen String
159 | IBCAccess Name Accessibility
160 | IBCTotal Name Totality
161 | IBCFlags Name [FnOpt]
162 | IBCTrans (Term, Term)
163 | IBCCG Name
164 | IBCDoc Name
165 | IBCCoercion Name
166 | IBCDef Name -- i.e. main context
167 deriving Show
169idrisInit = IState initContext [] [] emptyContext emptyContext emptyContext
170 emptyContext emptyContext emptyContext emptyContext
171 emptyContext emptyContext emptyContext emptyContext
172 [] "" defaultOpts 6 [] [] [] [] [] [] [] [] [] []
173 [] Nothing Nothing [] [] [] Hidden False [] Nothing [] [] RawOutput
175-- | The monad for the main REPL - reading and processing files and updating
176-- global state (hence the IO inner monad).
177--type Idris = WriterT [Either String (IO ())] (State IState a))
178type Idris = StateT IState IO
180-- Commands in the REPL
182data Codegen = ViaC
183 | ViaJava
184 | ViaNode
185 | ViaJavaScript
186 | ViaLLVM
187 | Bytecode
188 deriving (Show, Eq)
190-- | REPL commands
191data Command = Quit
192 | Help
193 | Eval PTerm
194 | Check PTerm
195 | DocStr Name
196 | TotCheck Name
197 | Reload
198 | Load FilePath
199 | ChangeDirectory FilePath
200 | ModImport String
201 | Edit
202 | Compile Codegen String
203 | Execute
204 | ExecVal PTerm
205 | NewCompile String
206 | Metavars
207 | Prove Name
208 | AddProof (Maybe Name)
209 | RmProof Name
210 | ShowProof Name
211 | Proofs
212 | Universes
213 | TTShell
214 | LogLvl Int
215 | Spec PTerm
216 | HNF PTerm
217 | Defn Name
218 | Info Name
219 | Missing Name
220 | DynamicLink FilePath
221 | ListDynamic
222 | Pattelab PTerm
223 | DebugInfo Name
224 | Search PTerm
225 | SetOpt Opt
226 | UnsetOpt Opt
227 | NOP
229data Opt = Filename String
230 | Ver
231 | Usage
232 | Quiet
233 | Ideslave
234 | ShowLibs
235 | ShowLibdir
236 | ShowIncs
237 | NoPrelude
238 | NoREPL
239 | OLogging Int
240 | Output String
241 | NewOutput String
242 | TypeCase
243 | TypeInType
244 | DefaultTotal
245 | DefaultPartial
246 | WarnPartial
247 | NoCoverage
248 | ErrContext
249 | ShowImpl
250 | Verbose
251 | IBCSubDir String
252 | ImportDir String
253 | PkgBuild String
254 | PkgInstall String
255 | PkgClean String
256 | WarnOnly
257 | Pkg String
258 | BCAsm String
259 | DumpDefun String
260 | DumpCases String
261 | FOVM String
262 | UseCodegen Codegen
263 | OutputTy OutputType
264 | Extension LanguageExt
265 | InterpretScript String
266 | TargetTriple String
267 | TargetCPU String
268 | OptLevel Int
269 deriving (Show, Eq)
271-- Parsed declarations
273data Fixity = Infixl { prec :: Int }
274 | Infixr { prec :: Int }
275 | InfixN { prec :: Int }
276 | PrefixN { prec :: Int }
277 deriving Eq
278{-!
279deriving instance Binary Fixity
280!-}
282instance Show Fixity where
283 show (Infixl i) = "infixl " ++ show i
284 show (Infixr i) = "infixr " ++ show i
285 show (InfixN i) = "infix " ++ show i
286 show (PrefixN i) = "prefix " ++ show i
288data FixDecl = Fix Fixity String
289 deriving Eq
291instance Show FixDecl where
292 show (Fix f s) = show f ++ " " ++ s
294{-!
295deriving instance Binary FixDecl
296!-}
298instance Ord FixDecl where
299 compare (Fix x _) (Fix y _) = compare (prec x) (prec y)
302data Static = Static | Dynamic
303 deriving (Show, Eq)
304{-!
305deriving instance Binary Static
306!-}
308-- Mark bindings with their explicitness, and laziness
309data Plicity = Imp { plazy :: Bool,
310 pstatic :: Static,
311 pdocstr :: String }
312 | Exp { plazy :: Bool,
313 pstatic :: Static,
314 pdocstr :: String }
315 | Constraint { plazy :: Bool,
316 pstatic :: Static,
317 pdocstr :: String }
318 | TacImp { plazy :: Bool,
319 pstatic :: Static,
320 pscript :: PTerm,
321 pdocstr :: String }
322 deriving (Show, Eq)
324{-!
325deriving instance Binary Plicity
326!-}
328impl = Imp False Dynamic ""
329expl = Exp False Dynamic ""
330constraint = Constraint False Dynamic ""
331tacimpl t = TacImp False Dynamic t ""
333data FnOpt = Inlinable | TotalFn | PartialFn
334 | Coinductive | AssertTotal | TCGen
335 | Implicit -- implicit coercion
336 | CExport String -- export, with a C name
337 | Specialise [(Name, Maybe Int)] -- specialise it, freeze these names
338 deriving (Show, Eq)
339{-!
340deriving instance Binary FnOpt
341!-}
343type FnOpts = [FnOpt]
345inlinable :: FnOpts -> Bool
346inlinable = elem Inlinable
348-- | Top-level declarations such as compiler directives, definitions,
349-- datatypes and typeclasses.
350data PDecl' t
351 = PFix FC Fixity [String] -- ^ Fixity declaration
352 | PTy String SyntaxInfo FC FnOpts Name t -- ^ Type declaration
353 | PPostulate String SyntaxInfo FC FnOpts Name t -- ^ Postulate
354 | PClauses FC FnOpts Name [PClause' t] -- ^ Pattern clause
355 | PCAF FC Name t -- ^ Top level constant
356 | PData String SyntaxInfo FC Bool (PData' t) -- ^ Data declaration. The Bool argument is True for codata.
357 | PParams FC [(Name, t)] [PDecl' t] -- ^ Params block
358 | PNamespace String [PDecl' t] -- ^ New namespace
359 | PRecord String SyntaxInfo FC Name t String Name t -- ^ Record declaration
360 | PClass String SyntaxInfo FC
361 [t] -- constraints
362 Name
363 [(Name, t)] -- parameters
364 [PDecl' t] -- declarations
365 -- ^ Type class: arguments are documentation, syntax info, source location, constraints,
366 -- class name, parameters, method declarations
367 | PInstance SyntaxInfo FC [t] -- constraints
368 Name -- class
369 [t] -- parameters
370 t -- full instance type
371 (Maybe Name) -- explicit name
372 [PDecl' t]
373 -- ^ Instance declaration: arguments are syntax info, source location, constraints,
374 -- class name, parameters, full instance type, optional explicit name, and definitions
375 | PDSL Name (DSL' t) -- ^ DSL declaration
376 | PSyntax FC Syntax -- ^ Syntax definition
377 | PMutual FC [PDecl' t] -- ^ Mutual block
378 | PDirective (Idris ()) -- ^ Compiler directive. The parser inserts the corresponding action in the Idris monad.
379 | PProvider SyntaxInfo FC Name t t -- ^ Type provider. The first t is the type, the second is the term
380 | PTransform FC Bool t t -- ^ Source-to-source transformation rule. If
381 -- bool is True, lhs and rhs must be convertible
382 | PReflection FC Name -- type to reflect to
383 t -- type of variables
384 [PClause' t] -- ^ Pattern clauses
385 deriving Functor
386{-!
387deriving instance Binary PDecl'
388!-}
390-- | One clause of a top-level definition. Term arguments to constructors are:
391--
392-- 1. The whole application (missing for PClauseR and PWithR because they're within a "with" clause)
393--
394-- 2. The list of patterns
395--
396-- 3. The right-hand side
397--
398-- 4. The where block (PDecl' t)
399data PClause' t = PClause FC Name t [t] t [PDecl' t] -- ^ A normal top-level definition.
400 | PWith FC Name t [t] t [PDecl' t]
401 | PClauseR FC [t] t [PDecl' t]
402 | PWithR FC [t] t [PDecl' t]
403 deriving Functor
404{-!
405deriving instance Binary PClause'
406!-}
408-- | Data declaration
409data PData' t = PDatadecl { d_name :: Name, -- ^ The name of the datatype
410 d_tcon :: t, -- ^ Type constructor
411 d_cons :: [(String, Name, t, FC)] -- ^ Constructors
412 }
413 -- ^ Data declaration
414 | PLaterdecl { d_name :: Name, d_tcon :: t }
415 -- ^ "Placeholder" for data whose constructors are defined later
416 deriving Functor
417{-!
418deriving instance Binary PData'
419!-}
421-- Handy to get a free function for applying PTerm -> PTerm functions
422-- across a program, by deriving Functor
424type PDecl = PDecl' PTerm
425type PData = PData' PTerm
426type PClause = PClause' PTerm
428-- get all the names declared in a decl
430declared :: PDecl -> [Name]
431declared (PFix _ _ _) = []
432declared (PTy _ _ _ _ n t) = [n]
433declared (PPostulate _ _ _ _ n t) = [n]
434declared (PClauses _ _ n _) = [] -- not a declaration
435declared (PCAF _ n _) = [n]
436declared (PData _ _ _ _ (PDatadecl n _ ts)) = n : map fstt ts
437 where fstt (_, a, _, _) = a
438declared (PData _ _ _ _ (PLaterdecl n _)) = [n]
439declared (PParams _ _ ds) = concatMap declared ds
440declared (PNamespace _ ds) = concatMap declared ds
441declared (PRecord _ _ _ n _ _ c _) = [n, c]
442declared (PClass _ _ _ _ n _ ms) = n : concatMap declared ms
443declared (PInstance _ _ _ _ _ _ _ _) = []
444declared (PDSL n _) = [n]
445declared (PSyntax _ _) = []
446declared (PMutual _ ds) = concatMap declared ds
447declared (PDirective _) = []
449-- get the names declared, not counting nested parameter blocks
450tldeclared :: PDecl -> [Name]
451tldeclared (PFix _ _ _) = []
452tldeclared (PTy _ _ _ _ n t) = [n]
453tldeclared (PPostulate _ _ _ _ n t) = [n]
454tldeclared (PClauses _ _ n _) = [] -- not a declaration
455tldeclared (PRecord _ _ _ n _ _ c _) = [n, c]
456tldeclared (PData _ _ _ _ (PDatadecl n _ ts)) = n : map fstt ts
457 where fstt (_, a, _, _) = a
458tldeclared (PParams _ _ ds) = []
459tldeclared (PMutual _ ds) = concatMap tldeclared ds
460tldeclared (PNamespace _ ds) = concatMap tldeclared ds
463defined :: PDecl -> [Name]
464defined (PFix _ _ _) = []
465defined (PTy _ _ _ _ n t) = []
466defined (PPostulate _ _ _ _ n t) = []
467defined (PClauses _ _ n _) = [n] -- not a declaration
468defined (PCAF _ n _) = [n]
469defined (PData _ _ _ _ (PDatadecl n _ ts)) = n : map fstt ts
470 where fstt (_, a, _, _) = a
471defined (PData _ _ _ _ (PLaterdecl n _)) = []
472defined (PParams _ _ ds) = concatMap defined ds
473defined (PNamespace _ ds) = concatMap defined ds
474defined (PRecord _ _ _ n _ _ c _) = [n, c]
475defined (PClass _ _ _ _ n _ ms) = n : concatMap defined ms
476defined (PInstance _ _ _ _ _ _ _ _) = []
477defined (PDSL n _) = [n]
478defined (PSyntax _ _) = []
479defined (PMutual _ ds) = concatMap defined ds
480defined (PDirective _) = []
481--defined _ = []
483updateN :: [(Name, Name)] -> Name -> Name
484updateN ns n | Just n' <- lookup n ns = n'
485updateN _ n = n
487updateNs :: [(Name, Name)] -> PTerm -> PTerm
488updateNs [] t = t
489updateNs ns t = mapPT updateRef t
490 where updateRef (PRef fc f) = PRef fc (updateN ns f)
491 updateRef t = t
493-- updateDNs :: [(Name, Name)] -> PDecl -> PDecl
494-- updateDNs [] t = t
495-- updateDNs ns (PTy s f n t) | Just n' <- lookup n ns = PTy s f n' t
496-- updateDNs ns (PClauses f n c) | Just n' <- lookup n ns = PClauses f n' (map updateCNs c)
497-- where updateCNs ns (PClause n l ts r ds)
498-- = PClause (updateN ns n) (fmap (updateNs ns) l)
499-- (map (fmap (updateNs ns)) ts)
500-- (fmap (updateNs ns) r)
501-- (map (updateDNs ns) ds)
502-- updateDNs ns c = c
504-- | High level language terms
505data PTerm = PQuote Raw
506 | PRef FC Name
507 | PInferRef FC Name -- ^ A name to be defined later
508 | PPatvar FC Name
509 | PLam Name PTerm PTerm
510 | PPi Plicity Name PTerm PTerm
511 | PLet Name PTerm PTerm PTerm
512 | PTyped PTerm PTerm -- ^ Term with explicit type
513 | PApp FC PTerm [PArg]
514 | PMatchApp FC Name -- ^ Make an application by type matching
515 | PCase FC PTerm [(PTerm, PTerm)]
516 | PTrue FC
517 | PFalse FC
518 | PRefl FC PTerm
519 | PResolveTC FC
520 | PEq FC PTerm PTerm
521 | PRewrite FC PTerm PTerm (Maybe PTerm)
522 | PPair FC PTerm PTerm
523 | PDPair FC PTerm PTerm PTerm
524 | PAlternative Bool [PTerm] -- True if only one may work
525 | PHidden PTerm -- ^ Irrelevant or hidden pattern
526 | PType
527 | PConstant Const
528 | Placeholder
529 | PDoBlock [PDo]
530 | PIdiom FC PTerm
531 | PReturn FC
532 | PMetavar Name
533 | PProof [PTactic] -- ^ Proof script
534 | PTactics [PTactic] -- ^ As PProof, but no auto solving
535 | PElabError Err -- ^ Error to report on elaboration
536 | PImpossible -- ^ Special case for declaring when an LHS can't typecheck
537 | PCoerced PTerm -- ^ To mark a coerced argument, so as not to coerce twice
538 | PUnifyLog PTerm -- ^ dump a trace of unifications when building term
539 deriving Eq
540{-!
541deriving instance Binary PTerm
542!-}
544mapPT :: (PTerm -> PTerm) -> PTerm -> PTerm
545mapPT f t = f (mpt t) where
546 mpt (PLam n t s) = PLam n (mapPT f t) (mapPT f s)
547 mpt (PPi p n t s) = PPi p n (mapPT f t) (mapPT f s)
548 mpt (PLet n ty v s) = PLet n (mapPT f ty) (mapPT f v) (mapPT f s)
549 mpt (PRewrite fc t s g) = PRewrite fc (mapPT f t) (mapPT f s)
550 (fmap (mapPT f) g)
551 mpt (PApp fc t as) = PApp fc (mapPT f t) (map (fmap (mapPT f)) as)
552 mpt (PCase fc c os) = PCase fc (mapPT f c) (map (pmap (mapPT f)) os)
553 mpt (PEq fc l r) = PEq fc (mapPT f l) (mapPT f r)
554 mpt (PTyped l r) = PTyped (mapPT f l) (mapPT f r)
555 mpt (PPair fc l r) = PPair fc (mapPT f l) (mapPT f r)
556 mpt (PDPair fc l t r) = PDPair fc (mapPT f l) (mapPT f t) (mapPT f r)
557 mpt (PAlternative a as) = PAlternative a (map (mapPT f) as)
558 mpt (PHidden t) = PHidden (mapPT f t)
559 mpt (PDoBlock ds) = PDoBlock (map (fmap (mapPT f)) ds)
560 mpt (PProof ts) = PProof (map (fmap (mapPT f)) ts)
561 mpt (PTactics ts) = PTactics (map (fmap (mapPT f)) ts)
562 mpt (PUnifyLog tm) = PUnifyLog (mapPT f tm)
563 mpt x = x
566data PTactic' t = Intro [Name] | Intros | Focus Name
567 | Refine Name [Bool] | Rewrite t
568 | Equiv t
569 | MatchRefine Name
570 | LetTac Name t | LetTacTy Name t t
571 | Exact t | Compute | Trivial
572 | Solve
573 | Attack
574 | ProofState | ProofTerm | Undo
575 | Try (PTactic' t) (PTactic' t)
576 | TSeq (PTactic' t) (PTactic' t)
577 | ApplyTactic t -- see Language.Reflection module
578 | Reflect t
579 | Fill t
580 | GoalType String (PTactic' t)
581 | Qed | Abandon
582 deriving (Show, Eq, Functor)
583{-!
584deriving instance Binary PTactic'
585!-}
587instance Sized a => Sized (PTactic' a) where
588 size (Intro nms) = 1 + size nms
589 size Intros = 1
590 size (Focus nm) = 1 + size nm
591 size (Refine nm bs) = 1 + size nm + length bs
592 size (Rewrite t) = 1 + size t
593 size (LetTac nm t) = 1 + size nm + size t
594 size (Exact t) = 1 + size t
595 size Compute = 1
596 size Trivial = 1
597 size Solve = 1
598 size Attack = 1
599 size ProofState = 1
600 size ProofTerm = 1
601 size Undo = 1
602 size (Try l r) = 1 + size l + size r
603 size (TSeq l r) = 1 + size l + size r
604 size (ApplyTactic t) = 1 + size t
605 size (Reflect t) = 1 + size t
606 size (Fill t) = 1 + size t
607 size Qed = 1
608 size Abandon = 1
610type PTactic = PTactic' PTerm
612data PDo' t = DoExp FC t
613 | DoBind FC Name t
614 | DoBindP FC t t
615 | DoLet FC Name t t
616 | DoLetP FC t t
617 deriving (Eq, Functor)
618{-!
619deriving instance Binary PDo'
620!-}
622instance Sized a => Sized (PDo' a) where
623 size (DoExp fc t) = 1 + size fc + size t
624 size (DoBind fc nm t) = 1 + size fc + size nm + size t
625 size (DoBindP fc l r) = 1 + size fc + size l + size r
626 size (DoLet fc nm l r) = 1 + size fc + size nm + size l + size r
627 size (DoLetP fc l r) = 1 + size fc + size l + size r
629type PDo = PDo' PTerm
631-- The priority gives a hint as to elaboration order. Best to elaborate
632-- things early which will help give a more concrete type to other
633-- variables, e.g. a before (interpTy a).
634-- TODO: priority no longer serves any purpose, drop it!
636data PArg' t = PImp { priority :: Int,
637 lazyarg :: Bool, pname :: Name, getTm :: t,
638 pargdoc :: String }
639 | PExp { priority :: Int,
640 lazyarg :: Bool, getTm :: t,
641 pargdoc :: String }
642 | PConstraint { priority :: Int,
643 lazyarg :: Bool, getTm :: t,
644 pargdoc :: String }
645 | PTacImplicit { priority :: Int,
646 lazyarg :: Bool, pname :: Name,
647 getScript :: t,
648 getTm :: t,
649 pargdoc :: String }
650 deriving (Show, Eq, Functor)
652instance Sized a => Sized (PArg' a) where
653 size (PImp p l nm trm _) = 1 + size nm + size trm
654 size (PExp p l trm _) = 1 + size trm
655 size (PConstraint p l trm _) = 1 + size trm
656 size (PTacImplicit p l nm scr trm _) = 1 + size nm + size scr + size trm
658{-!
659deriving instance Binary PArg'
660!-}
662pimp n t = PImp 0 True n t ""
663pexp t = PExp 0 False t ""
664pconst t = PConstraint 0 False t ""
665ptacimp n s t = PTacImplicit 0 True n s t ""
667type PArg = PArg' PTerm
669-- Type class data
671data ClassInfo = CI { instanceName :: Name,
672 class_methods :: [(Name, (FnOpts, PTerm))],
673 class_defaults :: [(Name, (Name, PDecl))], -- method name -> default impl
674 class_params :: [Name],
675 class_instances :: [Name] }
676 deriving Show
677{-!
678deriving instance Binary ClassInfo
679!-}
681data OptInfo = Optimise { collapsible :: Bool,
682 forceable :: [Int], -- argument positions
683 recursive :: [Int] }
684 deriving Show
685{-!
686deriving instance Binary OptInfo
687!-}
690data TypeInfo = TI { con_names :: [Name],
691 codata :: Bool,
692 param_pos :: [Int] }
693 deriving Show
694{-!
695deriving instance Binary TypeInfo
696!-}
698-- Syntactic sugar info
700data DSL' t = DSL { dsl_bind :: t,
701 dsl_return :: t,
702 dsl_apply :: t,
703 dsl_pure :: t,
704 dsl_var :: Maybe t,
705 index_first :: Maybe t,
706 index_next :: Maybe t,
707 dsl_lambda :: Maybe t,
708 dsl_let :: Maybe t
709 }
710 deriving (Show, Functor)
711{-!
712deriving instance Binary DSL'
713!-}
715type DSL = DSL' PTerm
717data SynContext = PatternSyntax | TermSyntax | AnySyntax
718 deriving Show
719{-!
720deriving instance Binary SynContext
721!-}
723data Syntax = Rule [SSymbol] PTerm SynContext
724 deriving Show
725{-!
726deriving instance Binary Syntax
727!-}
729data SSymbol = Keyword Name
730 | Symbol String
731 | Binding Name
732 | Expr Name
733 | SimpleExpr Name
734 deriving Show
735{-!
736deriving instance Binary SSymbol
737!-}
739initDSL = DSL (PRef f (UN ">>="))
740 (PRef f (UN "return"))
741 (PRef f (UN "<$>"))
742 (PRef f (UN "pure"))
743 Nothing
744 Nothing
745 Nothing
746 Nothing
747 Nothing
748 where f = FC "(builtin)" 0
750data Using = UImplicit Name PTerm
751 | UConstraint Name [Name]
752 deriving (Show, Eq)
753{-!
754deriving instance Binary Using
755!-}
757data SyntaxInfo = Syn { using :: [Using],
758 syn_params :: [(Name, PTerm)],
759 syn_namespace :: [String],
760 no_imp :: [Name],
761 decoration :: Name -> Name,
762 inPattern :: Bool,
763 implicitAllowed :: Bool,
764 dsl_info :: DSL }
765 deriving Show
766{-!
767deriving instance Binary SyntaxInfo
768!-}
770defaultSyntax = Syn [] [] [] [] id False False initDSL
772expandNS :: SyntaxInfo -> Name -> Name
773expandNS syn n@(NS _ _) = n
774expandNS syn n = case syn_namespace syn of
775 [] -> n
776 xs -> NS n xs
779--- Pretty printing declarations and terms
781instance Show PTerm where
782 show tm = showImp False tm
784instance Pretty PTerm where
785 pretty = prettyImp False
787instance Show PDecl where
788 show d = showDeclImp False d
790instance Show PClause where
791 show c = showCImp True c
793instance Show PData where
794 show d = showDImp False d
796showDeclImp _ (PFix _ f ops) = show f ++ " " ++ showSep ", " ops
797showDeclImp t (PTy _ _ _ _ n ty) = show n ++ " : " ++ showImp t ty
798showDeclImp t (PPostulate _ _ _ _ n ty) = show n ++ " : " ++ showImp t ty
799showDeclImp _ (PClauses _ _ n c) = showSep "\n" (map show c)
800showDeclImp _ (PData _ _ _ _ d) = show d
801showDeclImp _ (PParams f ns ps) = "parameters " ++ show ns ++ "\n" ++
802 showSep "\n" (map show ps)
805showCImp :: Bool -> PClause -> String
806showCImp impl (PClause _ n l ws r w)
807 = showImp impl l ++ showWs ws ++ " = " ++ showImp impl r
808 ++ " where " ++ show w
809 where
810 showWs [] = ""
811 showWs (x : xs) = " | " ++ showImp impl x ++ showWs xs
812showCImp impl (PWith _ n l ws r w)
813 = showImp impl l ++ showWs ws ++ " with " ++ showImp impl r
814 ++ " { " ++ show w ++ " } "
815 where
816 showWs [] = ""
817 showWs (x : xs) = " | " ++ showImp impl x ++ showWs xs
820showDImp :: Bool -> PData -> String
821showDImp impl (PDatadecl n ty cons)
822 = "data " ++ show n ++ " : " ++ showImp impl ty ++ " where\n\t"
823 ++ showSep "\n\t| "
824 (map (\ (_, n, t, _) -> show n ++ " : " ++ showImp impl t) cons)
826getImps :: [PArg] -> [(Name, PTerm)]
827getImps [] = []
828getImps (PImp _ _ n tm _ : xs) = (n, tm) : getImps xs
829getImps (_ : xs) = getImps xs
831getExps :: [PArg] -> [PTerm]
832getExps [] = []
833getExps (PExp _ _ tm _ : xs) = tm : getExps xs
834getExps (_ : xs) = getExps xs
836getConsts :: [PArg] -> [PTerm]
837getConsts [] = []
838getConsts (PConstraint _ _ tm _ : xs) = tm : getConsts xs
839getConsts (_ : xs) = getConsts xs
841getAll :: [PArg] -> [PTerm]
842getAll = map getTm
844prettyImp :: Bool -> PTerm -> Doc
845prettyImp impl = prettySe 10
846 where
847 prettySe p (PQuote r) =
848 if size r > breakingSize then
849 text "![" $$ pretty r <> text "]"
850 else
851 text "![" <> pretty r <> text "]"
852 prettySe p (PPatvar fc n) = pretty n
853 prettySe p (PRef fc n) =
854 if impl then
855 pretty n
856 else
857 prettyBasic n
858 where
859 prettyBasic n@(UN _) = pretty n
860 prettyBasic (MN _ s) = text s
861 prettyBasic (NS n s) = (foldr (<>) empty (intersperse (text ".") (map text $ reverse s))) <> prettyBasic n
862 prettySe p (PLam n ty sc) =
863 bracket p 2 $
864 if size sc > breakingSize then
865 text "λ" <> pretty n <+> text "=>" $+$ pretty sc
866 else
867 text "λ" <> pretty n <+> text "=>" <+> pretty sc
868 prettySe p (PLet n ty v sc) =
869 bracket p 2 $
870 if size sc > breakingSize then
871 text "let" <+> pretty n <+> text "=" <+> prettySe 10 v <+> text "in" $+$
872 nest nestingSize (prettySe 10 sc)
873 else
874 text "let" <+> pretty n <+> text "=" <+> prettySe 10 v <+> text "in" <+>
875 prettySe 10 sc
876 prettySe p (PPi (Exp l s _) n ty sc)
877 | n `elem` allNamesIn sc || impl =
878 let open = if l then text "|" <> lparen else lparen in
879 bracket p 2 $
880 if size sc > breakingSize then
881 open <> pretty n <+> colon <+> prettySe 10 ty <> rparen <+>
882 st <+> text "->" $+$ prettySe 10 sc
883 else
884 open <> pretty n <+> colon <+> prettySe 10 ty <> rparen <+>
885 st <+> text "->" <+> prettySe 10 sc
886 | otherwise =
887 bracket p 2 $
888 if size sc > breakingSize then
889 prettySe 0 ty <+> st <+> text "->" $+$ prettySe 10 sc
890 else
891 prettySe 0 ty <+> st <+> text "->" <+> prettySe 10 sc
892 where
893 st =
894 case s of
895 Static -> text "[static]"
896 _ -> empty
897 prettySe p (PPi (Imp l s _) n ty sc)
898 | impl =
899 let open = if l then text "|" <> lbrace else lbrace in
900 bracket p 2 $
901 if size sc > breakingSize then
902 open <> pretty n <+> colon <+> prettySe 10 ty <> rbrace <+>
903 st <+> text "->" <+> prettySe 10 sc
904 else
905 open <> pretty n <+> colon <+> prettySe 10 ty <> rbrace <+>
906 st <+> text "->" <+> prettySe 10 sc
907 | otherwise = prettySe 10 sc
908 where
909 st =
910 case s of
911 Static -> text $ "[static]"
912 _ -> empty
913 prettySe p (PPi (Constraint _ _ _) n ty sc) =
914 bracket p 2 $
915 if size sc > breakingSize then
916 prettySe 10 ty <+> text "=>" <+> prettySe 10 sc
917 else
918 prettySe 10 ty <+> text "=>" $+$ prettySe 10 sc
919 prettySe p (PPi (TacImp _ _ s _) n ty sc) =
920 bracket p 2 $
921 if size sc > breakingSize then
922 lbrace <> text "tacimp" <+> pretty n <+> colon <+> prettySe 10 ty <>
923 rbrace <+> text "->" $+$ prettySe 10 sc
924 else
925 lbrace <> text "tacimp" <+> pretty n <+> colon <+> prettySe 10 ty <>
926 rbrace <+> text "->" <+> prettySe 10 sc
927 prettySe p (PApp _ (PRef _ f) [])
928 | not impl = pretty f
929 prettySe p (PApp _ (PRef _ op@(UN (f:_))) args)
930 | length (getExps args) == 2 && (not impl) && (not $ isAlpha f) =
931 let [l, r] = getExps args in
932 bracket p 1 $
933 if size r > breakingSize then
934 prettySe 1 l <+> pretty op $+$ prettySe 0 r
935 else
936 prettySe 1 l <+> pretty op <+> prettySe 0 r
937 prettySe p (PApp _ f as) =
938 let args = getExps as in
939 bracket p 1 $
940 prettySe 1 f <+>
941 if impl then
942 foldl' fS empty as
943 -- foldr (<+>) empty $ map prettyArgS as
944 else
945 foldl' fSe empty args
946 -- foldr (<+>) empty $ map prettyArgSe args
947 where
948 fS l r =
949 if size r > breakingSize then
950 l $+$ nest nestingSize (prettyArgS r)
951 else
952 l <+> prettyArgS r
954 fSe l r =
955 if size r > breakingSize then
956 l $+$ nest nestingSize (prettyArgSe r)
957 else
958 l <+> prettyArgSe r
959 prettySe p (PCase _ scr opts) =
960 text "case" <+> prettySe 10 scr <+> text "of" $+$ nest nestingSize prettyBody
961 where
962 prettyBody = foldr ($$) empty $ intersperse (text "|") $ map sc opts
964 sc (l, r) = prettySe 10 l <+> text "=>" <+> prettySe 10 r
965 prettySe p (PHidden tm) = text "." <> prettySe 0 tm
966 prettySe p (PRefl _ _) = text "refl"
967 prettySe p (PResolveTC _) = text "resolvetc"
968 prettySe p (PTrue _) = text "()"
969 prettySe p (PFalse _) = text "_|_"
970 prettySe p (PEq _ l r) =
971 bracket p 2 $
972 if size r > breakingSize then
973 prettySe 10 l <+> text "=" $$ nest nestingSize (prettySe 10 r)
974 else
975 prettySe 10 l <+> text "=" <+> prettySe 10 r
976 prettySe p (PRewrite _ l r _) =
977 bracket p 2 $
978 if size r > breakingSize then
979 text "rewrite" <+> prettySe 10 l <+> text "in" $$ nest nestingSize (prettySe 10 r)
980 else
981 text "rewrite" <+> prettySe 10 l <+> text "in" <+> prettySe 10 r
982 prettySe p (PTyped l r) =
983 lparen <> prettySe 10 l <+> colon <+> prettySe 10 r <> rparen
984 prettySe p (PPair _ l r) =
985 if size r > breakingSize then
986 lparen <> prettySe 10 l <> text "," $+$
987 prettySe 10 r <> rparen
988 else
989 lparen <> prettySe 10 l <> text "," <+> prettySe 10 r <> rparen
990 prettySe p (PDPair _ l t r) =
991 if size r > breakingSize then
992 lparen <> prettySe 10 l <+> text "**" $+$
993 prettySe 10 r <> rparen
994 else
995 lparen <> prettySe 10 l <+> text "**" <+> prettySe 10 r <> rparen
996 prettySe p (PAlternative a as) =
997 lparen <> text "|" <> prettyAs <> text "|" <> rparen
998 where
999 prettyAs =
1000 foldr (\l -> \r -> l <+> text "," <+> r) empty $ map (prettySe 10) as
1001 prettySe p PType = text "Type"
1002 prettySe p (PConstant c) = pretty c
1003 -- XXX: add pretty for tactics
1004 prettySe p (PProof ts) =
1005 text "proof" <+> lbrace $+$ nest nestingSize (text . show $ ts) $+$ rbrace
1006 prettySe p (PTactics ts) =
1007 text "tactics" <+> lbrace $+$ nest nestingSize (text . show $ ts) $+$ rbrace
1008 prettySe p (PMetavar n) = text "?" <> pretty n
1009 prettySe p (PReturn f) = text "return"
1010 prettySe p PImpossible = text "impossible"
1011 prettySe p Placeholder = text "_"
1012 prettySe p (PDoBlock _) = text "do block pretty not implemented"
1013 prettySe p (PElabError s) = pretty s
1015 prettySe p _ = text "test"
1017 prettyArgS (PImp _ _ n tm _) = prettyArgSi (n, tm)
1018 prettyArgS (PExp _ _ tm _) = prettyArgSe tm
1019 prettyArgS (PConstraint _ _ tm _) = prettyArgSc tm
1020 prettyArgS (PTacImplicit _ _ n _ tm _) = prettyArgSti (n, tm)
1022 prettyArgSe arg = prettySe 0 arg
1023 prettyArgSi (n, val) = lbrace <> pretty n <+> text "=" <+> prettySe 10 val <> rbrace
1024 prettyArgSc val = lbrace <> lbrace <> prettySe 10 val <> rbrace <> rbrace
1025 prettyArgSti (n, val) = lbrace <> text "auto" <+> pretty n <+> text "=" <+> prettySe 10 val <> rbrace
1027 bracket outer inner doc
1028 | inner > outer = lparen <> doc <> rparen
1029 | otherwise = doc
1031showImp :: Bool -> PTerm -> String
1032showImp impl tm = se 10 tm where
1033 se p (PQuote r) = "![" ++ show r ++ "]"
1034 se p (PPatvar fc n) = if impl then show n ++ "[p]" else show n
1035 se p (PInferRef fc n) = "!" ++ show n -- ++ "[" ++ show fc ++ "]"
1036 se p (PRef fc n) = if impl then show n -- ++ "[" ++ show fc ++ "]"
1037 else showbasic n
1038 where showbasic n@(UN _) = show n
1039 showbasic (MN _ s) = s
1040 showbasic (NS n s) = showSep "." (reverse s) ++ "." ++ showbasic n
1041 se p (PLam n ty sc) = bracket p 2 $ "\\ " ++ show n ++
1042 (if impl then " : " ++ se 10 ty else "") ++ " => "
1043 ++ se 10 sc
1044 se p (PLet n ty v sc) = bracket p 2 $ "let " ++ show n ++ " = " ++ se 10 v ++
1045 " in " ++ se 10 sc
1046 se p (PPi (Exp l s _) n ty sc)
1047 | n `elem` allNamesIn sc || impl
1048 = bracket p 2 $
1049 (if l then "|(" else "(") ++
1050 show n ++ " : " ++ se 10 ty ++
1051 ") " ++ st ++
1052 "-> " ++ se 10 sc
1053 | otherwise = bracket p 2 $ se 0 ty ++ " " ++ st ++ "-> " ++ se 10 sc
1054 where st = case s of
1055 Static -> "[static] "
1056 _ -> ""
1057 se p (PPi (Imp l s _) n ty sc)
1058 | impl = bracket p 2 $ (if l then "|{" else "{") ++
1059 show n ++ " : " ++ se 10 ty ++
1060 "} " ++ st ++ "-> " ++ se 10 sc
1061 | otherwise = se 10 sc
1062 where st = case s of
1063 Static -> "[static] "
1064 _ -> ""
1065 se p (PPi (Constraint _ _ _) n ty sc)
1066 = bracket p 2 $ se 10 ty ++ " => " ++ se 10 sc
1067 se p (PPi (TacImp _ _ s _) n ty sc)
1068 = bracket p 2 $ "{tacimp " ++ show n ++ " : " ++ se 10 ty ++ "} -> " ++ se 10 sc
1069 se p e
1070 | Just str <- slist p e = str
1071 | Just num <- snat p e = show num
1072 se p (PMatchApp _ f) = "match " ++ show f
1073 se p (PApp _ (PRef _ f) [])
1074 | not impl = show f
1075 se p (PApp _ (PRef _ op@(UN (f:_))) args)
1076 | length (getExps args) == 2 && not impl && not (isAlpha f)
1077 = let [l, r] = getExps args in
1078 bracket p 1 $ se 1 l ++ " " ++ show op ++ " " ++ se 0 r
1079 se p (PApp _ f as)
1080 = let args = getExps as in
1081 bracket p 1 $ se 1 f ++ if impl then concatMap sArg as
1082 else concatMap seArg args
1083 se p (PCase _ scr opts) = "case " ++ se 10 scr ++ " of " ++ showSep " | " (map sc opts)
1084 where sc (l, r) = se 10 l ++ " => " ++ se 10 r
1085 se p (PHidden tm) = "." ++ se 0 tm
1086 se p (PRefl _ t)
1087 | not impl = "refl"
1088 | otherwise = "refl {" ++ se 10 t ++ "}"
1089 se p (PResolveTC _) = "resolvetc"
1090 se p (PTrue _) = "()"
1091 se p (PFalse _) = "_|_"
1092 se p (PEq _ l r) = bracket p 2 $ se 10 l ++ " = " ++ se 10 r
1093 se p (PRewrite _ l r _) = bracket p 2 $ "rewrite " ++ se 10 l ++ " in " ++ se 10 r
1094 se p (PTyped l r) = "(" ++ se 10 l ++ " : " ++ se 10 r ++ ")"
1095 se p (PPair _ l r) = "(" ++ se 10 l ++ ", " ++ se 10 r ++ ")"
1096 se p (PDPair _ l t r) = "(" ++ se 10 l ++ " ** " ++ se 10 r ++ ")"
1097 se p (PAlternative a as) = "(|" ++ showSep " , " (map (se 10) as) ++ "|)"
1098 se p PType = "Type"
1099 se p (PConstant c) = show c
1100 se p (PProof ts) = "proof { " ++ show ts ++ "}"
1101 se p (PTactics ts) = "tactics { " ++ show ts ++ "}"
1102 se p (PMetavar n) = "?" ++ show n
1103 se p (PReturn f) = "return"
1104 se p PImpossible = "impossible"
1105 se p Placeholder = "_"
1106 se p (PDoBlock _) = "do block show not implemented"
1107 se p (PElabError s) = show s
1108 se p (PCoerced t) = se p t
1109 se p (PUnifyLog t) = "%unifyLog " ++ se p t
1110-- se p x = "Not implemented"
1112 slist' p (PApp _ (PRef _ nil) _)
1113 | nsroot nil == UN "Nil" = Just []
1114 slist' p (PApp _ (PRef _ cons) args)
1115 | nsroot cons == UN "::",
1116 (PExp {getTm=tl}):(PExp {getTm=hd}):imps <- reverse args,
1117 all isImp imps,
1118 Just tl' <- slist' p tl
1119 = Just (hd:tl')
1120 where
1121 isImp (PImp {}) = True
1122 isImp _ = False
1123 slist' _ _ = Nothing
1125 slist p e | Just es <- slist' p e = Just $
1126 case es of [] -> "[]"
1127 [x] -> "[" ++ se p x ++ "]"
1128 xs -> "[" ++ intercalate "," (map (se p) xs) ++ "]"
1129 slist _ _ = Nothing
1131 -- since Prelude is always imported, S & Z are unqualified iff they're the
1132 -- Nat ones.
1133 snat p (PRef _ o)
1134 | show o == (natns++"Z") || show o == "Z" = Just 0
1135 snat p (PApp _ s [PExp {getTm=n}])
1136 | show s == (natns++"S") || show s == "S",
1137 Just n' <- snat p n
1138 = Just $ 1 + n'
1139 snat _ _ = Nothing
1141 natns = "Prelude.Nat."
1143 sArg (PImp _ _ n tm _) = siArg (n, tm)
1144 sArg (PExp _ _ tm _) = seArg tm
1145 sArg (PConstraint _ _ tm _) = scArg tm
1146 sArg (PTacImplicit _ _ n _ tm _) = stiArg (n, tm)
1148 seArg arg = " " ++ se 0 arg
1149 siArg (n, val) = " {" ++ show n ++ " = " ++ se 10 val ++ "}"
1150 scArg val = " {{" ++ se 10 val ++ "}}"
1151 stiArg (n, val) = " {auto " ++ show n ++ " = " ++ se 10 val ++ "}"
1153 bracket outer inner str | inner > outer = "(" ++ str ++ ")"
1154 | otherwise = str
1157instance Sized PTerm where
1158 size (PQuote rawTerm) = size rawTerm
1159 size (PRef fc name) = size name
1160 size (PLam name ty bdy) = 1 + size ty + size bdy
1161 size (PPi plicity name ty bdy) = 1 + size ty + size bdy
1162 size (PLet name ty def bdy) = 1 + size ty + size def + size bdy
1163 size (PTyped trm ty) = 1 + size trm + size ty
1164 size (PApp fc name args) = 1 + size args
1165 size (PCase fc trm bdy) = 1 + size trm + size bdy
1166 size (PTrue fc) = 1
1167 size (PFalse fc) = 1
1168 size (PRefl fc _) = 1
1169 size (PResolveTC fc) = 1
1170 size (PEq fc left right) = 1 + size left + size right
1171 size (PRewrite fc left right _) = 1 + size left + size right
1172 size (PPair fc left right) = 1 + size left + size right
1173 size (PDPair fs left ty right) = 1 + size left + size ty + size right
1174 size (PAlternative a alts) = 1 + size alts
1175 size (PHidden hidden) = size hidden
1176 size (PUnifyLog tm) = size tm
1177 size PType = 1
1178 size (PConstant const) = 1 + size const
1179 size Placeholder = 1
1180 size (PDoBlock dos) = 1 + size dos
1181 size (PIdiom fc term) = 1 + size term
1182 size (PReturn fc) = 1
1183 size (PMetavar name) = 1
1184 size (PProof tactics) = size tactics
1185 size (PElabError err) = size err
1186 size PImpossible = 1
1188getPArity :: PTerm -> Int
1189getPArity (PPi _ _ _ sc) = 1 + getPArity sc
1190getPArity _ = 0
1192-- Return all names, free or globally bound, in the given term.
1194allNamesIn :: PTerm -> [Name]
1195allNamesIn tm = nub $ ni [] tm
1196 where
1197 ni env (PRef _ n)
1198 | not (n `elem` env) = [n]
1199 ni env (PApp _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
1200 ni env (PCase _ c os) = ni env c ++ concatMap (ni env) (map snd os)
1201 ni env (PLam n ty sc) = ni env ty ++ ni (n:env) sc
1202 ni env (PPi _ n ty sc) = ni env ty ++ ni (n:env) sc
1203 ni env (PHidden tm) = ni env tm
1204 ni env (PEq _ l r) = ni env l ++ ni env r
1205 ni env (PRewrite _ l r _) = ni env l ++ ni env r
1206 ni env (PTyped l r) = ni env l ++ ni env r
1207 ni env (PPair _ l r) = ni env l ++ ni env r
1208 ni env (PDPair _ (PRef _ n) t r) = ni env t ++ ni (n:env) r
1209 ni env (PDPair _ l t r) = ni env l ++ ni env t ++ ni env r
1210 ni env (PAlternative a ls) = concatMap (ni env) ls
1211 ni env (PUnifyLog tm) = ni env tm
1212 ni env _ = []
1214-- Return names which are free in the given term.
1216namesIn :: [(Name, PTerm)] -> IState -> PTerm -> [Name]
1217namesIn uvars ist tm = nub $ ni [] tm
1218 where
1219 ni env (PRef _ n)
1220 | not (n `elem` env)
1221 = case lookupTy n (tt_ctxt ist) of
1222 [] -> [n]
1223 _ -> if n `elem` (map fst uvars) then [n] else []
1224 ni env (PApp _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
1225 ni env (PCase _ c os) = ni env c ++ concatMap (ni env) (map snd os)
1226 ni env (PLam n ty sc) = ni env ty ++ ni (n:env) sc
1227 ni env (PPi _ n ty sc) = ni env ty ++ ni (n:env) sc
1228 ni env (PEq _ l r) = ni env l ++ ni env r
1229 ni env (PRewrite _ l r _) = ni env l ++ ni env r
1230 ni env (PTyped l r) = ni env l ++ ni env r
1231 ni env (PPair _ l r) = ni env l ++ ni env r
1232 ni env (PDPair _ (PRef _ n) t r) = ni env t ++ ni (n:env) r
1233 ni env (PDPair _ l t r) = ni env l ++ ni env t ++ ni env r
1234 ni env (PAlternative a as) = concatMap (ni env) as
1235 ni env (PHidden tm) = ni env tm
1236 ni env (PUnifyLog tm) = ni env tm
1237 ni env _ = []
1239-- Return which of the given names are used in the given term.
1241usedNamesIn :: [Name] -> IState -> PTerm -> [Name]
1242usedNamesIn vars ist tm = nub $ ni [] tm
1243 where
1244 ni env (PRef _ n)
1245 | n `elem` vars && not (n `elem` env)
1246 = case lookupTy n (tt_ctxt ist) of
1247 [] -> [n]
1248 _ -> []
1249 ni env (PApp _ f as) = ni env f ++ concatMap (ni env) (map getTm as)
1250 ni env (PCase _ c os) = ni env c ++ concatMap (ni env) (map snd os)
1251 ni env (PLam n ty sc) = ni env ty ++ ni (n:env) sc
1252 ni env (PPi _ n ty sc) = ni env ty ++ ni (n:env) sc
1253 ni env (PEq _ l r) = ni env l ++ ni env r
1254 ni env (PRewrite _ l r _) = ni env l ++ ni env r
1255 ni env (PTyped l r) = ni env l ++ ni env r
1256 ni env (PPair _ l r) = ni env l ++ ni env r
1257 ni env (PDPair _ (PRef _ n) t r) = ni env t ++ ni (n:env) r
1258 ni env (PDPair _ l t r) = ni env l ++ ni env t ++ ni env r
1259 ni env (PAlternative a as) = concatMap (ni env) as
1260 ni env (PHidden tm) = ni env tm
1261 ni env (PUnifyLog tm) = ni env tm
1262 ni env _ = []