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