JXU*      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                                                                                             ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~                                                        !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrst u v w x y z { | } ~                              !!!!!!!!"""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""############## # # # # ################### #!#"###$#%#&#'#(#)#*#+#,#-#.#/#0#1#2#3#4#5#6#7#8#9#:#;#<#=#>#?#@#A#B#C#D#E#F#G#H#I#J#K#L#M#N#O#P#Q#R#S#T#U#V#W#X#Y#Z#[#\#]#^#_#`#a#b#c#d#e#f#g#h#i#j#k#l#m#n#o#p#q#r#s#t#u#v#w#x#y#z#{#|#}#~$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$ $ $ $ $ $$$$$$$$$$$$$$$$$$$ $!$"$#$$$%$&$'$($)$*$+$,$-$.$/$0$1$2$3$4$5$6$7$8$9$:$;$<$=$>$?$@$A$B$C$D$E$F$G$H$I$J$K$L$M$N$O$P$Q$R$S$T$U$V$W$X$Y$Z$[$\$]$^$_$`$a$b$c$d$e$f$g$h$i$j$k$l$m$n$o$p$q$r$s$t$u$v$w$x$y$z${$|$}$~$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ !$ "$ #$ $$ %$ &$ '$ ($ )$ *$ +$ ,$ -$ .$ /$ 0$ 1$ 2$ 3$ 4$ 5$ 6$ 7$ 8$ 9$ :$ ;$ <$ =$ >$ ?$ @$ A$ B$ C$ D$ E$ F$ G$ H$ I$ J$ K$ L$ M$ N$ O$ P$ Q$ R$ S$ T$ U$ V$ W$ X$ Y$ Z$ [$ \$ ]$ ^$ _$ `$ a$ b$ c$ d$ e$ f$ g$ h$ i$ j$ k$ l$ m$ n$ o$ p$ q$ r$ s$ t$ u$ v$ w$ x$ y$ z$ {$ |$ }$ ~$ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ !$ "$ #$ $$ %$ &$ '$ ($ )$ *$ +$ ,$ -$ .$ /$ 0$ 1$ 2$ 3$ 4$ 5$ 6$ 7$ 8$ 9$ :$ ;$ <$ =$ >$ ?$ @$ A$ B$ C$ D$ E$ F$ G$ H$ I$ J$ K$ L$ M$ N$ O$ P$ Q$ R$ S$ T$ U$ V$ W$ X$ Y$ Z$ [$ \$ ]$ ^$ _$ `$ a$ b$ c$ d$ e$ f$ g$ h$ i$ j$ k$ l$ m$ n$ o$ p$ q$ r$ s$ t$ u$ v$ w$ x$ y% z% {% |% }% ~% % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % & & & & & & & & & & & & & & & & & ' ( ( ( ( ( ( ( ( ( ( ( ( ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) !) ") #) $) %) &) ') () )) *) +) ,) -) .) /) 0) 1) 2) 3) 4) 5) 6) 7) 8) 9) :) ;) <) =) >) ?) @) A) B) C) D) E) F) G) H) I) J) K) L) M) N) O) P) Q) R) S) T) U) V) W) X) Y) Z) [) \) ]) ^) _) `) a) b) c) d) e) f) g) h) i) j) k) l) m) n) o) p) q) r) s) t) u) v) w) x) y) z) {) |) }) ~) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) * * + + + + , , - - . / 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 !4 "4 #4 $4 %5 &5 '5 (5 )5 *5 +5 ,5 -5 .5 /5 05 15 25 35 45 55 65 75 85 95 :5 ;5 <5 =5 >5 ?5 @5 A5 B5 C5 D6 E6 F6 G6 H6 I6 J6 K6 L6 M6 N6 O6 P6 Q6 R6 S7 T7 U7 V7 W7 X7 Y7 Z7 [7 \7 ]7 ^7 _7 `7 a7 b7 c7 d7 e7 f7 g7 h7 i7 j7 k7 l7 m7 n7 o7 p7 q7 r7 s7 t7 u7 v7 w7 x7 y7 z7 {7 |7 }7 ~7 7 7 7 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 9 9 9 9 9 9 9 9 9 9 9 9 : : : : : : : : ; ; ; ; ; ; ; < < < < < < < < < < < < < < < < < < < < = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = > > > > > > > > > > > > > > > > > > > > > > > > ? @ @ @ @ !@ "@ #@ $@ %@ &@ '@ (@ )@ *@ +@ ,@ -@ .@ /@ 0@ 1@ 2@ 3@ 4@ 5@ 6@ 7@ 8@ 9@ :@ ;@ <@ =@ >@ ?@ @@ A@ B@ C@ D@ E@ F@ G@ H@ I@ J@ K@ L@ M@ N@ O@ P@ Q@ R@ S@ T@ U@ V@ W@ X@ Y@ Z@ [@ \@ ]A ^A _A `A aA bA cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB sB tB uB vB wB xB yB zB {B |B }B ~B B B B B B B B B B B B B B B B B B C C C D D D D D D D D D D D D D D D D D E F F F F F F F F F G G H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H HHHHHHHHHH I I I I IIIIIIIJJJJKKKKKKKK K!K"K#K$K%K&K'K(K)K*K+K,K-K.K/K0K1K2K3K4K5K6K7K8K9K:K;K<K=K>K?K@KAKBKCKDKEKFKGLHLILJLKLLMMMNMOMPMQNRNSNTNUNVNWNXNYNZN[N\N]N^N_O`PaQbQcRdSeTfUgUhUiUjUkUlUmUnUoVpWqXrXsXtXuXvXwYxYyYzY{Y|Y}Y~YYYYYYYYYYYYZZZZ[[[\\\]]]]]]]]]]^^^^^^^^________```````````aabbbbbbbbbbbbbccccccdeeefffffffffffffffffgggghhhhhhhiiijjjjjjjjjjjjjjjjjjjjkkkl l l l l lllllmmmmmmmmmmmmmm m!m"m#m$m%m&m'm(m)msnSafeh*The JavaScript AST.BSD3The Idris Community.Safe1e3  !"#$%&'()*+,-./0123  !"#$%&'()/.0*+,12-  !"#$%&'()!Support for colours within Idris.BSD3The Idris Community.Safe6S$Idris's default console colour theme+9Compute the ANSI colours corresponding to an Idris colourT3Set the colour of a string using POSIX escape codesU?Start a colour on a handle, to support colour output on WindowsVEnd a colour region on a handle,CSet the colour of a string using POSIX escape codes, with trailing '\STX'? denoting the end (required by Haskeline in the prompt string)'9:;<=>?@ABCDEFGHIJKLMNQPORSTUVWXYZ[\]^_'LMNOPQRBCDEFGHIJKSWXY_[Z\^]T9:;<=>?@AUV9:;<=>?@AB CDEFGHIJKLMNOPQR-Utilities to aid with the REPL's HELP system.BSD3The Idris Community.Safe jThe command takes an expressionkThe command takes a namelThe command takes a filem&The command takes a shell command namenThe command takes a module nameo)The command takes a list of package namespThe command takes a numberq"The command takes a namespace namerThe command takes an options The command takes a metavariablet)The command is the colour-setting commanduNo completion (yet!?)v do not usewThe width of the consolex5An Idris declaration, as might be contained in a filey$Zero or more of one kind of argumentz#Zero or one of one kind of argument{(One kind of argument followed by another|6Use these for completion, but don't show them in :helpiujklmnopqrstvwxyz{|ijklmnopqrstuvwxyz{|ijklmnopqrstuvwxyz{oSafeM~-./0123*Utilities for interacting with the System.BSD3The Idris Community.Safe4Sub directory in 0 location..Environment variable to get new location from. ~ ~pSafe56jPlatform-specific dynamic linking support. Add new platforms to this file through conditional compilation.BSD3The Idris Community.SafeCV qUtilities for Network IO.BSD3The Idris Community.Nones78rUtilities for Pretty Printing.BSD3The Idris Community.Safe>?^9:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~The core language of Idris, TT.BSD3The Idris Community.None 13456;<=>?Ag ... The  flag says whether it was a scoped implicit (i.e. forall bound) in the high level Idris, but otherwise has no relevance in TT.A binding that occurs in a let expressionNLet is an intermediate product in the evaluator that's used for temporarily naming locals during reduction. It won't occur outside the evaluator.rA hole in a term under construction in the elaborator. If this is not filled during elaboration, it is an error.A saved TT hole that will later be converted to a top-level Idris metavariable applied to all elements of its local environment.A provided value for a hole. It will later be substituted - the guess is to keep it computationally inert while working on other things if necessary.UA pattern variable (these are bound around terms that make up pattern-match clauses)The type of a pattern binding"type annotation for bound variablevalue for bound variable}Contexts allow us to map names to things. A root name maps to a collection of things in different namespaces with that name.xNames are hierarchies of strings, describing scope (so no danger of duplicate names, but need to be careful on lookup).User-provided nameRoot, namespacesMachine chosen names Decorated function names!>Reference to IBC file symbol table (used during serialisation)&eIdris errors. Used as exceptions in the compiler, but reported to users if they reach the top level.<8Location, bad universe, old domain, new domain, suspectsNNUser-specified message, proof term, goals with context (first goal is focused)P8The error occurred during a top-level elaboration scriptYUsed for error reflection_&Output annotations for pretty-printing`B^ The name, classification, docs overview, and pretty-printed typea%^ The name and whether it is implicitctype, doc overviewdname, doc overviewhA link to this URLi pprint bound vars, original termj*more general, isomorphic, or more specificlA namespace (e.g. on an import line or in a namespace declaration). Stored starting at the root, with the hierarchy fully resolved. If a file path is present, then the namespace represents a module imported from that file.o0type of syntax element: backslash or braces etc.pText formatting outputt:Output annotation for pretty-printed name - decides colourzFC with equality}1Source location. These are typically produced by 6s%Locations for machine-generated termsLocations with file onlyFilename:Line and column numbers for the start of the location span8Line and column numbers for the end of the location span/Give a notion of filename associated with an FC5Give a notion of start location associated with an FC3Give a notion of end location associated with an FCJDetermine whether the first argument is completely contained in the secondEmpty source locationSource location with file onlyReturn True if the argument 3 should be interpreted as the name of a interface.xLook up a name in the context, given an optional namespace. The name (n) may itself have a (partial) namespace given.Rules for resolution:jif an explicit namespace is given, return the names which match it. If none match, return all names.sif the name has has explicit namespace given, return the names which match it and ignore the given namespace.otherwise, return all names.7Determines whether the input constant represents a typeGet the docstring for a ConstA term is injective iff it is a data constructor, type constructor, constant, the type Type, pi-binding, or an application of an injective term.FReplace the outermost (index 0) de Bruijn variable with the given termAs , but also decrement the indices of all de Bruijn variables remaining in the term, so that there are no more references to the variable that has been substituted.jReplace all non-free de Bruijn references in the given term with references to the name of their binding. Replace references to the given /-like id with references to de Bruijn index 0.9Convert several names. First in the list comes out as V 0Replace de Bruijn indices in the given term with explicit references to the names of the bindings they refer to. It is an error if the given term contains free de Bruijn indices.dReplace every non-free reference to the name of a binding in the given term with a de Bruijn index.As , but in addition to replacing  0#, replace references to the given  -like id.As [, but takes a list of (name, substitution) pairs instead of a single name and substitution*Replaces all terms equal (in the sense of (==)%) to the old term with the new term.<Return number of occurrences of V 0 or bound name i the term=Returns true if V 0 and bound name n do not occur in the term'Returns all names used free in the term'Return the arity of a (normalised) typeHDeconstruct an application; returns the function and a list of argumentsxReturns a term representing the application of the first argument (a function) to every element of the second argument.sHard-code a heuristic maximum term size, to prevent attempts to serialize or force infinite or just gigantic termsCast a  term to a  value, discarding universe information and the types of named references and replacing all de Bruijn indices with the corresponding name. It is an error if there are free de Bruijn indices. Introduce a Q into the given term for each element of the given list of (name, binder) pairs.Like  , but the s are 9 terms instead. The first argument is a function to map TT terms to Binder0s. This function might often be something like , which directly constructs a Binder from a TT term.5Return a list of pairs of the names of the outermost ?-bound variables in the given term, together with their types.7As getRetTy but substitutes names for de Bruijn indices?Check whether a term has any hole bindings in it - impure if soPWeaken a term by adding i to each de Bruijn index (i.e. lift it over i bindings)kWeaken an environment so that all the de Bruijn indices are correct according to the latest bound variable8Weaken every term in the environment by the given amountPretty-print a termPretty-print a raw term.4Pretty-printer helper for the binding site of a nameHIgnore source location equality (so deriving classes do not compare FCs)The id to replace The replacement term The term to replace in  Old term  New term template term 8The bound names (for highlighting and de Bruijn indices)The term to be printedBound names, for highlightingThe term to pretty-print^ the bound name^ whether the name is implicitR      !"$#%&G'()*+,-./0123456789:;<=>?@ABCDEFHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~b%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRYZ[\]^}~z{|     !tuvwxy _`abcdefghijklmnoSTUVWX"#$pqrs         !"#$&,'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~,Turn literate programs into normal programs.BSD3The Idris Community.Nonewt Wrapper around Markdown library.BSD3The Idris Community.None3456V Block-level elements.Representation of Idris's inline documentation. The type paramter represents the type of terms that are associated with code blocks.>The various kinds of code samples that can be embedded in docs"Render a term in the documentationRun some kind of processing step over code in a Docstring. The code processor gets the language and annotations as parameters, along with the source and the original annotation.GConstruct a docstring from a Text that contains Markdown-formatted docs5Convert a docstring to be shown by the pretty-printersConstruct a docstring consisting of the first block-level element of the argument docstring, for use in summaries.The empty docstring"Check whether a docstring is emtpy$Empty documentation for a definition%Does a string occur in the docstring?(Annotate the code samples in a docstringHow to annotate code samples&&  Check universe constraints.BSD3The Idris Community.None<>?;Check that a list of universe constraints can be satisfied.variables in a constraint .Module to define and interact with case trees.BSD3The Idris Community.None36;<=reflection functioninvariant: lowest tags first<special case for projections/thunk-forcing before inspection error message already checked to be impossibleReturn all called functions, and which arguments are used in each argument position for the call, in order to help reduce compilation time, and trace all unused arguments?Convert single branches to projections (only useful at runtime)""  Evaluate Idris expressions.BSD3The Idris Community.None6;=>?Contexts used for global definitions and for proof state. They contain universe constraints and existing definitions. Also store maximum RigCount of the name (can't bind a name at multiplicity 1 in a RigW, for example) No meta-information CMeta information for a data declaration with position of parameters 'Reasons why a function may not be totalThe result of totality checkingwell-founded arguments productive+5A definition is either a simple function (just an expression with a type), a constant, which could be a data or type constructor, an axiom or as an yet undefined function, or an Operator. An Operator is a function which explains how to reduce. A CaseOp is a function defined by a simple case tree 2A HOAS representation of valueswhether to expand lets or not@ONormalise fully type checked terms (so, assume all names/let bindings resolved)A9Normalise everything, whether abstract, private or publicBCAs normaliseAll, but with an explicit list of names *not* to reduceHYLike normalise, but we only reduce functions that are marked as okay to inline, and letsIeLike simplify, but we only reduce functions that are marked as okay to inline, and don't reduce letsJ+Simplify for run-time (i.e. basic inlining)KSUnfold the given names in a term, the given number of times in a stack. Preserves 'let'V. This is primarily to support inlining of the given names, and can also help with partial evaluation by allowing a rescursive definition to be unfolded once only. Specifically used to unfold definitions using interfaces before going to the totality checker (otherwise mutually recursive definitions in implementations will not work...)Evaluate in a context of locally named things (i.e. not de Bruijn indexed, such as we might have during construction of a proof)OThe initial empty contextQ"Get the definitions from a context_SGet the list of pairs of fully-qualified names and their types that match some name`nGet the pair of a fully-qualified name and its type, if there is a unique one matching the name used as a key.a"Get the types that match some nameb4Get the single type that matches some name preciselyc}Return true if the given type is a concrete type familyor primitive False it it's a function to compute a type or a variablef=Check whether a resolved name is certainly a data constructorg=Check whether any overloading of a name is a data constructor;Create a unique name given context and other existing names|     ! "#$%&'()*+.,-/0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~~CD@ABEFJHIGKNM+,-./"#$%&'()* !     OQRSTUVWXYZ[\]^_`ablmopnqr}Pzstwuv|{~icfgedhj23456789:;<=>01?kLxy       !"#$%&'()*+,-./012 3456789:;<=> "Reduction to Weak Head Normal FormBSD3The Idris Community.None<LA WHNF is a top level term evaluated in the empty environment. It is always headed by either an irreducible expression, i.e. a constructor, a lambda, a constant, or a postulateEvery  or  in this structure is associated with the environment it was encountered in, so that when we quote back to a term we get the substitutions right.data constructortype constructor%irreducible global (e.g. a postulate)bA stack entry consists of a term and the environment it is to be evaluated in (i.e. it's a thunk)'Reduce a term to weak head normal form.0Reduce a type so that all arguments are expanded  Idris' unification code.BSD3The Idris Community.None<PSmart constructor for unification errors that takes into account the FailContext  Idris' type checker.BSD3The Idris Community.None3;<=>?Е)Proof term. implementation and utilities.BSD3The Idris Community.None;=>? FA zipper over binders, because terms and binders are mutually defined.@A zipper over terms, in order to efficiently update proof terms.kReplace the top of a term path with another term path. In other words, "graft" one term path into another.?Build a term from a zipper, given something to put in the hole.ABuild a binder from a zipper, given something to put in the hole.Find the binding of a hole in a term. If present, return the path to the hole's binding, the environment extended by the binders that are crossed, and the actual binding term.jRefocus the proof term zipper on a particular hole, if it exists. If not, return the original proof term.)Is a particular binder a hole or a guess?>Given a list of solved holes, fill out the solutions in a termGiven a list of solved holes, fill out the solutions in a term. Return whether updates were performed, to facilitate sharing when there are no updates.As W, in TT, but takes advantage of knowing not to substitute under Complete applications."Apply solutions to an environment.'Fill out solved holes in a term zipper.The id to replace The replacement term The term to replace in NFData instances for TT.BSD3The Idris Community.None%;=<QForcing the contents of a context, for diagnosing and working around space leaks%'Binary instances for the core datatypesBSD3The Idris Community.None;=     Idris' IDE ModeBSD3The Idris Community.None;=L&^ Recursive?, line, name, hints, depth1^ the Int is the column count for pretty-printing?aThe version of the IDE mode command set. Increment this when you change it so clients can adapt.2 !"#$%&'()*+-,./0123456789:;<=>?3=>+,- !"#$%&'()*<234567812./0?:9; !"#$%&'()*+,-./012345678-Internal representation of Idris' constructs.BSD3The Idris Community.None136<RSTUVWXZY[\_^]`ihgfedcbajmlkn~}|{zyxwvutsrqponopqrstuvwxyz{|}~jklm`abcdefghi\]^_[XYZWTUVRS RSTUVXYZ\]^_` abcdefghijklmnBopqrstuvwxyz{|}~"Provision of primitive data types.BSD3The Idris Community.NoneQV                 &Transformations to apply to Idris' IR.BSD3The Idris Community.None3Inline inside a declaration.Variables are still Name at this stage. Need to preserve uniqueness of variable names in the resulting definition, so invent a new name for every variable we encounterThe JavaScript specializer.BSD3The Idris Community.None$The JavaScript primitive operations.BSD3The Idris Community.None0The JavaScript name mangler.BSD3The Idris Community.Nonep  !"#$%&'() $%"#&' !() !"#%The JavaScript LDecl Transformations.BSD3The Idris Community.None01././Defunctionalise Idris' IR.BSD3The Idris Community.None<o_ADivide up a large case expression so that each has a maximum of  branchesRSTVUWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`a,CDEFGHIJKLMNOP?@AB<=>;QRST789:UVWXYZ[\]^b_`a789:<=>?@ABC DEFGHIJKLMNOPVSimplified expressions, where functions/constructors can only be applied to variables.BSD3The Idris Community.None<Simplify an expression by let-binding argument expressions that are not variables The boolean parameter indicates whether the expression is at tail call position.Let-bind a list of expressions to variables and construct the inner expression with the bound variables. If an expression in the list is already a variable we don t bind it again.Special case of  for just one expressionhijklmnzvopqrstuwxy{||hinopqrstuvwxyz{jklmhijklmn opqrstuvwxyz{Inline expressions.BSD3The Idris Community.None8Common data structures required for all code generators.BSD3The Idris Community.None65Everything which might be needed in a code generator.A CG can choose which level of Decls to generate code from (simplified, defunctionalised or merely lambda lifted) and has access to the list of object files, libraries, etc.Compiler options for Idris.BSD3The Idris Community.None136', 5Recognised logging categories for the Idris compiler.@TODO add in sub categories.&partial eval and associated transformsHow wide is the console?:Have pretty-printer assume that lines should not be broken%Manually specified - must be positive+Attempt to determine width, or 80 otherwise REPL TCP port #Automatically adjust terminal width BAutomatically issue "solve" tactic in old-style interactive prover5Don't show deprecation warnings for old-style tactics)Allow pattern variables to be capitalized sReturns None if given an Opt which is not PkgMkDoc Otherwise returns Just x, where x is the contents of PkgMkDoc Opt to extractResult!the option to extractthe package file to test      !"#$%&'()*+,-./     -"#,$'%)*+(& !./ I     [Bytecode for a stack based VM (e.g. for generating C code with an accurate hand written GC)BSD3The Idris Community.NoneHL reg1 = reg2M reg = constN&reg1 = reg2 (same as assign, it seems)Oreg = constructor, where constructor consists of a tag and values from registers, e.g. (cons tag args) the 'Maybe Reg', if set, is a register which can be overwritten (i.e. safe for mutable update), though this can be ignoredPRMatching on value of reg: usually (but not always) there are constructors, hence Int for patterns (that's a tag on which we should match), and the following [BC] is just a list of instructions for the corresponding case. The last argument is for default case. When it's not necessary a constructor in the reg, the Bool should be False, indicating that it's not safe to work with that as with a constructor, so a check should be added. If it's not a constructor, default case should be used.Qget a value from register, which should be a constructor, and put its arguments into the stack, starting from (base + int1) and onwards; second Int provides arityRprobably not usedSAsame as CASE, but there's an exact value (not constructor) in regT9just call a function, passing MYOLDBASE (see below) to itU!same, perhaps exists just for TCOVset reg to (apply string args),W-move this number of elements from TOP to BASEXset BASE = OLDBASEYIreserve n more stack items (i.e. check there's space, grow if necessary)Zmove the top of stack up[set TOP = BASE + n\set BASE = TOP + n]set MYOLDBASE = BASE, where MYOLDBASE is a function-local variable, set to OLDBASE by default, and passed on function call to called functions as their OLDBASE^#reg = apply primitive_function args_ clear reg`throw an error&K`_]\[ZYXWVUTSRQPONML^aebdcfghijklmnop&abcdeKLMNOPQRSTUVWXYZ[\]^_`fghijklmnopKLMNOPQRSTUVWXYZ[\]^_`abcde Serialise Idris' IR to JSON.BSD3The Idris Community.None;=KVtt!"Serialise Idris to its IBC format.BSD3The Idris Community.NoneL"Proof state implementation.BSD3The Idris Community.None;<=>?Y holes still to be solvedused names, don't use again%name supply, for locally unique names\a mirror of the global name supply, for generating things like type tags in reflectioncurrent proof term original goal(explicitly given by programmer, leave itUdot pattern holes + environment either hole or something in env must turn up in the  list during elaborationnames we'll need to define)implementation arguments (for interfaces) unsolved auto implicits with their holes'Local names okay to use in proof searchfor undo#the name of what's to be elaboratedcurrent source filethe current global context0the value of the idris_datatypes field of IState+the value of the idris_name field of IState the goal typeXX,#vA high level language of tactic composition, for building elaborators from a high level language into the core theory.BSD3The Idris Community.None;=>?  zTransform the error returned by an elaboration script, preserving location information and proof search failure messages.Modify the auxiliary stateGet the auxiliary state#Set whether to show the unifier log4Process a tactic within the current elaborator stateGet the global contextrUpdate the context. (should only be used for adding temporary definitions or all sorts of stuff could go wrong)!get the proof term"modify the proof term#4get the local context at the currently in focus hole(\Return recently solved names (that is, the names solved since the last call to get_recents))get the current goal type+2Get the guess at the current hole, if there is one,Typecheck locally.-get holes we've deferred for later definition0!get implementation argument names1get auto argument names24given a desired hole name, return a unique hole nameSTurn the current hole into a pattern variable with the provided name, made unique if not the same as the head of the hole queueTaTurn the current hole into a pattern variable with the provided name, but don't make MNs unique.ZSet the zipper in the proof state to point at the current sub term (This currently happens automatically, so this will have no effect...)fKPrepare to apply a function by creating holes to be filled by the argumentsgEApply an operator, solving some arguments by unification or matching.hEApply an operator, solving some arguments by unification or matching.#the name of what's to be elaboratedthe current source filethe current global context0the value of the idris_datatypes field of IState+the value of the idris_name field of IState the goal typefThe operation being appliedWhether arguments are implicitWThe names of the arguments and their holes to be filled with elaborated argument valuesgThe operator to applyVFor each argument, whether to attempt to solve it and the priority in which to do sohThe operator to applyVFor each argument, whether to attempt to solve it and the priority in which to do so      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|$$Core data definitions used in Idris.BSD3The Idris Community.None 13456;<=>?=пYinterface methods. When expanding implicits, these should be expanded even under bindersSyntactic sugar info)Miscellaneous information about functions(a function with a partially defined type.possible solutions to a metavariable in a type!flag whether it's a "data" methodmethod name -> default impl^the Bool is whether to include in implementation search, so named implementations are excludedtrue if the machine inferred it"second FC is precise name location"second FC is precise name location)the bool is whether to search recursively "flag sets whether delay is allowedHigh level language terms6Inclusion of a core term into the high-level languageA reference to a variable. The FC is its precise source location for highlighting. The list of FCs is a collection of additional highlighting locations.A name to be defined laterA pattern variable-A lambda abstraction. Second FC is name span.H(n : t1) -> t2, where the FC is for the precise location of the variable2A let binding (second FC is precise name location)Term with explicit typee.g. IO (), List Char, length xApplication plus a with argumentBImplicit argument application (introduced during elaboration only)implicitly bound application$Make an application by type matchingDConditional expressions - elaborated to an overloading of ifThenElseWA case expression. Args are source location, scrutinee, and a list of pattern/RHS pairs Unit type..?-Solve this dictionary by interface resolution L"rewrite" syntax, with optional rewriting function and optional result type!vA pair (a, b) and whether it's a product type or a pair (solved by elaboration). The list of FCs is its punctuation."A dependent pair (tm : a ** b) and whether it's a sigma type or a pair that inhabits one (solved by elaboration). The [FC] is its punctuation.#@-pattern, valid LHS only$H(| A, B, C|). Includes unapplied unique name mappings for mkUniqueNames.%Irrelevant or hidden pattern& type' Some universe()quoteGoal, used for %reflection functions) Builtin types* Underscore+ Do notation,Idiom brackets-/A metavariable, ?name, and its precise location. Proof script/As PProof, but no auto solving0Error to report on elaboration16Special case for declaring when an LHS can't typecheck25To mark a coerced argument, so as not to coerce twice3#Preferences for explicit namespaces4/dump a trace of unifications when building term5)never run implicit converions on the term6`(Term [: Term])7~Term8`{n} where the FC is the precise highlighting for the name in particular. If the Bool is False, then it's `{{n}} and the name won't be resolved.9V%runElab tm - New-style proof script. Args are location, script, enclosing namespace.:cA desugared constant. The FC is a precise source location that will be used to highlight it later.BData declarationCData declarationD Placeholder. for data whose constructors are defined laterEThe name of the datatypeF1The precise location of the type constructor nameGType constructorH ConstructorsIIOne clause of a top-level definition. Term arguments to constructors are: ^The whole application (missing for PClauseR and PWithR because they're within a "with" clause)The list of extra with patternsThe right-hand sideThe where block (PDecl' t)JA normal top-level definition.OFor elaborator stateUnames bound as auto implicitsV6Implicit warnings to report (location and global name)WA set of instructions for things that need to happen in IState after a term elaboration when there's been reflected elaboration.\Datatype, constructors]The set of source directivesr[Top-level declarations such as compiler directives, definitions, datatypes and interfaces.sFixity declarationt3Type declaration (last FC is precise name location)u-Postulate, second FC is precise name locationvPattern clausewTop level constantxData declaration.y Params blockzOpen block/declaration{JNew namespace, where FC is accurate location of the namespace in the file| Record name.}Interface: arguments are documentation, syntax info, source location, constraints, interface name, interface name location, parameters, method declarations, optional constructor name~Implementation declaration: arguments are documentation, syntax info, source location, constraints, interface name, parameters, full Implementation type, optional explicit name, and definitionsDSL declarationSyntax definition Mutual blockCompiler directive.pType provider. The first t is the type, the second is the term. The second FC is precise highlighting location.XSource-to-source transformation rule. If bool is True, lhs and rhs must be convertible.BFC is decl-level, for errors, and Strings represent the namespaceType provider - what to provide2the first is the goal type, the second is the term$goal type must be Type, so only term always evaluate when simplifying8all delayed arguments guaranteed guarded by constructorsZinterface dictionary, eval only when a function argument, and further evaluation results.&Interface dictionary which may overlapimplicit coerciondo not apply implicit coercionsexport, with a C name;an error handler for use with the ErrorReflection extension4attempt to reverse normalise before showing in error)unfold definition before showing an error(a reflecting function, compile-time only!specialise it, freeze these namesData constructor typeuse in auto implicit searchgenerated by partial evaluator3Marked static, to be evaluated by partial evaluator#this is a param (rather than index)Nothing, if top levelExplicitly written in source3Mark bindings with their explicitness, and lazinessqThe monad for the main REPL - reading and processing files and updating global state (hence the IO inner monad). C type Idris = WriterT [Either String (IO ())] (State IState a)) True = import publicThe main context.6The name is the special name used to track module docs (The global state used in the Idris monad /All the currently defined names and their terms GA list of universe constraints and their corresponding source locations !Currently defined infix operators 4Privileged implementations, will resolve immediately Hlist of lhs/rhs, and a list of missing clauses. These are not exported. name, args used in each pos gmodule documentation is saved in a special MN so the context mechanism can be used for disambiguation. names to check totality on names to check at the end #Full application LHS on source line The currently defined but not proven metavariables. The Int is the number of vars to display as a context, the Maybe Name is its top-level function, the [Name] is the list of local variables available for proof search and the Bools are whether :p is allowed, and whether the variable is definable at all (Metavariables are not definable if they are applied in a term which still has hole bindings) #The imported modules )'Imported ibc file names, whether public ;Global error handlers =Specific error handlers ?#How many chars wide is the console? B4Function/constructor name, argument position is used CFList of names that were defined in the repl, and can be re-/un-defined DStack of names currently being elaborated, Bool set if it's an implementation (implementations appear twice; also as a function name) E)Symbol table (preserves sharing of names) FFunctions with ExportList G"Highlighting information to output H(Highlighting information from the parser I Deprecated names and explanation JNames defined in current module LFragile names and explanation. N.Configuration options for interactive editing. R<If a function has no totality annotation, what do we assume? STotal TPartial UTotal coverage, but may diverge VThe output mode in use W(Print user output directly to the handle X1Send IDE output for some request ID to the handle [whether to show implicits ]$whether to show names in pi bindings _,whether to display multiplicities in binders cList of logging categories. gshow implicits tremember whole command line v,automatically apply "solve" tactic in prover w$List of modules to auto import i.e. `Builtins+Prelude` znormalise types in `:t` }hData to pass to recursively called elaborators; e.g. for where blocks, paramaterised declarations, etc.rec_elabDecl is used to pass the top level elaborator into other elaborators, so that we can have mutually recursive elaborators in separate modules without having to muck about with cyclic modules. $names in the block, and their params +filename for adding to constraint variables types which shouldn't be made arguments to case | We may, recursively, collect transformations to do on the rhs, e.g. rewriting recursive calls to functions defined by with /Pretty printing options with default verbosity. 0Pretty printing options with the most verbosity. 8Get pretty printing options from the big options record. 7Get pretty printing options from an idris state record. "The initial state for the compiler Transform the FCs in a PData and its associated terms. The first function transforms the general-purpose FCs, and the second transforms those that are used for semantic source highlighting, so they can be treated specially. Transform the FCs in a PTerm. The first function transforms the general-purpose FCs, and the second transforms those that are used for semantic source highlighting, so they can be treated specially. +Get all the names declared in a declaration Transform the FCs in a PTerm. The first function transforms the general-purpose FCs, and the second transforms those that are used for semantic source highlighting, so they can be treated specially. +Get the highest FC in a term, if one exists The special name to be used in the module documentation context - not for use in the main definition context. The namespace around it will determine the module to which the docs adhere. Colourise annotations according to an Idris state. It ignores the names in the annotation, as there's no good way to show extended information on a terminal. 7Colourise annotations according to an Idris state. It ignores the names in the annotation, as there's no good way to show extended information on a terminal. Note that strings produced this way will not be coloured on Windows, so the use of the colour rendering functions in Idris.Output is to be preferred. _Pretty-print a high-level closed Idris term with no information about precedence/associativity >Serialise something to base64 using its Binary implementation.4Do the right thing for rendering a term in an IState OPretty-print a high-level Idris term in some bindings context with infix info.  Strip away namespace information UDetermine whether a name was the one inserted for a hole or guess by the delaborator QCheck whether a PTerm has been delaborated from a Term containing a Hole or Guess EPretty-printer helper for names that attaches the correct annotations Show Idris name &Show a term with implicits, no colours !Show a term with specific options pretty printing optionsthe term to pretty-print pretty printing options7the currently-bound names and whether they are implicit,names to always show in pi, even if not usedFixity declarationsthe term to pretty-print Cwhether the name should be parenthesised if it is an infix operatorwhether to show namespaces9the current bound variables and whether they are implicitthe name to pprint 8the Idris state, for information about names and colours0the bound variables and whether they're implicitpretty printing optionswhether to colourisethe term to show >the Idris state, for information about identifiers and coloursthe term to show|~     :9876543210/.-,+*)('&%$#"! ;>=<?@ABDCGFEHIMLKJNOPVUTSRQW\[ZYX]qponmlkjihgfedcba`_^r~}|{zyxwvuts  M L K J I H G F E D C B A @ ? > = < ; : 9 7 6 5 4 3 2 1 0 / . - , + * ) ( ' & % $ # " !                     8      N O Q P R U T S V W X Y Z _ ^ ] \ [ ` a | { z y x w v u t s r q p o n m l k j i h g f e d c b } ~   } ~  ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | Y Z [ \ ] ^ _ V W X R S T U N O P Q                           ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M        rstuvwxyz{|}~]^_`abcdefghijklmnopqWXYZ[\OPQRSTUV N IJKLMBCDEFGHEFG A@? ;<=> !"#$%&'()*+,-./0123456789:          ~      +~  &     , !"#$%&'()*+,-./0123456789:;<=>B CDEFGHEFGIJKLMOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ 0 M                           ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~   %!NFData instances for Idris' typesBSD3The Idris Community.None\9  ~ } | { z y&This implements just a few basic lens-like concepts to ease state updates. Similar to fclabels in approach, just without the extra dependency.BSD3The Idris Community.None>?g JExact-name context lookup; uses Nothing for deleted values (read+write!).`Reading a non-existing value yields Nothing, writing Nothing deletes the value (if it existed). 2the optimisation record for the given (exact) name %two fields of the optimisation record +callgraph record for the given (exact) name Commandline flags  TT ContextcThis has a terrible name, but I'm not sure of a better one that isn't confusingly close to tt_ctxt Names defined at the repl  Fixity declarations in an IState   '#Utilities for getting screen width.BSD3The Idris Community.Safeix  (*Utilities for interacting with the system.BSD3The Idris Community.Safet @Create a temp file with the extensiom ext (in the format ".xxx") IRead a source file, same as readFile but make sure the encoding is utf-8. Read a source file, make sure that the it all has been read before exiting the function. | This is useful when we want to write the file again and need it to be closed. JWrite a source file, same as writeFile except the encoding is set to utf-8 #Write a utf-8 source file from TextReturn m if the process's standard output is attached to a MinTTY console (e.g., Cygwin or MSYS) on Windows. Return   otherwise.3Unfortunately, we must check this separately since   always returns   on MinTTY consoles. )7Provides Idris' core data definitions and utility code.BSD3The Idris Community.None3<S Transforms are organised by the function being applied on the lhs of the transform, to make looking up appropriate transforms quicker tAdd transformation rules from a definition, which will reverse the definition for an error to make it more readable cSay that the name should always be reduced in error messages, to help readability/error reflection 3get the accessibility of a name outside this module wAdds error handlers for a particular function and argument. If names are ambiguous, all matching handlers are updated. >Trace all the names in a call graph starting at the given name )Add an interface implementation function.>Precondition: the implementation should have the correct type.]Dodgy hack 1: Put integer implementations first in the list so they are resolved by default.3Dodgy hack 2: put constraint chasers (ParentN) last "Add a privileged implementation - one which implementation search will happily resolve immediately if it is type correct This is used for naming parent implementations when defining an implementation with constraints. Returns the old list, so we can revert easily at the end of a block !Used to preserve sharing of names (PA version of liftIO that puts errors into the exception type of the Idris monad *InternalApp keeps track of the real function application for making case splits from, not the application the programmer wrote, which doesn't have the whole context in any case other than top level definitions ,WPattern definitions are only used for coverage checking, so erase them when we're done -Erase types from Ps in the context (basically ending up with what's in the .ibc, which is all we need after all the analysis is done) 55Save information about a name that is not yet defined ?+Tell clients how much was parsed and loaded PSet appropriate optimisation set for the given level. We only have one optimisation that is configurable at the moment, however! ~Log an action of the parser  Log an action of the elaborator. Log an action of the compiler. Log aspect of Idris execution@An empty set of logging levels is used to denote all categories.@TODO update IDE protocol Calculate a priority for a type, for deciding elaboration order * if it's just a type variable or concrete type, do it early (0) * if there's only type variables and injective constructors, do it next (1) * if there's a function type, next (2) * finally, everything else (3) BAdd implicit bindings from using block, and bind any missing names ^Even if auto_implicits is off, we need to call this so we record which arguments are implicit (Add implicit arguments in function calls Add the implicit arguments to applications in the term [Name] gives the names to always expend, even when under a binder of that name (this is to expand methods with implicit arguments in dependent interfaces). zreturn True if the second argument is an implicit argument which is expected in the implicits, or if it's not an implicit Remove functions which aren't applied to anything, which must then be resolved by unification. Assume names resolved and alternatives filled in (so no ambiguity). Find static argument positions (the declared ones, plus any names in argument position in the declared statics) FIXME: It's possible that this really has to happen after elaboration Syntactic match of a against b, returning pair of variables in a and what they match. Returns the pair that failed if not a match. jRename any binders which are repeated (so that we don't have to mess about with shadowing anywhere else). -whether the name is an Integer implementation>whether to include the implementation in implementation searchthe name of the interfacethe name of the implementation 5The Name is the name being made into a metavar, the Int is the number of vars that are part of a putative proof context, the Maybe Name is the top-level function containing the new metavariable, the Type is its type, and the Bool is whether :p is allowed 4The categories that the message should appear under.,The Logging level the message should appear."The message to show the developer. )Allow capitalization of pattern variablesfunction being applied #initial arguments (if in a pattern)X~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDHEFGIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~       8                     ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V X W Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~                            ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~                            ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~    *"Find function callers and callees.BSD3The Idris Community.None`  + A collection of transformations.BSD3The Idris Community.None$ QWork on explicitly named terms, so we don't have to manipulate de Bruijn indices QWork on explicitly named terms, so we don't have to manipulate de Bruijn indices  ,Browse the current namespace.BSD3The Idris Community.Noneո Find the sub-namespaces of a given namespace. The components should be in display order rather than the order that they are in inside of NS constructors. Find the user-accessible names that occur directly within a given namespace. The components should be in display order rather than the order that they are in inside of NS constructors.  -Idris' Inliner.BSD3The Idris Community.None KInlining is either top level (i.e. not in a function arg) or argument levelFor each application in a term: * Check if the function is inlinable (Dictionaries are inlinable in an argument, not otherwise) - If so, try inlining without reducing its arguments + If successful, then continue on the result (top level) + If not, reduce the arguments (argument level) and try again - If not, inline all the arguments (top level)  .6Utility to make errors readable using transformations.BSD3The Idris Community.None For display purposes, apply any 'error reversal' transformations so that errors will be more readable, and any 'error reduce' transformations  /"Code to elaborate quasiquotations.BSD3The Idris Community.None  0$Code to elaborate pattern variables.BSD3The Idris Community.NoneD 9Desugar by changing x@y on lhs to let x = y in ... or rhs QReplace _-patterns under @-patterns with fresh names that can be used on the RHS  1LConvert core TT back into high level syntax, primarily for display purposes.BSD3The Idris Community.None  Re-add syntactic sugar in a term Delaborate and resugar a term $Delaborate a term without resugaring Delaborate a term directly, leaving case applications as they are. We need this for interactive case splitting, where we need access to the underlying function in a delaborated form, to generate the right patterns How far to indent sub-errors aActually indent a sub-error - no line at end because a newline can end multiple layers of indent +Pretty-print a core term using delaboration "Pretty-print the type of some name Make sure the machine invented names are shown helpfully to the user, so that any names which differ internally also differ visibly MAdd extra metadata to an output annotation, optionally marking metavariables. "implicit arguments to type, if anyFNames and types in environment (for properly hiding scoped implicits)use full names#Don't treat metavariables specially resugar cases  2{Code related to Idris's reflection system. This module contains quoters and unquoters along with some supporting datatypes.BSD3The Idris Community.None Prefix a name with the Language.Reflection namespace Prefix a name with the Language.Reflection.Elab namespace 1Reify tactics from their reflected representation /Reify terms from their reflected representation 3Reify raw terms from their reflected representation7Create a reflected call to a named function/constructor :Lift a term into its Language.Reflection.TT representation ;Lift a term into its Language.Reflection.Raw representation Convert a reflected term to a more suitable form for pattern-matching. In particular, the less-interesting bits are elaborated to _ patterns. This happens to NameTypes, universe levels, names that are bound but not used, and the type annotation field of the P constructor. FCreate a reflected TT term, but leave refs to the provided name intactElaborate a name to a pattern. This means that NS and UN will be intact. MNs corresponding to will care about the string but not the number. All others become _. BReflect the environment of a proof into a List (TTName, Binder TT)<Reflect an error into the internal datatype of Idris -- TODOIdris tuples nest to the right Reflect a file context Attempt to reify a report part from TT to the internal representation. Not in Idris or ElabD monads because it should be usable from either. sApply Idris's implicit info to get a signature. The [PArg] should come from a lookup in idris_implicits on IState. \Build the reflected function definition(s) that correspond(s) to a provided unqualifed name ]Build the reflected datatype definition(s) that correspond(s) to a provided unqualified name9    9             3$Searches current context for proofs'BSD3The Idris Community.None Y +Resolve interfaces. This will only pick up normalF implementations, never named implementations (which is enforced by !).!Find the names of implementations that have been designeated for searching (i.e. non-named implementations or implementations from Elab scripts) recursive search (False for refine){invoked from a tactic proof. If so, making new metavariables is meaningless, and there should be an error reported instead. ambiguity okdefer on failure maximum depth using default Intallow open implementationsdepth"top level goal, for error messages)top level function name, to prevent loopstop level elaborator        4&Implementation of a partial evaluator.BSD3The Idris Community.None<A"A partially evaluated function. pe_app captures the lhs of the new definition, pe_def captures the rhs, and pe_clauses is the specialised implementation.ype_simple is set if the result is always reducible, because in such a case we'll also need to reduce the static argument SData type representing binding-time annotations for partial evaluation of arguments Implicit static argument Implicit dynamic argument Implementation constraint Implementation constraint Explicit static argument Explicit dynamic argument 3Erasable dynamic argument (found under unification) Partially evaluates given terms under the given context. It is an error if partial evaluation fails to make any progress. Making progress is defined as: all of the names given with explicit reduction limits (in practice, the function being specialised) must have reduced at least once. If we don't do this, we might end up making an infinite function after applying the transformation. Specialises the type of a partially evaluated TT function returning a pair of the specialised type and the types of expected arguments. Creates an Idris type declaration given current state and a specialised TT function application type. Can be used in combination with the output of  .tThis should: specialise any static argument position, then generalise over any function applications in the result.#>Checks if a given argument is an interface constraint argument$Checks if the given arguments of an interface constraint are all either constants or references (i.e. that it doesn't contain any complex terms). !Creates a new declaration for a specialised function application. Simple version at the moment: just create a version which is a direct application of the function to be specialised. More complex version to do: specialise the definition clause by clause "1Get specialised applications for a given function%definition to specialisearguments to specialise withNew nameSpecialised function name Default lhs Default rhs !Type of specialised function               ! "  "  !            "&            5IUtilities to display Idris' internals and other informtation to the user.BSD3The Idris Community.None;=Kv'AWrite a pretty-printed term to the console with semantic coloring 0UPretty-print a collection of overloadings to REPL or IDEMode - corresponds to :t name(@Write pretty-printed output to IDEMode with semantic annotations 3(Show an error with semantic highlighting :7Warn about totality problems without failing to compile ?zWrite the highlighting information to a file, for use in external tools or in editors that don't support the IDE protocol % ' & ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A @ - + 8 5 0 4 / 9 7 6 . 3 1 2 , < ; * A > = : ? ) % & ' ()*+,-. % & ' (6&Idris parser stack and its primitives.BSD3The Idris Community.None+<>?\[ F&A constraint for parsing without state G$Our parser stack with state of type s HRun the Idris parser stack I7A fully formatted parse error, with caret and bar, etc. JBRetrieve the parser state so we can restart from this point later. LGet the current parse position.jThis is useful when the position is needed in a way unrelated to the heirarchy of parsers. Prefer using  withExtent and friends. M2Add an extent (widen) our current parsing context. N"Run a parser and track its extent.Wrap bare Megaparsec parsers with this to make them "visible" in error messages. Do not wrap whitespace or comment parsers. If you find an extent is taking trailing whitespace, it's likely there's a double-wrapped parser (usually via Idris.Parser.Helpers.token). O7Run a parser, discard its value, and return its extent. P-Run a parser and return its value and extent. QBRun a parser and inject the extent after via function application. D E F G H I J K L M N O P Q G F H E I D J K L M N O P Q E/7Utilities for Idris' parser.BSD3The Idris Community.None+<>?, S+Idris parser with state used during parsing X8Parse a reserved identfier, highlighting it as a keyword0KConsumes any simple whitespace (any character which satisfies Char.isSpace) \#Checks if a charcter is end of line ]-A parser that succeeds at the end of the line1Consumes a single-line comment  SingleLineComment_t ::= '--' ~EOL_t* EOL_t ; 2Consumes a multi-line comment G MultiLineComment_t ::= '{ -- }' | '{ -' InCommentChars_t ; k InCommentChars_t ::= '- }' | MultiLineComment_t InCommentChars_t | ~'- }'+ InCommentChars_t ; ^Parses a documentation comment  DocComment_t ::= |||" ~EOL_t* EOL_t ; _Parses some white space `Parses a string literal aParses a char literal bParses a natural number cParses a floating point number fParses a character as a token hParses a reserved identifier iParses an identifier as a token j6Parses an identifier with possible namespace as a name k1Parses an string possibly prefixed by a namespace l Parses a name3List of all initial segments in ascending order of a list. Every such initial segment ends right before an element satisfying the given condition.4 Create a D from a pair of strings representing a base name and its namespace. mParse a package name nBind constraints to term ocommaSeparated p" parses one or more occurences of p4, separated by commas and optional whitespace. pPush indentation to stack qPops indentation from stack5Gets current indentation6Gets last indentation r&Applies parser in an indented position sFApplies parser to get a block (which has possibly indented statements) tbApplies parser to get a block with at least one statement (which has possibly indented statements) uLApplies parser to get a block with exactly one (possibly indented) statement v9Checks if the following character matches provided parser wParses a start of block xParses an end of block yParses a terminator7Parses and keeps a terminator z-Checks if application expression does not end {"Checks that it is not end of block }3Checks that there are no braces that are not closed87Parses an accessibilty modifier (e.g. public, private) &Adds accessibility option for function KAdd accessbility option for data declarations (works for interfaces too - abstract6 means the data/interface is visible but members not) 'Error message with possible fixes list = D E F G H I J K L M N O P Q S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~  / S T _ U ] \ d g e v f h ^ V b a ` c n k j l i m ~  [ Y Z W X p q | } w x y { s t u r z o8-Parser for operators and fixity declarations.BSD3The Idris Community.None+<>?K Creates table for fixity declarations to build expression parser using pre-build and user-defined operator/fixity declarations >Parses a function used as an operator -- enclosed in backticks . BacktickOperator ::= '`' Name '`' ; JParses an operator name (either a symbolic name or a backtick-quoted name) G OperatorName ::= SymbolicOperator | BacktickOperator ; ZParses an operator in function position i.e. enclosed by `()', with an optional namespace  OperatorFront ::= '(' '=' ')' | (Identifier_t 9)? '(' Operator_t ')' ; 2Parses a function (either normal name or operator) # FnName ::= Name | OperatorFront; Parses a fixity declaration ? Fixity ::= FixityType Natural_t OperatorList Terminator ; @Check that a declaration of an operator also has fixity declared :Checks that an operator name also has a fixity declaration FParses a fixity declaration type (i.e. infix or prefix, associtavity)  FixityType ::= 'infixl' | 'infixr' | 'infix' | prefix ; Parses an operator Parses a reserved operator  9'Utilities to deal with error reporting.BSD3The Idris Community.None1 GIssue a warning on "with"-terms whose namespace is empty or nonexistent :!The termination checker for IdrisBSD3The Idris Community.None oCheck whether function and all descendants cover all cases (partial is okay, as long as it's due to recursion) Check whether all Inf arguments to the name end up guaranteed to be guarded by constructors (conservatively... maybe this can do better later). Essentially, all it does is check that every branch is a constructor application with no other function applications.If so, set the 1 flag which can be used by the productivity check Check if, in a given group of type declarations mut_ns, the constructor cn : ty is strictly positive, and update the context accordingly:Calculate the totality of a function from its patterns. Either follow the size change graph (if inductive) or check for productivity (if coinductive) 3Calculate the size change graph for this definitionsSCG for a function f consists of a list of: (g, [(a1, sizechange1), (a2, sizechange2), ..., (an, sizechangen)])where g is a function called a1 ... an are the arguments of f in positions 1..n of g sizechange1 ... sizechange2 is how their size has changed wrt the input to f Nothing, if the argument is unrelated to the input the group of type declarationsthe constructor  ;<=>?;&Idris' 'Type Provider' implementation.BSD3The Idris Community.None3 2Wrap a type provider in the type of type providers \Handle an error, if the type provider returned an error. Otherwise return the provided term.    <#Code to handle import declarations.BSD3The Idris Community.Nonec *Get the index file name for a package name@1Case sensitive file existence check for Mac OS X.A6Case sensitive directory existence check for Mac OS X.   B  =None  REPL commands Each AV should be either a type declaration (at most one) or a clause defining the same name. -If false, use prover, if true, use elab shellD    D    C   >Data structures common to all iPKG file formats.BSD3The Idris Community.Noneʺ  Description of an Idris package. Name associated with a package. )List of packages this package depends on. !Brief description of the package. -Version string to associate with the package. Location of the README file. )Description of the licensing information. Author information. Maintainer information. $Website associated with the package. Location of the source files. &Location of the project's bug tracker. External dependencies. %Object files required by the package. FMakefile used to build external code. Used as part of the FFI process. %List of options to give the compiler. !Source directory for Idris files.  Modules provided by the package. NIf an executable in which module can the Main namespace and function be found. What to call the executable. .Lists of tests to execute against the package. *Default settings for package descriptions.                                                     ?Act upon Idris directives.BSD3The Idris Community.None̓ +Run the action corresponding to a directive  @4Core representations and code to generate IBC files.BSD3The Idris Community.None;= When IBC is being loaded - we'll load different things (and omit different structures/definitions) depending on which phase we're in. when building the module tree Bwhen loading modules for the REPL Bool = True for top level module "*Load an entire package from its index file $QWrite a package index containing all the imports in the current IState Used for  ':search'7 of an entire package, to ensure everything is loaded. !0True = reexport, False = make everything privateC ReexportingD Reexporting?    ! " # $ ! " # $   E5FGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz   A3Utilities to erase stuff not necessary for runtime.BSD3The Idris Community.None {.Variables carry certain information with them.|%dependencies drawn in by the variable}Jwhich function argument this variable came from (defined only for patvars)~5name of the metamethod represented by the var, if any Condition is the conjunction of elementary assumptions along the path from the root. Elementary assumption (f, i) means that "function f uses the argument i"./Nodes along with sets of reasons for every one.EUseMap maps names to the set of used (reachable) argument positions. ]zPerform usage analysis, write the relevant information in the internal structures, returning the list of reachable names.6Find the minimal consistent usage by forward chaining.WWe use a cleverer implementation that: 1. First transforms Deps into a collection of numbered constraints 2. For each node, we remember the numbers of constraints that contain that node among their preconditions. 3. When performing forward chaining, we perform unit propagation only on the relevant constraints, not all constraints.Typical numbers from the current version of Blodwen: * 56 iterations until fixpoint * out of 20k constraints total, 5-1000 are relevant per iterationIn each iteration, we find the set of nodes immediately reachable from the current set of constraints, and then reduce the set of constraints based on that knowledge.In the implementation, this is phase-shifted. We first reduce the set of constraints, given the newly reachable nodes from the previous iteration, and then compute the set of currently reachable nodes. Then we decide whether to iterate further.RBuild the dependency graph, starting the depth-first search from a list of Names. ^BMake a field name out of a data constructor name and field number. node index all reachable nodes found so far'nodes reached in the previous iterationnumbered constraints ] ^ ] ^{|}~BElaborator utilities.BSD3The Idris Community.None<_ jPGet the list of (index, name) of inaccessible arguments from an elaborated type kFGet the list of (index, name) of inaccessible arguments from the type. mCheck that the result of type checking matches what the programmer wrote (i.e. - if we inferred any arguments that the user provided, make sure they are the same!) nXReturn whether inferred term is different from given term (as above, but return a Bool) oCheck a PTerm against documentation and ensure that every documented argument actually exists. This must be run _after_ implicits have been found, or it will give spurious errors. xTreat a name as a parameter if it appears in parameter positions in types, and never in a non-parameter position in a (non-param) argument type. \Find the type constructor arguments that are parameters, given a list of constructor types.Parameters are names which are unchanged across the structure. They appear at least once in every constructor type, always appear in the same argument position(s), and nothing else ever appears in those argument positions. Mark a name as detaggable in the global state (should be called for type and constructor names of single-constructor datatypes) Gather up all the outer s and =s in an expression and reintroduce them in a canonical order 9the name of the family that we are finding parameters for5the type of the type constructor (normalised already)the declared constructor types- c d e f g h i j k l m n o p q r s t u v w x y z { | } ~  - c d e f g h i j k l m n o p q r s t u v w x y z { | } ~  C Code to elaborate rewrite rules.BSD3The Idris Community.None+ 6Make a rewriting lemma for the given type constructor.If it fails, fail silently (it may well fail for some very complex types. We can fix this later, for now this gives us a lot more working rewrites...)  D?Data structures and utilities to work with Idris Documentation.BSD3The Idris Community.None3^NDetermine a truncation function depending how much docs the user wants to see WGiven a fully-qualified, disambiguated name, construct the documentation object for it     E/Generation of HTML documentation for Idris codeBSD3The Idris Community.Noneji'4A map from namespace names to information about them2All information to be documented about a namespace7Docstrings containing fully elaborated term annotations@All information to be documented about a single namespace member;Internal representation of a fully qualified namespace name#Either an error message or a result YGenerates HTML documentation for a series of loaded namespaces and their dependencies.Make an error messageIdrisDoc versionRConverts a Name into a [Text] corresponding to the namespace part of a NS Name.&Retrieves the namespace part of a Name(String to replace for the root namespace Converts a NsName to string form.Fetch info about namespaces and their contentsjRemoves loose interface methods and data constructors, leaving them documented only under their parent.9Whether a Name names something which should be documentedWhether a NsItem should be included in the documentation. It must not be Hidden/Private and filterName must return True for the name. Also it must have Docs -- without Docs, nothing can be done.~Finds all namespaces indirectly referred by a set of namespaces. The NsItems of the namespaces are searched for references.1Gets all namespaces directly referred by a NsItemGReturns an NsDict of containing all known namespaces and their contents!Gets the Accessibility for a NamePredicate saying whether a Name possibly may have docs defined Without this, getDocs from Idris.Docs may fail a pattern match.Retrieves the Docs for a NameExtracts names referred from a type. The covering of all PTerms ensures that we avoid unanticipated cases, though all of them are not needed. The author just did not know which! TODO: Remove unnecessary cases"Shorter name for extractPTermNames%Helper function for extractPTermNames%Helper function for extractPTermNames%Helper function for extractPTermNamesGenerates the actual HTML output based on info from a NsDict A merge of the new docs and any existing docs located in the output dir is attempted. TODO: Ensure the merge always succeeds. Currently the content of 'docs/<builtins>.html'{ may change between runs, thus not always containing all items referred from other namespace .html files.(Over)writes the  'index.html'Z file in the given directory with an (updated) index of namespaces in the documentationdGenerates a HTML file for a namespace and its contents. The location for e.g. Prelude.Algebra is  basePrelude Algebra.htmlEGenerates a relative filepath for a namespace, appending an extensionmGenerates a HTML type signature with proper tags TODO: Turn docstrings into title attributes more robustly,Generates HTML documentation for a function.aGenerates HTML documentation for any Docs type TODO: Generate actual signatures for interfaces7Generates everything but the actual content of the pageNon-break space characterGReturns a list of namespaces already documented in a IdrisDoc directory?Copies IdrisDoc dependencies such as stylesheets to a directory <IState where all necessary information is extracted from.4List of namespaces to generate documentation for.8The directory to which documentation will be written.Name to convertName to retrieve namespace forNsName to convertIState to fetch info from$List of namespaces to fetch info for9Mapping from namespace name to info about its contentsList to remove orphans fromOrphan-free list Name to checkPredicate resultAccessibility to checkPredicate result)Mappings of namespaces and their contentsSet of namespaces to trace'Set of namespaces which has been traced-Set of namespaces to trace and all traced one7The name to get all directly referred namespaces for+IState containing accessibility informationThe Name to retrieve access forThe Name to test The result!IState to extract infomation fromName to load Docs forWhere to extract names fromExtracted namesWhere to extract names fromExtracted names&Needed to determine the types of names$All info from which to generate docs=The base directory to which documentation will be written.1Set of namespace names to include in the index=The base directory to which documentation will be written.&Needed to determine the types of names8The name of the namespace to create documentation forThe contents of the namespace=The base directory to which documentation will be written. Namespace to generate a path forExtension suffix&Needed to determine the types of names%Type to generate type declaration forResulting HTML&Needed to determine the types of namesFunction to generate block forResulting HTML&Needed to determine the types of names)Namespace item to generate HTML block forResulting HTML&Namespace name, unless it is the index Inner HTML%The base directory containing the docs+ directory with existing namespace pages=The base directory to which dependencies should be written  FDOptimisations for Idris code i.e. Forcing, detagging and collapsing.BSD3The Idris Community.None;=m~NNeed to saturate arguments first to ensure that optimisation happens uniformly   GCode to deal with DSL blocks.BSD3The Idris Community.Noneo7$Replace DSL-bound variable in a term  HParse Expressions.BSD3The Idris Community.None<N]? Parses a tactic script  Tactic ::= intro NameList? | intros | refine Name Imp+ | mrefine Name | rewrite Expr |  induction Expr | equiv Expr | 'let' Name : Expr' '=' Expr | 'let' Name '=' Expr | focus Name | exact Expr |  applyTactic Expr | reflect Expr | fill Expr | try Tactic '|'0 Tactic | '{' TacticSeq '}' | compute | trivial | solve | attack |  | term | undo | qed | abandon | : q ; Imp ::= ? | '_'D; TacticSeq ::= Tactic ';' Tactic | Tactic ';' TacticSeq ; 6A specification of the arguments that tactics can take Names: n1, n2, n3, ... n (Parses a record field setter expression  RecordType ::= record '{' FieldTypeList '}';  C FieldTypeList ::= FieldType | FieldType ',' FieldTypeList ;   FieldType ::= FnName '=' Expr ; &the FC is for highlighting information  Allow implicit type declarations #Disallow implicit type declarations /Implicits hare are scoped rather than top level !Allow scoped constraint arguments  Parses an expression as a whole  FullExpr ::= Expr EOF_t; Parses an expression  Expr ::= Pi 4Parses an expression with possible operator applied  OpExpr ::= ; IParses either an internally defined expression or a user-defined one E Expr' ::= "External (User-defined) Syntax" | InternalExpr; !Parses a user-defined expression (Parses a simple user-defined expression NTries to parse a user-defined expression given a list of syntactic extensions &Parses a (normal) built-in expression  InternalExpr ::= UnifyLog | RecordType | SimpleExpr | Lambda | QuoteGoal | Let | If | RewriteTerm | CaseExpr | DoBlock | App ;  Parses the "impossible" keyword  Impossible ::=   Parses a case expression  CaseExpr ::= 'case' Expr 'of'# OpenBlock CaseOption+ CloseBlock; #Parses a case in a case expression % CaseOption ::= Expr (Impossible | '=>' Expr) Terminator ; Parses a proof block  ProofExpr ::= proof# OpenBlock Tactic'* CloseBlock ; Parses a tactics block  TacticsExpr := ! OpenBlock Tactic'* CloseBlock ; +Parses a simple expression @ SimpleExpr ::=| ? Name | % implementation | Refl} ('{' Expr '}')? | ProofExpr | TacticsExpr | FnName | Idiom | List | Alt | Bracketed | Constant | Type | Void. | Quasiquote | NameQuote | Unquote | '_' ; @ $Parses an expression in parentheses  Bracketed ::= '(' Bracketed' +Parses the rest of an expression in braces z Bracketed' ::= ')' | Expr ')' | ExprList ')' | DependentPair ')' | Operator Expr ')' | Expr Operator ')' ; <Parses the rest of a dependent pair after '(' or '(Expr **' GParse the contents of parentheses, after an expression has been parsed. (Finds optimal type for integer constant AParses an alternative expression @ Alt ::= '(|' Expr_List '|)';7Expr_List ::= Expr' | Expr' ',' Expr_List ; @ +Parses a possibly hidden simple expression  HSimpleExpr ::= 9 SimpleExpr | SimpleExpr ; 3Parses a unification log expression UnifyLog ::= %   SimpleExpr ; 7Parses a new-style tactics expression RunTactics ::= %   SimpleExpr ; 0Parses a disambiguation expression Disamb ::= with NameList Expr ; !Parses a no implicits expression  NoImplicits ::= %   SimpleExpr ; )Parses a function application expression  App ::=  mkForeignI Arg Arg* | MatchApp | SimpleExpr Arg* ; MatchApp ::= SimpleExpr <== FnName ; Parses a function argument < Arg ::= ImplicitArg | ConstraintArg | SimpleExpr ; %Parses an implicit function argument  ImplicitArg ::= '{' Name ('=' Expr)? '}' ; MParses a constraint argument (for selecting a named interface implementation) . ConstraintArg ::= '@{' Expr '}' ; RParses a quasiquote expression (for building reflected terms using the elaborator) Quasiquote ::= '`(' Expr ')' _Parses an unquoting inside a quasiquotation (for building reflected terms using the elaborator) Unquote ::= ',' Expr QParses a quotation of a name (for using the elaborator to resolve boring details) NameQuote ::= '`{' Name '}' 7Creates setters for record types on necessary functions Parses a type signature  TypeSig ::= : Expr ;  $ TypeExpr ::= ConstraintList? Expr; Parses a lambda expression  Lambda ::=  TypeOptDeclList LambdaTail |  SimpleExprList LambdaTail ;  G SimpleExprList ::= SimpleExpr | SimpleExpr ',' SimpleExprList ;  # LambdaTail ::= Impossible | '=>' Expr !Parses a term rewrite expression  RewriteTerm ::= rewrite Expr (==> Expr)? 'in' Expr ;  Parse rig count for linear types !Parses a let binding @ Let ::= 'let' Name TypeSig'? '=' Expr 'in' Expr | 'let' Expr' '=' Expr' 'in' ExprTypeSig' ::= : Expr' ; @  Parses a conditional expression  If ::= 'if' Expr 'then' Expr 'else' Expr Parses a quote goal QuoteGoal ::=   Name by Expr 'in' Expr ; !Parses a dependent type signature Pi ::= PiOpts Static? Pi' Pi' ::= OpExpr ('->'4 Pi)? | '(' TypeDeclList ')' '->'2 Pi | '{' TypeDeclList '}' '->' Pi | '{' auto TypeDeclList '}' '->' Pi | '{'  'default' SimpleExpr TypeDeclList '}' '->' Pi ; +Parses Possible Options for Pi Expressions  PiOpts ::= 9? Parses a type constraint list )ConstraintList ::= '(' Expr_List ')' '=>' | Expr '=>' ; Parses a type declaration list E TypeDeclList ::= FunctionSignatureList | NameList TypeSig ; ZFunctionSignatureList ::= Name TypeSig | Name TypeSig ',' FunctionSignatureList ; 8Parses a type declaration list with optional parameters k TypeOptDeclList ::= NameOrPlaceholder TypeSig? | NameOrPlaceholder TypeSig? ',' TypeOptDeclList ; NameOrPlaceHolder ::= Name | '_'; `Parses a list literal expression e.g. [1,2,3] or a comprehension [ (x, y) | x <- xs , y <- ys ] ( ListExpr ::= '[' ']' | '[' Expr '|'# DoList ']' | '[' ExprList ']' ;  ) DoList ::= Do | Do ',' DoList ;  / ExprList ::= Expr | Expr ',' ExprList ; Parses a do-block  Do' ::= Do KeepTerminator; DoBlock ::= 'do' OpenBlock Do'+ CloseBlock ; 'Parses an expression inside a do block  Do ::= 'let' Name TypeSig'? '=' Expr | 'let' Expr' '='" Expr | 'rewrite Expr | Name '<-' Expr | Expr' '<-' Expr | Expr ; 'Parses an expression in idiom brackets  Idiom ::= '[|' Expr '|]'; 'Parses a constant or literal expression Constant ::=  |  |  |  |  | Bits8 | Bits16 | Bits32 | Bits64L | Float_t | Natural_t | VerbatimString_t | String_t | Char_t ; $Parse a constant and its source span;Parses a verbatim multi-line string literal (triple-quoted) 1VerbatimString_t ::= '"""' ~'"""' '"'* '"""' ; Parses a static modifier  Static ::=  '%static' ; ;A list of available tactics and their argument requirementsParses a tactic as a wholeX X      IParse Data declarations.BSD3The Idris Community.None+<>?Kw JParses a record type declaration Record ::= DocComment Accessibility?   FnName TypeSig 'where'1 OpenBlock Constructor KeepTerminator CloseBlock; :Parses data declaration type (normal or codata) DataI ::= 'data' | ;Parses a data type declaration Data ::= DocComment? Accessibility? DataI FnName TypeSig ExplicitTypeDataRest? | DocComment? Accessibility? DataI FnName Name* DataRest? ; Constructor' ::= Constructor KeepTerminator; ExplicitTypeDataRest ::= 'where'$ OpenBlock Constructor'* CloseBlock; DataRest ::= '='0 SimpleConstructorList Terminator | 'where'U! ; SimpleConstructorList ::= SimpleConstructor | SimpleConstructor '|' SimpleConstructorList ;SParses a type constructor declaration Constructor ::= DocComment? FnName TypeSig;uParses a constructor for simple discriminated union data types SimpleConstructor ::= FnName SimpleExpr* DocComment?'Parses a dsl block declaration DSL ::= ( FnName OpenBlock Overload'+ CloseBlock;Checks DSL for errors 9Parses a DSL overload declaration OverloadIdentifier ::= 'let'/ | Identifier; Overload ::= OverloadIdentifier '=' Expr;            J'Clause generation for coverage checkingBSD3The Idris Community.None<Generate a pattern from an  impossible LHS.nWe need this to eliminate the pattern clauses which have been provided explicitly from new clause generation."This takes a type directed approach to disambiguating names. If we can't immediately disambiguate by looking at the expected type, it's an error (we can't do this the usual way of trying it to see what type checks since the whole point of an impossible case is that it won't type check!)Given a list of LHSs, generate a extra clauses which cover the remaining cases. The ones which haven't been provided are marked absurd7 so that the checker will make sure they can't happen.dThis will only work after the given clauses have been typechecked and the names are fully explicit!GDoes this error result rule out a case as valid when coverage checking?QCheck whether an error is recoverable in the sense needed for coverage checking.KCode to elaborate terms.BSD3The Idris Community.None%]mFunction part of applicationcan't pattern match"#The term resulting from elaboration##Information about new metavariables$3Deferred declarations as the meaning of case blocks%5The potentially extended context from new definitions&)Meta-info about the new type declarations'!Saved highlights from elaboration(The new global name counter/\Using the elaborator, convert a term in raw syntax to a fully elaborated, typechecked term.]If building a pattern match, we convert undeclared variables from holes to pattern bindings.4Also find deferred names in the term and their types0=Build a term autogenerated as an interface method definition.o(Separate, so we don't go overboard resolving things that we don't know about yet on the LHS of a pattern def)1return whether arguments of the given constructor name can be matched on. If they're polymorphic, no, unless the type has beed made concrete by the time we get around to elaborating the argument.4Returns the set of declarations we need to add to complete the definition (most likely case blocks to elaborate) as well as declarations resulting from user tactic scripts (%runElab)6BUse the local elab context to work out the highlighting for a name?9Compute the appropriate name for a top-level metavariableERDo the left-over work after creating declarations in reflected elaborator scripts. !('&%$#").-,+*/0123456789:;<=>?@ABCDE.)*+,-. !"#$%&'(/0123456789:;<=>?@ABCDE !"#$%&'()*+,-.LCode to elaborate values.BSD3The Idris Community.None&GqElaborate a value, returning any new bindings created (this will only happen if elaborating as a pattern clause)JTry running the term directly (as IO ()) or with >>= printLn appended (for other IO _), then printing it as an Integer (as a default numeric type), then printing it as any Showable thingGHIJKHGIJKMCode to elaborate types.BSD3The Idris Community.None(MIElaborate a top-level type declaration - for example, "foo : Int -> Int".M The precise location of the nameLMNOPLMNOPNA Hoogle for Idris.BSD3The Idris Community.NoneVE;The state corresponding to an attempted match of two types.#names which have yet to be resolvedOarguments and interface constraints for each type which have yet to be resolvedthe score so farall names that have been usedA list of interface constraintsGA directed acyclic graph representing the arguments to a function The B represents the position of the argument (1st argument, 2nd, etc.)RKeeps a record of the modifications made to match one type signature with anothertransposition of arguments#application of symmetry of equality"directional" modificationsHomogenous tuples)Asymmetric modifications to keep track of<Conduct a type-directed search using a given match predicateROur default search predicate..reverse the edges for a directed acyclic graphCompute a directed acyclic graph corresponding to the arguments of a function. returns [(the name and type of the bound variable the names in the type of the bound variable)]Collect the names and types of all the free variables The Boolean indicates those variables which are determined due to injectivity I have not given nearly enough thought to know whether this is correct+Remove a node from a directed acyclic graph=Could be a functor instance, but let's avoid name overloadinggThis allows the search to stop expanding on a certain state if its score is already too high. Returns > if the algorithm should keep exploring from this state, and   otherwise.S Convert a  to an B to provide an order for search results. Lower scores are better.Compute the power setTry to match two types together in a unification-like procedure. Returns a list of types and their minimum scores, sorted in order of increasing score.filter to remove some argumentsQRSQRSO"Code to elaborate data structures.BSD3The Idris Community.NoneGK__PCode to elaborate records.BSD3The Idris Community.None[`Elaborate a record declaration-Creates and elaborates a projection function./Creates and elaborates an update function. If optionalE is true, we will not fail if we can't elaborate the update function.Post-fixes a name with "_in".4Creates a PArg with a given plicity, name, and term.Machine name "rec".CCreates an PArg from a plicity and a name where the term is a PRef.` +The documentation for the whole declaration"The name of the type being defined-The precise source location of the tycon name Parameters Parameter Docs Fields Constructor Name Constructor Doc Constructor SyntaxInfoRecord type name ParametersFieldsConstructor Name Target type 'Name of the argument in the constructorParameter namesProjection NameProjection PlicityProjection TypeProjection DocumentationProjection SyntaxInfo Projection target type Data constructor tame $Placeholder Arguments to constructor All Field Names Argument Index 'Name of the argument in the constructorParameter names Field Name Field Plicity Field TypeField DocumentationField SyntaxInfo Projection Source Type Data Constructor Name Arguments to constructor  All fields Argument IndexOptional``QCode to elaborate interfaces.BSD3The Idris Community.Noneb:Get the docstring corresponding to a member, if one existsvIn a top level type for a method, expand all the method names' namespaces so that we don't have to disambiguate later(Find the determining parameter locationsaSuperclass constraints Parameters determining params interface body %implementation ctor name and location implementation ctor docsaaR$Transformations for elaborate terms.BSD3The Idris Community.NonecccS#Code to run the elaborator process.BSD3The Idris Community.Nonee ddTCode to elaborate instances.BSD3The Idris Community.NonepyFImplicitly bind variables from the implementation head in method typesPropagate interface parameters to method bodies, if they're not already there, and they are needed (i.e. appear in method's type)Check a given method definition is injective, if the interface info says it needs to be. Takes originally written decl and the one with name decoration, so we know which name to look up.e phase constraints$parent dictionary names (optionally)  the interface "precise location of interface name *interface parameters (i.e. implementation) =Extra arguments in scope (e.g. implementation in where block)full implementation type explicit nameeeUCode to elaborate clauses.BSD3The Idris Community.Nonezf\Elaborate a collection of left-hand and right-hand pairs - that is, a top-level definition.hFind staticY applications in a term and partially evaluate them. Return any new transformation rulesiChecks if the clause is a possible left hand side. NOTE: A lot of this is repeated for reflected definitions in Idris.Elab.Term One day, these should be merged, but until then remember that if you edit this you might need to edit the other version...lHReturn the elaborated LHS/RHS, and the original LHS with implicits addedm3Apply a transformation to all RHSes and nested RHSs fghijklmn fghijklmnV%Execute Idris code and deal with FFI.BSD3The Idris Community.NoneCV|$ooW!Code to elaborate type providers.BSD3The Idris Community.None}pElaborate a type providerppXCode to elaborate declarations.BSD3The Idris Community.None3;=>?q;Top level elaborator info, supporting recursive elaborationr'Return the elaborated term which calls mainsElaborate primitivesqrstuvuvtrsqYIdris' parser.BSD3The Idris Community.None+<KS6Parses module definition % ModuleHeader ::= DocComment_t? 'module' Identifier_t ';'?; Parses an import statement  Import ::= 'import' Identifier_t ';'?; Parses program source  Prog ::= Decl* EOF; Parses a top-level declaration Decl ::= Decl' | Using | Params | Mutual | Namespace | Interface | Implementation | DSL | Directive | Provider | Transform | Import! | RunElabDecl ; 9Parses a top-level declaration with possible syntax sugar IDecl' ::= Fixity | FunDecl' | Data | Record | SyntaxDecl ; IParses a syntax extension declaration (and adds the rule to parser state)  SyntaxDecl ::= SyntaxRule;  Extend an  ' with a new syntax extension. See also .Like , but no effect on the IBC.%Parses a syntax extension declaration SyntaxRuleOpts ::= term | ;  !SyntaxRule ::= SyntaxRuleOpts? syntax SyntaxSym+ '=' TypeExpr Terminator; SyntaxSym ::= '[' Name_t ']' | '{' Name_t '}' | Name_t | StringLiteral_t ; GParses a syntax symbol (either binding variable, keyword or expression) SyntaxSym ::= '[' Name_t ']' | '{' Name_t '}' | Name_t | StringLiteral_t ; 8Parses a function declaration with possible syntax sugar  FunDecl ::= FunDecl'; Parses a function declaration } FunDecl' ::= DocComment_t? FnOpts* Accessibility? FnOpts* FnName TypeSig Terminator | Postulate | Pattern | CAF ; 4Parses a series of function and accessbility options 'FnOpts ::= FnOpt* Accessibility FnOpt* Parses a function option  FnOpt ::= total | partial | covering |   | %  no_implicit | %  assert_total | %  error_handler | %  reflection | % G '[' NameTimesList? ']' ;  NameTimes ::= FnName Natural?; BNameTimesList ::= NameTimes | NameTimes ',' NameTimesList ; Parses a postulate Postulate ::= DocComment_t? = FnOpts* Accesibility? FnOpts* FnName TypeSig Terminator ; Parses a using declaration  Using ::= 6 '(' UsingDeclList ')' OpenBlock Decl* CloseBlock ; Parses a parameters declaration  Params ::=  parameters5 '(' TypeDeclList ')' OpenBlock Decl* CloseBlock ; Parses an open block>Parses a mutual declaration (for mutually recursive functions)  Mutual ::=  OpenBlock Decl* CloseBlock ; Parses a namespace declaration Namespace ::= + identifier OpenBlock Decl+ CloseBlock ; ,Parses a methods block (for implementations)  ImplementationBlock ::= 'where' OpenBlock FnDecl* CloseBlock ;Parses a methods and implementations block (for interfaces) >MethodOrImplementation ::= FnDecl | Implementation ; InterfaceBlock ::= 'where'? OpenBlock Constructor? MethodOrImplementation* CloseBlock ; Parses an interface declaration ,InterfaceArgument ::= Name | '(' Name : Expr ')' ; -Interface ::= DocComment_t? Accessibility?  interface= ConstraintList? Name InterfaceArgument* InterfaceBlock? ; .Parses an interface implementation declaration ' Implementation ::= DocComment_t? Q ImplementationName? ConstraintList? Name SimpleExpr* ImplementationBlock? ; %ImplementationName ::= '[' Name ']'; Parse a docstring Parses a using declaration list <UsingDeclList ::= UsingDeclList' | NameList TypeSig ;  DUsingDeclList' ::= UsingDecl | UsingDecl ',' UsingDeclList' ; .NameList ::= Name | Name ',' NameList ;  Parses a using declaration 6UsingDecl ::= FnName TypeSig | FnName FnName+ ; Parse a clause with patterns Pattern ::= Clause;  -Parse a constant applicative form declaration CAF ::= 'let' FnName '=' Expr Terminator;  Parse an argument expression ArgExpr ::= HSimpleExpr | ;  %Parse a right hand side of a function RHS ::= '=' Expr | ?=* RHSName? Expr | Impossible ; RHSName ::= '{' FnName '}'; Parses a function clause :RHSOrWithBlock ::= RHS WhereOrTerminator | with: SimpleExpr OpenBlock FnDecl+ CloseBlock ;  uClause ::= WExpr+ RHSOrWithBlock | SimpleExpr <== FnName RHS WhereOrTerminator | ArgExpr Operator ArgExpr WExpr* RHSOrWithBlock | FnName ConstraintArg* ImplicitOrArgExpr* WExpr* RHSOrWithBlock ;  -ImplicitOrArgExpr ::= ImplicitArg | ArgExpr; /WhereOrTerminator ::= WhereBlock | Terminator; Parses with pattern  WExpr ::= '|' Expr'; Parses a where block WhereBlock ::= 'where' OpenBlock Decl+ CloseBlock; -Parses a code generation target language name  Codegen ::= C | Java |  JavaScript | Node | LLVM |  ; Parses a compiler directive 7 StringList ::= String | String ',' StringList ;  Directive ::= % Directive'; Directive' ::= lib, CodeGen String_t | link+ CodeGen String_t | flag+ CodeGen String_t | include( CodeGen String_t | hide Name | freeze Name | thaw Name | access& Accessibility |  'default' Totality | logging Natural | dynamic" StringList |  l( Name NameList | error_handlers Name NameList | language  | language  |  deprecated Name String | fragile Name Reason ; Parses a totality  Totality ::= partial | total | covering Parses a type provider Provider ::= DocComment_t? % provide' Provider_What? '(' FnName TypeSig ')' with Expr; ProviderWhat ::= proof | term | 'type' |  Parses a transform Transform ::= %  Expr ==> Expr .Parses a top-level reflected elaborator script RunElabDecl ::= %   Expr  Parses an expression from input Parses a constant form input Parses a tactic from input 5Parses a do-step from input (used in the elab shell) Parse module header and importsCCheck if the coloring matches the options and corrects if necessaryUA program is a list of declarations, possibly with associated documentation strings.Collect v with the same function name<Load idris module and show error if something wrong happens Load idris module Load idris code from file ALoad idris source code and show error if something wrong happens Load Idris source codeAdds names to hide list  E H S T Y l wxyz{|}~ Swxyz{|}~ Y l  H E Twxyz{|}~ZParser for the REPL commands.BSD3The Idris Community.None<\[BSupport for command-line completion at the REPL and in the prover.BSD3The Idris Community.None>Get the user-visible names from the current interpreter state.4Get the completion function for a particular command.Complete REPL commands and defined identifiers$Complete tactics and their arguments&The names of current local assumptions !\Idris' theorem prover.BSD3The Idris Community.NoneLaunch the proof shell"run with SIGINT handlerrun if mTry finishedrun if mTry was interrupted#$%&]5Module chaser to determine cycles and import modules.BSD3The Idris Community.None<Given a module tree, return the list of files to be loaded. If any module has a descendent which needs reloading, return its source, otherwise return the IBC':Strip quotes and the backslash escapes that Haskeline addsalready guaranteed builtimport lists (don't reparse)  ^+Module to provide case split functionality.BSD3The Idris Community.None<(Given a variable to split, and a term application, return a list of variable updates, paired with a flag to say whether the given update typechecks (False = impossible) if the flag is  ' the splits should be output with the  impossible1 flag, otherwise they should be output as normal)hIf any names are unified, make sure they stay unified. Always prefer user provided name (first pattern) line numbervariable name of file(line number that the type is declared on Function nameUser given nameSource file name%line number that the type is declared Function nameSource file name*+,-./_LBits and pieces for editing source files interactively, called from the REPLBSD3The Idris Community.None`6Search loaded Idris code and named modules for things.BSD3The Idris Community.None;=RFind definitions that are relevant to all space-delimited components of some string. Relevance is one or more of the following:%the string is a substring of the name-the string occurs in the documentation string%the type of the definition is aproposbFind modules whose names or docstrings contain all the space-delimited components of some string.01aDeal with external things.BSD3The Idris Community.Noneob%The JavaScript common code generator.BSD3The Idris Community.None'Code generation stats hold information about the generated user code. Based on that information we add additional code to make things work.2Generate code for each declaration and collect stats. LFunctions are turned into JS function declarations. They are preceded by a comment that gives their name. Constructor declarations are ignored.  3456789 :;<=>?@ABCcThe JavaScript code generator.BSD3The Idris Community.Noned8The default code generator for Idris, generating C code.BSD3The Idris Community.None<)Doutput file name-generate executable if True, only .o if False include filesextra object files extra compiler flags (libraries)extra compiler flags (anything)%interfaces too (so make a .o instead)e$Coordinates the compilation process.BSD3The Idris Community.None;<E2Compile to simplified forms and return CodegenInfoEFGtSafeHf6Get information about Idris. 2016 The Idris CommunityBSD3The Idris Community.None"2Get the platform-specific, user-specific Idris dir9Locate the platform-specific location for the init scriptg#Common utilities used by all modes.BSD3The Idris Community.None$h'Entry Point for the Idris REPL and CLI.BSD3The Idris Community.None<. Run the REPLRun the REPL server(Run a command on the server on localhostRun the IdeModeIRun IDEMode commandsJ7Show a term for IDEMode with the specified implicitnessK8The prompt consists of the currently loaded modules, or Idris if there are noneL-Determine whether a file uses literate syntaxThe initial stateThe loaded modulesThe file to edit (with :e)I^ The handle for communication$^ The continuation ID for the client^ The original IState^ The current open file^ The currently loaded modules^ The command to processi+Main function to decide Idris' mode of use.BSD3The Idris Community.None5How to run Idris programs.The main function of Idris that when given a set of Options will launch Idris into the desired interaction mode either: REPL; Compiler; Script execution; or IDE Mode.ZInvoke as if from command line. It is an error if there are unresolved totality problems.M&Execute the provided Idris expression.NRun the initialisation scriptjNone6List idris packages installedk5A parser for the CmdOptions for the Idris executable.BSD3The Idris Community.None8  !-./ /- !.liPKG1 file parser and package description information.BSD3The Idris Community.None<; TParses a filename. | | Treated for now as an identifier or a double-quoted string.            m.Functionality for working with Idris packages.BSD3The Idris Community.NoneW +Run the package through the idris compiler.Type check packages onlybThis differs from build in that executables are not built, if the package contains an executable.!Check a package and start a REPL.?This function only works with packages that have a main module.Clean Package build filesGenerate IdrisDoc for package TODO: Handle case where module does not contain a matching namespace E.g. from prelude.ipkg: IO, Prelude.Chars, Builtins/Issue number #1572 on the issue tracker 3https://github.com/idris-lang/Idris-dev/issues/1572CBuild a package with a sythesized main function that runs the testsInstall package&>Invoke a Makefile's target with an enriched system environment'#Invoke a Makefile's default target.(!Invoke a Makefile's clean target.)kMerge an option list representing the command line options into those specified for a package description.This is not a complete union between the two options sets. First, to prevent important package specified options from being overwritten. Second, the semantics for this merge are not fully defined.4A discussion for this is on the issue tracker: 3https://github.com/idris-lang/Idris-dev/issues/1448Command line optionsProvide Warnings*(Should we install, Location of iPKG file)Command line Options Show Warningsquit on failurePath to ipkg file.Command line OptionsPath to ipkg file.Command line options.Path to ipkg file.Command line options.((Should we install?, Path to ipkg file).Command line options.Path to ipkg file.Alternate install location iPKG file.)The command line optionsThe package options !"#$%&'() !"#$%&'()Ouvwxyz{|}~o      !"#$%&'()*+,-./0123456789:;<==>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~l      !"#$%&'()*+,-./012 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~                                                                                                                                                                !"#$%&'()*+,-.K/0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnnopqrstuvwxyz{|}~w\      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                                        !!!!!!!!"""""""""""" " " " " """"""""""""""""""" "!"""#"$"%"&"'"(")"*"("+","-"."/"0"1"2"3"4"5"6"7"8"9":";"<"=">"?"@"A"B"C"D"E"F"G"H"I"J"K"L"M"N"O"P"Q"R"S#T#U#V#W#X#Y#Z#[#\#]#^#_#`#a#b#c#d#e#f#g#h#i#j#k#l#m#n#o#p#q#r#s#t#u#v#w#x#y#z#{#|#}#~####9####################################################################################$$$$$$$$$$$$$$$$$$$$@$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$ $ $ $ $ $$$$$$$$$$$$$$$$$$$ $!$"$#$$$%$&$'$($)$*$+$,$-$.$/$0$1$2$3$4$5$6$$7$$8$$9$$$:$;$<$=$$ $>$?$$ $$($0$)$@$A$B$C$D$$E$F$G$H$I$J$K$L$M$N$O$P$Q$R$S$T$U$V$W$X$Y$Z$[$\$]$^$_$`$a$b$c$d$e$f$g$h$i$j$k$l$m$n$o$p$q$r$s$t$u$v$w$x$y$z${$|$}$~$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ !$ "$ #$ $$ %$ &$ '$ ($ )$ *$ +$ ,$ -$ .$ /$ 0$ 1$ 2$ 3$ 3$ 4$ 5$ 6$ 7$ 8$ 9$ :$ ;$ <$ =$ >$ ?$ ?$ @$ A$ B$ C$ D$ E$ F$ G$ H$ I$ J$ K$ L$ M$ N$ O$ P$ Q$ R$ S$ T$ U$ V$ W$ X$ Y$ Z$ [$ \$ ]$ ^$ _$ `$ a$ b$ c$ d$ e$ f$ g$ h$ i$ j$ k$ l$ m$ n$ o$ p$ q$ r$ s$ t$ u$ v$ w$ x$ y$ z$ {$ |$ }$ ~$ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ !$ "$ #$ $$ %$ &$ '$ ($ )$ *$ +$ ,$ -$ .$ /$ 0$ 1$ 2$ 3$ 4$ 5$ 6$ 7$ 8$ 9$ :$ ;$ <$ =$ >$ ?$ @$ A$ B$ C$ D$ E$ F$ G$ H$ I$ J$ K$ L$ M$ N$ O$ P$ Q$ R$ S$ T$ U$ V$ W$ X$ Y$ Z$ [$ \$ ]$ ^$ _$ `$ a$ b$ c$ d$ e$ f$ g$ h$ i$ j$ k$ l$ m$ n$ o$ p$ q$ r$ s$ t$ u$ v$ w$ x$ y$ z$ {$ |$ }$ ~$ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % & & & & & & & & & & & & & & & & & ' ( ( ( ( ( ( ( ( ( ( ( ( ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) !) ") #) $) %) &) ') () )) *) +) ,) -) .) /) 0) 1) 2) 3) 4) 5) 6) 7) 8) 9) :) ;) <) =) >) ?) @) A) B) C) D) E) F) G) H) I) J) K) L) M) N) O) P) Q) R) S) T) U) V) W) X) Y) Z) [) \) ]) ^) _) `) a) b) c) d) e) f) g) h) i) j) k) l) m) n) o) p) q) r) s) t) u) v) w) x) y) z) {) |) }) ~) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) )) )) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) )) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) * * + + + + , , - - . / 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 !2 "2 #2 $2 %2 &2 '2 (2 )2 *2 +2 ,2 -2 .2 /2 02 12 22 32 42 52 62 72 82 92 :2 ;2 <2 =2 >2 ?2 @2 A2 B2 C2 D3 E3 F3 G3 H4 I4 J4 K4 L4 M4 N4 O4 P4 Q4 R4 S4 T4 U4 V4 W4 X4 Y4 Z4 [5 \5 ]5 ^5 _5 `5 a5 b5 c5 d5 e5 f5 g5 h5 i5 j5 k5 l5 m5 n5 o5 p5 q5 r5 s5 t5 u5 v5 w5 x5 y5 z6 {6 |6 }6 ~6 6 6 6 6 6 6 6 6s6 6 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 9 9 9 9 9 9 9 9 9 9 9 9 : : : : : : : : ; ; ; ; ; ; ; < < < < < < < < < < < < < < < < < < < < = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =~= = !== "== #= $= %= &= '= (= )= *==== += ,= -= .== /= 0= 1= 2> 3> 3> 4> 5> 6> 7> 8> 9> :> ;> <> => >> ?> @> A> B> C> D> E> F> G> H> I? J@ K@ L@ M@ N@ O@ P@ Q@ R@ S@ T@ U@ V@ W@ X@ Y@ Z@ [@ \@ ]@ ^@ _@ `@ a@ b@ c@ d@ e@ f@ g@ h@ i@ j@ k@ l@ m@ n@ o@ p@ q@ r@ s@ t@ u@ v@ w@ x@ y@ z@ {@ |@ }@ ~@ @ @ @ @ @ @ @ @ @ @ @ A A A A A A B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B C C C D D D D D D D D D D D D D D D D D E F F F F F F F F F G G H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H HHHHHHlHfHHHHHH H H H H HHHHHHHHHHHHHHHHHHH H!H"H#H$H%H&H'H(H)H*H+H,H-H.H/H0H1H2I3I4I5I6I7I8I9I:I;I<I=J>J?J@JAKBKBKCKDKEKFKGKHKIKIKJKKKLKMKNKOKPKQKRKSKTKUKVKWKXKYKZK[K\K]K^K_K`KaKbKcKdKeKfKgKhKiKjKkKlKmKnLoLpLqLrLsMtMuMvMwMxNyNzN{N|N}N~NNNNNNNNOPQQRSTUUUUUUUUUVWXXXXXXYYYYYYYYYYYYYYYYYYYZZZZ[[[\\\]]]]]]]]]]^^^^^^^^________```````````aabbbbbbbbbbbbbccccccdeee fffffffffffffffffgggghhhhh h h i i ijjjjjjjjjjjjjjjjjj j!j"k#k$k%l&l'l(l)l*l+l,l-l.l/m0m1m2m3m4m5m6m7m8m9m:m;m<m=m>m?m@mAmBmCmDmEmmFnGHIoJoKoLoMoNoOoPQpRpSqTqUVWXVWYVWZVW[VW\VW]VW^VW_VW`VWaVWbVWcVWdVWeVWfVWgVWhVWiVWjVW VWkVWlVWmVWVWnVWVWoVWpVWqVW VWrVWsVWtVW VWuVWvVWwVWxVWyVWzVW{VW|VW}VW~VWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWVWrrrrr            ] ]                               W                      F         & &&(  011 122222 2 2!2"2#2$2%2&2'2(2)2*2+2,2-3.4/4041424/53545555565758596 |7:7;7<7=7>77?7@7ABCD:E:F:G:H:I:J<K<L< @ @M@N@N@O@P@Q@R@S@T@U@V@W@X@Y@Z@[@\@]@^@_@`@a@b@c@d@e@f@g@h@i@j@k@l@m@n@o@p@q@r@s@t@u@v@w@x@y@z@{@|@}@~@@@@AAAAAAAAAAAAAACCCCCDEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEFFGB   BCNN-NNNNNNNNNNNNNNNNNNNNNNNNNNNNNPPPPPPPQQQQQQQTTTYYYYYYYYYYYYYYY YYY YY Y Y Y Y YYYYY,YYYYYYYYYYYYYY[ [!["[#[\$\%\&\'\(])^*^+^,^-^.^/^Z^``0b1b2b3b4b5b6b7b8b8b9b:b;b<b=b>b?b@bAdBeeetChDhEhFhGiHiIJ!idris-1.3.0-sWdxO7YG1l525W5zQFBm8IRTS.JavaScript.AST Idris.Colours Idris.Help IRTS.SystemUtil.DynamicLinker Idris.Core.TT Idris.UnlitIdris.DocstringsIdris.Core.ConstraintsIdris.Core.CaseTreeIdris.Core.EvaluateIdris.Core.WHNFIdris.Core.UnifyIdris.Core.TypecheckIdris.Core.ProofTermIdris.Core.DeepSeqIdris.Core.Binary Idris.IdeMode IRTS.LangIdris.Primitives IRTS.LangOptsIRTS.JavaScript.SpecializeIRTS.JavaScript.PrimOpIRTS.JavaScript.NameIRTS.JavaScript.LangTransformsIRTS.DefunctionaliseIRTS.Simplified IRTS.InlinerIRTS.CodegenCommon Idris.Options IRTS.Bytecode IRTS.Portable IRTS.DumpBCIdris.Core.ProofStateIdris.Core.ElaborateIdris.AbsSyntaxTree Idris.DeepSeqIdris.ASTUtilsUtil.ScreenSize Util.SystemIdris.AbsSyntaxIdris.WhoCallsIdris.TransformsIdris.REPL.Browse Idris.InlinerIdris.ErrReverseIdris.Elab.QuasiquoteIdris.Elab.AsPatIdris.DelaborateIdris.ReflectionIdris.ProofSearchIdris.PartialEval Idris.OutputIdris.Parser.StackIdris.Parser.HelpersIdris.Parser.Ops Idris.ErrorIdris.TerminationIdris.Providers Idris.ImportsIdris.REPL.CommandsIdris.Package.CommonIdris.Directives Idris.IBC Idris.ErasureIdris.Elab.UtilsIdris.Elab.Rewrite Idris.DocsIdris.IdrisDocIdris.DataOpts Idris.DSLIdris.Parser.ExprIdris.Parser.DataIdris.CoverageIdris.Elab.TermIdris.Elab.ValueIdris.Elab.TypeIdris.TypeSearchIdris.Elab.DataIdris.Elab.RecordIdris.Elab.InterfaceIdris.Elab.TransformIdris.Elab.RunElabIdris.Elab.ImplementationIdris.Elab.ClauseIdris.Core.ExecuteIdris.Elab.ProviderIdris.ElabDecls Idris.ParserIdris.REPL.ParserIdris.Completion Idris.Prover Idris.ChaserIdris.CaseSplitIdris.Interactive Idris.Apropos IRTS.ExportsIRTS.JavaScript.CodegenIRTS.CodegenJavaScript IRTS.CodegenC IRTS.Compiler Idris.InfoIdris.ModeCommon Idris.REPL Idris.MainIdris.Info.ShowIdris.CmdOptionsIdris.Package.Parser Idris.PackageBuildFlags_idris Paths_idris Tools_idrisUtil.Net Util.Pretty withExtent Version_idrisJsExprJsNull JsUndefinedJsThisJsLambdaJsAppJsNewJsPartJsMethodJsVar JsArrayProjJsObjJsPropJsIntJsBool JsIntegerJsDoubleJsStrJsArray JsErrorExpJsUniOpJsBinOp JsForeignJsB2IJsForceJsStmtJsEmpty JsComment JsExprStmtJsFunJsSeqJsReturnJsDecVar JsDecConstJsDecLetJsSetJsIf JsSwitchCaseJsError JsForever JsContinueJsBreak jsCurryLam jsCurryAppjsAppNjsSetVar jsStmt2Text jsAst2TextjsLazy jsExpr2Stmt jsStmt2Expr $fShowJsExpr $fEqJsExpr $fDataJsExpr $fShowJsStmt $fEqJsStmt $fDataJsStmt ColourType KeywordColourBoundVarColourImplicitColourFunctionColour TypeColour DataColour PromptColourPostulateColour ColourTheme keywordColourboundVarColourimplicitColourfunctionColour typeColour dataColour promptColourpostulateColour IdrisColourcolourvivid underlinebolditalic defaultTheme colourisehStartColourise hEndColourise colouriseKwdcolouriseBoundcolouriseImplicit colouriseFun colouriseType colouriseDatacolourisePromptcolouriseKeywordcolourisePostulate$fEqIdrisColour$fShowIdrisColour$fEqColourTheme$fShowColourTheme$fGenericColourTheme$fEqColourType$fShowColourType$fBoundedColourType$fEnumColourTypeCmdArgExprArgNameArgFileArgShellCommandArg ModuleArgPkgArgs NumberArg NamespaceArg OptionArg MetaVarArg ColourArgNoArgSpecialHeaderArgConsoleWidthArgDeclArgManyArgs OptionalArgSeqArgs extraHelp $fShowCmdArgversiongetIdrisDataDirgetIdrisDataFileByNamegetCC getEnvFlags getLibFlagsgetIdrisLibDirgetIdrisDocDirgetIdrisJSRTSDirgetIdrisCRTSDir getIncFlags ForeignFunFunfun_name fun_handle DynamicLibLiblib_name lib_handle tryLoadLib tryLoadFn$fEqDynamicLibEnvTypeTermTypeInfoTI con_namescodata data_opts param_pos mutual_types linear_conDataOptsDataOptCodata DataErrRevDatatypeData d_typename d_typetagd_typed_uniqued_consEnvTTRigCountRig0Rig1RigWTermSizetermsizeTTPVBindAppConstantProjErased ImpossibleInferredTTypeUType AppStatusComplete MaybeHolesHolesNameTypeBoundRefDConTConnt_tagnt_arity nt_uniqueUCs ConstraintFC uconstraintufc UConstraintULTULEUExpUVarUValBinderLamPiLetNLetHoleGHoleGuessPVarPVTy binderCountbinderTy binderImpl binderKind binderValenvlen localnames ImplicitInfoImpltcimplementation toplevel_imp machine_genRawVarRBindRAppRTypeRUType RConstantUniverseNullType UniqueTypeAllTypesConstIBIFlChStrB8B16B32B64ATypeStrType WorldTypeTheWorldVoidTypeForgotArithTyATIntATFloatIntTyITFixedITNativeITBigITCharNativeTyIT8IT16IT32IT64Ctxt SpecialNameWhereNWithNImplementationNParentNMethodNCaseNImplementationCtorNMetaNNameUNNSMNSNSymRefTCOKErrorErrErr'Msg InternalMsg CantUnify InfiniteUnify CantConvert CantSolveGoal UnifyScope CantInferTypeNonFunctionType NotEqualityTooManyArguments CantIntroduceNoSuchVariable WithFnType NoTypeDecl NotInjective CantResolve InvalidTCArgCantResolveAlts NoValidAltsIncompleteTerm UniverseError UniqueErrorUniqueKindErrorProgramLineComment InaccessibleUnknownImplicit CantMatchNonCollapsiblePostulateAlreadyDefinedProofSearchFail NoRewritingAt ElaboratingElaboratingArg ProviderError LoadingFailedReflectionErrorReflectionFailedElabScriptDebugElabScriptStuckRunningElabScriptElabScriptStagingFancyMsg Provenance ExpectedType TooManyArgs InferredValGivenVal SourceTermErrorReportPartTextPartNamePartTermPartRawPart SubReportOutputAnnotationAnnName AnnBoundNameAnnConstAnnDataAnnType AnnKeywordAnnFC AnnTextFmtAnnLinkAnnTermAnnSearchResultAnnErr AnnNamespace AnnQuasiquote AnnAntiquote AnnSyntaxTextFormattingBoldText ItalicText UnderlineText NameOutput TypeOutput FunOutput DataOutput MetavarOutputPostulateOutputFC'unwrapFCFCNoFCFileFC _fc_fname _fc_start_fc_endfc_fnamefc_startfc_endfcInemptyFCfileFCtfaildiscardshowSeppmap traceWhentxtstrtnulltheadsUNsNSsMNcaseNamesImplementationNshowCG emptyContextmapCtxttcname implicitablensrootaddDeflookupCtxtName lookupCtxtlookupCtxtExactdeleteDefExact updateDeftoAlistaddAlist intTyName nativeTyWidth isTypeConst constIsType constDocsfmapMB raw_apply raw_unapply internalNSrigPlusrigMultfstEnvrigEnvsndEnv envBindersenvZero lookupBinder isInjective instantiatesubstV explicitNamespToV addBinderpToVsvToPfinalise pEraseTypesubstpsubst substNames substTerm occurrences noOccurrence freeNamesarityunApplymkAppunListtermSmallerThanforget safeForget forgetEnv safeForgetEnvbindAll bindTyArgs getArgTysgetRetTy substRetTyuniqueNameFrom uniqueName uniqueNameSet uniqueBindersnextNameshowEnv showEnvDbg prettyEnvpureTermweakenTmrefsIn allTTNamespprintTTpprintTTClause pprintRaw bindingOf$fShowFC $fSizedFC$fEqFC $fMonoidFC $fShowFC'$fEqFC'$fShowSpecialName $fShowName $fSizedName $fShowConst $fSizedConst $fEqConst$fSizedUniverse$fShowUniverse $fShowUExp $fSizedUExp$fShowUConstraint$fOrdConstraintFC$fEqConstraintFC $fEqNameType$fSizedNameType $fTermSize[] $fSizedBinder$fShowTT$fEqTT $fPrettyTTo $fSizedTT $fTermSizeTT $fSizedRaw$fSizedErrorReportPart $fShowErr' $fSizedErr'$fShowTC$fAlternativeTC$fApplicativeTC $fMonadPlusTC $fMonadTC $fPrettyNameTypeOutputAnnotation$fPrettyRawOutputAnnotation$fPrettyConstOutputAnnotation$fPrettyArithTyOutputAnnotation $fPrettyNativeTyOutputAnnotation$fPretty[]OutputAnnotation$fPrettyNameOutputAnnotation$fPrettyTCOutputAnnotation$fPrettyErr'OutputAnnotation $fEqOption$fDataFC $fGenericFC$fOrdFC $fDataFC' $fGenericFC'$fOrdFC'$fShowNameOutput$fEqNameOutput$fGenericNameOutput$fShowTextFormatting$fEqTextFormatting$fGenericTextFormatting$fEqSpecialName$fOrdSpecialName$fDataSpecialName$fGenericSpecialName$fEqName $fOrdName $fDataName $fGenericName$fShowNativeTy $fEqNativeTy $fOrdNativeTy$fEnumNativeTy$fDataNativeTy$fGenericNativeTy $fShowIntTy $fEqIntTy $fOrdIntTy $fDataIntTy$fGenericIntTy $fShowArithTy $fEqArithTy $fOrdArithTy $fDataArithTy$fGenericArithTy $fOrdConst $fDataConst$fGenericConst $fEqUniverse $fOrdUniverse$fDataUniverse$fGenericUniverse$fShowImplicitInfo$fEqImplicitInfo$fOrdImplicitInfo$fDataImplicitInfo$fGenericImplicitInfo$fEqUExp $fOrdUExp $fDataUExp $fGenericUExp$fEqUConstraint$fOrdUConstraint$fDataUConstraint$fGenericUConstraint$fShowConstraintFC$fDataConstraintFC$fGenericConstraintFC$fShowNameType $fOrdNameType$fDataNameType$fGenericNameType $fEqAppStatus$fOrdAppStatus$fFunctorAppStatus$fDataAppStatus$fGenericAppStatus$fShowAppStatus$fShowRigCount $fEqRigCount $fOrdRigCount$fDataRigCount$fGenericRigCount $fShowBinder $fEqBinder $fOrdBinder$fFunctorBinder$fFoldableBinder$fTraversableBinder $fDataBinder$fGenericBinder$fOrdTT $fFunctorTT$fDataTT $fGenericTT $fShowRaw$fEqRaw$fOrdRaw $fDataRaw $fGenericRaw$fShowDatatype$fFunctorDatatype $fEqDatatype $fShowDataOpt $fEqDataOpt$fGenericDataOpt$fShowTypeInfo$fGenericTypeInfo$fShowProvenance$fEqProvenance$fOrdProvenance$fDataProvenance$fGenericProvenance$fShowErrorReportPart$fEqErrorReportPart$fOrdErrorReportPart$fDataErrorReportPart$fGenericErrorReportPart$fEqErr' $fOrdErr' $fFunctorErr' $fDataErr' $fGenericErr'$fEqTC $fFunctorTC$fShowOutputAnnotation$fEqOutputAnnotation$fGenericOutputAnnotationunlitInlineSpace SoftBreak LineBreakEmphStrongCodeLinkImageEntityRawHtmlBlockParaHeader BlockquoteList CodeBlock HtmlBlockHRule Docstring DocStringDocTerm UncheckedCheckedExampleFailing renderDocTermcheckDocstringparseDocstringrenderDocstringoverviewemptyDocstring nullDocstringnoDocs containsText renderHtml annotCode $fShowDocTerm$fGenericDocTerm $fShowInline$fFunctorInline$fFoldableInline$fTraversableInline$fGenericInline $fShowBlock$fFunctorBlock$fFoldableBlock$fTraversableBlock$fGenericBlock$fShowDocstring$fFunctorDocstring$fFoldableDocstring$fTraversableDocstring$fGenericDocstringucheck$fEqVar$fOrdVar $fShowVar $fEqDomain $fOrdDomain $fShowDomainPhase CoverageCheck CompileTimeRunTime ErasureInfoCaseTreeCaseAltCaseAlt'ConCaseFnCase ConstCaseSucCase DefaultCaseSCCaseType UpdatableSharedSC'CaseProjCaseSTerm UnmatchedCaseImpossibleCaseCaseDefsmall namesUsed findCalls findCalls' findUsedArgs simpleCasesubstSCsubstAltmkForce $fShowSC' $fTermSizeSC'$fTermSizeCaseAlt' $fEqCaseType $fOrdCaseType$fShowCaseType$fGenericCaseType$fShowCaseAlt' $fEqCaseAlt' $fOrdCaseAlt'$fFunctorCaseAlt'$fGenericCaseAlt'$fEqSC'$fOrdSC' $fFunctorSC' $fGenericSC' $fShowCaseDef $fShowPhase $fEqPhase $fShowPat$fShowPartition $fShowConType $fEqConType $fShowGroupTTDeclContext next_tvar definitionsMetaInformationEmptyMIDataMIPReasonOtherItself NotCovering NotPositiveUseUndef ExternalIO BelieveMeMutual NotProductiveTotalityTotal ProductivePartial Generated Injectivity AccessibilityHiddenPublicFrozenPrivateCaseInfocase_inlinablecase_alwaysinline tc_dictionaryCaseDefscases_compiletime cases_runtimeDefFunctionTyDeclOperatorCaseOpQuotequoteValueVPVVVBindVBLetVAppVTypeVUTypeVErased VImpossible VConstantVProjVTmpinitEval normaliseC normaliseAllnormaliseBlocking normalisenormaliseTracetoValue quoteTerm specialisesimplify inlineSmall rt_simplifyunfold isUniverseconvEq'convEq initContext mapDefCtxt ctxtAlist addToCtxt setAccess setInjectivesetTotal setRigCountsetMetaInformation addCtxtDef addTyDecl addDatatype addCasedefsimplifyCasedef addOperator lookupNames lookupTyNamelookupTyNameExactlookupTy lookupTyExact isCanonical isConName isTConName isDConName canBeDConNameisFnNameisTCDict conGuardedvisibleDefinitionslookupP lookupP_alllookupDefExact lookupDef lookupNameDef lookupDefAcclookupDefAccExact lookupTotallookupTotalExactlookupRigCountlookupRigCountExactlookupInjectiveExact linearChecklinearCheckArg tcReduciblelookupMetaInformationlookupNameTotal lookupVal lookupTyEnvuniqueNameCtxtuniqueBindersCtxt $fShow(->) $fQuoteValue $fEqValue $fShowValue $fShowDef$fShowAccessibility$fShowTotality$fShowEvalState $fShowEvalOpt $fEqEvalOpt$fGenericCaseDefs$fGenericCaseInfo $fGenericDef$fEqAccessibility$fOrdAccessibility$fGenericAccessibility $fShowPReason $fEqPReason$fGenericPReason $fEqTotality$fGenericTotality$fEqMetaInformation$fShowMetaInformation$fGenericMetaInformation $fShowContext$fGenericContextWEnvwhnfwhnfArgs $fShowWEnvFails FailContextfail_sourcelocfail_fn fail_paramFailAtMatchUnify unrecoverable match_unifyunify $fShowFailAt $fEqFailAt$fEqFailContext$fShowFailContext $fShowUInfo UniqueUseNeverOnceLendOnlyMany convertsCconvertsisHoleerrEnvisTypeconvTyperecheckrecheck_borrowingcheckcheck' checkUnique $fEqUniqueUseGoalGDpremisesgoalType RunTactic' ProofTermrefocus mkProofTerm getProofTermresetProofTermupdateSolvedTermupdateSolvedTerm'updsubst updateSolvedgoalatHolebound_in bound_in_term$fShowBinderPath$fShowTermPath$fShowProofTerm forceDefCtxt$fNFDataCaseAlt' $fNFDataSC'$fNFDataCaseType$fNFDataCaseDefs$fNFDataCaseInfo $fNFDataDef$fNFDataMetaInformation$fNFDataPReason$fNFDataTotality$fNFDataAccessibility $fNFDataTT$fNFDataAppStatus $fNFDataConst$fNFDataArithTy $fNFDataIntTy$fNFDataNativeTy$fNFDataNameType $fNFDataUExp$fNFDataBinder$fNFDataRigCount$fNFDataImplicitInfo$fNFDataErrorReportPart $fNFDataErr'$fNFDataConstraintFC$fNFDataUConstraint$fNFDataProvenance $fNFDataFC' $fNFDataFC $fNFDataRaw$fNFDataUniverse$fNFDataSpecialName$fNFDataOutputAnnotation$fNFDataTextFormatting$fNFDataNameOutput$fNFDataContext $fNFDataName $fBinaryTT $fBinaryUExp$fBinaryNameType$fBinaryUniverse$fBinaryBinder$fBinaryImplicitInfo$fBinaryRigCount $fBinaryRaw $fBinaryConst$fBinarySpecialName $fBinaryName $fBinaryFC' $fBinaryFC $fBinaryErr'$fBinaryConstraintFC$fBinaryUConstraint$fBinaryProvenance$fBinaryErrorReportPartIdeModeCommandREPLCompletions InterpretTypeOf CaseSplit AddClauseAddProofClause AddMissing MakeWithBlock MakeCaseBlock ProofSearch MakeLemmaLoadFileDocsForAproposGetOptsSetOpt MetavariablesWhoCallsCallsWhoBrowseNS TermNormaliseTermShowImplicitsTermNoImplicitsTermElabPrintDef ErrString ErrPPrintGetIdrisVersionWhatDocsOverviewFullOptShowImpl ErrContextSExpabletoSExpSExpSexpList StringAtomBoolAtom IntegerAtom SymbolAtomgetNChargetLen sExpToString sexpToCommand parseMessageconvSExp ideModeEpoch $fSExpableFC$fSExpableOutputAnnotation$fSExpableNameOutput$fSExpable(,,,,)$fSExpable(,,,)$fSExpable(,,) $fSExpable(,) $fSExpable[]$fSExpableMaybe$fSExpableName $fSExpableInt$fSExpableInteger $fSExpable[]0$fSExpableBool$fSExpableSExp$fEqSExp $fShowSExp $fShowOpt LiftStateLSLOptNoInlineLDefsLDeclLFun LConstructorLAltLAlt'LConCase LConstCase LDefaultCaseFTypeFArith FFunction FFunctionIOFStringFUnitFPtr FManagedPtrFCDataFAny FCallTypeFStaticFObject FConstructorPrimFnLPlusLMinusLTimesLUDivLSDivLURemLSRemLAndLOrLXOrLComplLSHLLLSHRLASHRLEqLLtLLeLGtLGeLSLtLSLeLSGtLSGeLSExtLZExtLTrunc LStrConcatLStrLtLStrEqLStrLen LIntFloat LFloatIntLIntStrLStrInt LFloatStr LStrFloatLChIntLIntChLBitCastLFExpLFLogLFSinLFCosLFTanLFASinLFACosLFATanLFATan2LFSqrtLFFloorLFCeilLFNegateLStrHeadLStrTailLStrCons LStrIndexLStrRev LStrSubstrLReadStr LWriteStr LSystemInfoLForkLPar LExternalLCrashLNoOp ExportIFaceExport ExportData ExportFunFDescFConFStrFUnknownFIOFAppLExpLVLAppLLazyAppLLazyExpLForceLLetLLamLProjLConLCaseLConstLForeignLOpLNothingLErrorLVarLocGlob EndiannessNativeBELEaddTags setBaseNamelname getNextName renameArgsaddFnmakeFnliftAllliftDeflift allocUniqueusedArgusedInlsubstrename $fShowLExp$fShowEndianness$fEqEndianness $fShowLVar$fEqLVar $fShowFDesc $fEqFDesc $fOrdFDesc $fShowExport $fEqExport $fOrdExport$fShowExportIFace$fEqExportIFace$fOrdExportIFace $fShowPrimFn $fEqPrimFn $fOrdPrimFn$fGenericPrimFn$fShowFCallType $fEqFCallType$fOrdFCallType $fShowFType $fEqFType $fOrdFType $fShowLAlt' $fEqLAlt' $fOrdLAlt'$fFunctorLAlt' $fDataLAlt'$fEqLExp $fOrdLExp $fShowLOpt$fEqLOpt $fOrdLOpt $fShowLDecl $fEqLDecl $fOrdLDeclPrimp_namep_typep_arityp_defp_lexpp_total primitives inlineAllSProjSTestSCtorqualifyN specialCased specialCallPrimDecPrimFJsPrimTyPTBoolPTAnyprimDB jsPrimCoerce $fEqJsPrimTy $fOrdJsPrimTy HiddenClassjsNamejsNameGenerated jsNamePartialjsTailCallOptimNamejsNameHiddenClass dataPartName $fEqPartial $fOrdPartial$fEqHiddenClass$fOrdHiddenClassremoveDeadCode globlToCon $fDataLOpt $fDataLDecl $fDataLExp$fDataCaseType $fDataPrimFn $fDataLVar $fDataFDesc EvalApplyEvalCase ApplyCase Apply2CaseDDefsDDeclDFun DConstructorDAltDConCase DConstCase DDefaultCaseDExpDVDAppDLetDUpdateDProjDCDCaseDChkCaseDConstDForeignDOpDNothingDErrordefunctionalisegetFnaddAppseEVALtoConstoConsA mkApplyCasemkEvalmkApplymkApply2declaregenArgsmkFnCon mkUnderCon mkBigCasegroupsOf dumpDefuns $fShowDExp $fShowDAlt$fEqDAlt$fEqDExp $fShowDDecl $fEqDDeclSDeclSFunSAltSConCase SConstCase SDefaultCaseSVSAppSLetSUpdateSConSCaseSChkCaseSConstSForeignSOpSNothingSError simplifyDefs $fShowSAlt $fShowSDeclinlineinlevalD CodeGenerator CodegenInfo outputFile outputType targetTriple targetCPUincludes importDirs compileObjs compileLibs compilerFlags debugLevel simpleDecls defunDecls liftDecls interfaces exportDeclsttDecls OutputTypeObject ExecutableDbgLevelNONEDEBUGTRACE $fEqDbgLevel$fEqOutputType$fShowOutputType$fGenericOutputTypeLogCatIParseIElabICodeGenIErasure ICoverageIIBC Optimisation PETransform OutputFmt HTMLOutput LaTeXOutput HowMuchDocsFullDocs OverviewDocs ConsoleWidthInfinitelyWideColsWideAutomaticWidthIRFormat IBCFormat JSONFormat LanguageExt TypeProvidersErrorReflectionUniquenessTypes DSLNotationElabReflection FCReflection LinearTypesCodegenViaBytecodeREPLPort DontListen ListenPortFilenameQuietNoBanner ColourREPLIdemode IdemodeSocket IndentWith IndentClauseShowAllShowLibs ShowLibDir ShowDocDirShowIncsShowPkgsShowLoggingCats NoBasePkgs NoPrelude NoBuiltinsNoREPLOLoggingOLogCatsOutput InterfaceTypeCase TypeInType DefaultTotalDefaultPartial WarnPartial WarnReach AuditIPkg EvalTypes NoCoverageVerbosePort IBCSubDir ImportDir SourceDirPkgBuild PkgInstallPkgCleanPkgCheckPkgREPL PkgDocBuild PkgDocInstallPkgTestPkgIndexWarnOnlyPkgBCAsm DumpDefun DumpCases UseCodegen CodegenArgsOutputTy ExtensionInterpretScriptEvalExpr TargetTriple TargetCPUOptLevelAddOpt RemoveOptClient ShowOrigErr AutoWidth AutoSolveUseConsoleWidthDumpHighlights DesugarNatsNoOldTacticDeprecationWarnings AllowCapitalizedPatternVariables strLogCat codegenCats parserCatselabCatsloggingCatsStrgetFilegetBC getOutput getIBCSubDir getImportDir getSourceDir getPkgDirgetPkg getPkgClean getPkgREPL getPkgCheck getPkgMkDoc getPkgTest getCodegengetCodegenArgsgetConsoleWidth getExecScript getPkgIndex getEvalExpr getOutputTygetLanguageExt getOptLevelgetOptimisation getColour getClientgetPortopt $fEqREPLPort$fGenericREPLPort$fShowREPLPort$fShowLanguageExt$fEqLanguageExt$fReadLanguageExt$fOrdLanguageExt$fGenericLanguageExt$fShowIRFormat $fEqIRFormat$fGenericIRFormat $fShowCodegen $fEqCodegen$fGenericCodegen$fShowConsoleWidth$fEqConsoleWidth$fGenericConsoleWidth$fShowOptimisation$fEqOptimisation$fGenericOptimisation $fShowLogCat $fEqLogCat $fOrdLogCat$fGenericLogCat$fEqOpt $fGenericOptBCASSIGN ASSIGNCONSTUPDATEMKCONCASEPROJECT PROJECTINTO CONSTCASECALLTAILCALL FOREIGNCALLSLIDEREBASERESERVEADDTOPTOPBASEBASETOPSTOREOLDOPNULLERRORRegRValLTTmptoBCcleanbcisConstmoveRegassignconCase constCasecaseAltconstAlt defaultAlt $fShowReg$fEqReg$fShowBC writePortable$fToJSONAccessibility$fToJSONCaseInfo$fToJSONCaseAlt' $fToJSONSC'$fToJSONCaseDefs$fToJSONNameType$fToJSONImplicitInfo$fToJSONBinder$fToJSONAppStatus $fToJSONUExp $fToJSONTT $fToJSONDef$fToJSONMetaInformation$fToJSONTotality$fToJSONRigCount $fToJSONReg $fToJSONBC $fToJSONSAlt $fToJSONSExp $fToJSONSDecl $fToJSONDAlt $fToJSONDExp $fToJSONDDecl$fToJSONPrimFn $fToJSONIntTy$fToJSONArithTy $fToJSONConst $fToJSONLAlt'$fToJSONCaseType $fToJSONLVar $fToJSONLExp $fToJSONLOpt $fToJSONLDecl$fToJSONExport $fToJSONFDesc$fToJSONExportIFace $fToJSONName$fToJSONCodegenInfo$fToJSONCodegenFileinterMapindent serializeReg serializeCaseserializeDefault serializeBC serializedumpBCTacticAttackClaimClaimFnReorderExactFill MatchFillPrepFill CompleteFillRegretSolve StartUnifyEndUnifyUnifyAllCompute ComputeLetSimplify WHNF_ComputeWHNF_ComputeArgsEvalInCheckInIntroIntroTyForallLetBind ExpandLetRewriteEquivPatVarPatBindFocusDefer DeferTypeImplementationAutoArg SetInjectiveMoveLast MatchProblems UnifyProblems UnifyGoal UnifyTerms ProofStateUndoQEDPSthnameholesusednsnextnameglobal_nextnameptermptype dontunifyunified notunifieddottedsolvedproblems injectivedeferredimplementationsautospsnamespreviouscontext datatypesplogunifylogdonerecentswhile_elaborating constraint_nsnowElaboratingPSdoneElaboratingAppPSdoneElaboratingArgPSnewProof envAtFocus goalAtFocus dropGiven keepGiven getProvenance processTactic"$fPrettyProofStateOutputAnnotation$fShowProofState $fShowTacticElabElab' ElabStateESproof proofFailexplicit addPSname getPSnames saveState loadState getNameFrom setNextNameinitNextNameFrom transformErrerrAterunAuxerunrunElabexecElabinitElaborator elaborate updateAuxgetAuxunifyLog getUnifyLogprocessTactic'updatePSnow_elaboratingdone_elaborating_appdone_elaborating_argelaborating_app get_context set_context get_datatypes set_datatypesget_global_nextnameset_global_nextnameget_term update_termget_envget_inj get_holes get_usedns get_probs get_recentsis_guess get_guessget_type get_type_val get_deferredcheckInjectiveget_implementations get_autos unique_hole unique_hole'eloggetLogattackclaimclaimFn unifyGoal unifyTermsexactfill match_fill prep_fill complete_fillsolve start_unify end_unify unify_allregretcompute computeLet whnf_computewhnf_compute_argseval_incheck_inintrointroTyforallletbind expandLetrewriteequivpatvarpatvar'patbindfocusmovelastdotterm get_dottermzipHere matchProblems unifyProblemsdefer deferTypeimplementationArgautoArgsetinj proofstatereorder_claimsqedundo prepare_applyapply match_applyapply'apply2 apply_elab checkPiGoal simple_app infer_appdep_apparg no_errorstry handleErrortry'tryCatchtryWhentryAlltryAll' prunStateTdebugElaboratorqshow dumpprobs$fShowElabState SyntaxInfoSynusing syn_params syn_namespaceno_imp imp_methods decoration inPatternimplicitAllowedconstraintAllowedmaxline mut_nestingdsl_infosyn_in_quasiquote syn_toplevelwithAppAllowedUsing UImplicit SyntaxRulessyntaxRulesListSSymbolKeywordSymbolBindingExpr SimpleExprSyntaxRuleDeclRule SynContext PatternSyntax TermSyntax AnySyntaxDSLDSL'dsl_bind dsl_applydsl_puredsl_var index_first index_next dsl_lambdadsl_letdsl_piOptInfoOptimise inaccessible detaggable forceableFnInfo fn_paramsTIData TIPartial TISolution RecordInfoRIrecord_parametersrecord_constructorrecord_projections InterfaceInfoCIimplementationCtorNameinterface_methodsinterface_defaults"interface_default_super_interfacesinterface_impparamsinterface_paramsinterface_constraintsinterface_implementationsinterface_determinersPArgArgOpt AlwaysShow HideDisplayInaccessibleArg UnknownImpPArg'PImpPExp PConstraint PTacImplicitpriority machine_infargoptspnamegetTm getScriptPDoPDo'DoExpDoBindDoBindPDoLetDoLetP DoRewritePTacticPTactic'IntrosRefineDoUnifyUnfocus MatchRefineLetTacLetTacTyTrivialTCImplementationTryTSeq ApplyTactic ByReflectionReflectGoalTypeTCheckTEvalTDocStrTSearchSkipTFailQedAbandonSourceFCPAltType ExactlyOne FirstSuccess TryImplicitPTermPQuotePRef PInferRefPPatvarPLamPPiPLetPTypedPAppPWithAppPAppImplPAppBind PMatchApp PIfThenElsePCasePTrue PResolveTCPRewritePPairPDPairPAs PAlternativePHiddenPType PUniversePGoal PConstant PlaceholderPDoBlockPIdiomPMetavarPProofPTactics PElabError PImpossiblePCoercedPDisamb PUnifyLog PNoImplicits PQuasiquotePUnquote PQuoteNamePRunElab PConstSugarPunInfoIsTypeIsTerm TypeOrTermPClausePDataPDeclPData' PDatadecl PLaterdecld_name d_name_fcd_tconPClause'PWithPClauseRPWithRElabDEState case_decls delayed_elab new_tyDecls highlighting auto_bindsimplicit_warningsRDeclInstructions RTyDeclInstrsRClausesInstrsRAddImplementationRDatatypeDeclInstrsRDatatypeDefnInstrs DirectiveDLibDLinkDFlagDIncludeDHideDFreezeDThaw DInjective DSetTotalDAccessDDefaultDLogging DDynamicLibs DNameHintDErrorHandlers DLanguage DDeprecateDFragileDAutoImplicitsDUsedPDecl'PFixPTy PPostulatePClausesPCAFPParamsPOpenInterfaces PNamespacePRecord PInterfacePImplementationPDSLPSyntaxPMutual PDirective PProvider PTransform PRunElabDecl ProvideWhat ProvideWhat'ProvTerm ProvPostulateFnOptsFnOpt InlinableTotalFn PartialFn CoveringFn AllGuarded AssertTotal DictionaryOverlappingDictionaryImplicit NoImplicitCExport ErrorHandler ErrorReverse ErrorReduce Reflection Specialise ConstructorAutoHint PEGeneratedStaticFnPlicityImpExp ConstraintTacImppargoptspstaticpparampscoped pinsourcepcountpscriptStaticDynamicFixDeclFixFixityInfixlInfixrInfixNPrefixNprec ElabShellCmdEQEDEAbandonEUndo EProofState EProofTermEEvalECheckESearchEDocStrIdrisIBCWriteIBCFixIBCImp IBCStatic IBCInterface IBCRecordIBCImplementationIBCDSLIBCDataIBCOpt IBCMetavar IBCSyntax IBCKeyword IBCImport IBCImportDir IBCSourceDirIBCObjIBCLib IBCCGFlagIBCDyLib IBCHeader IBCAccessIBCMetaInformationIBCTotal IBCInjectiveIBCFlags IBCFnInfoIBCTrans IBCErrRev IBCErrReduceIBCCGIBCDoc IBCCoercionIBCDef IBCNameHint IBCLineAppIBCErrorHandlerIBCFunctionErrorHandler IBCPostulate IBCExternIBCTotCheckErrIBCParsedRegion IBCModDocsIBCUsage IBCExport IBCAutoHint IBCDeprecate IBCFragile IBCConstraintCGInfocallsallCallsscgusedpos UsageReasonSCGEntry SizeChangeSmallerSameBiggerUnknownIStatett_ctxtidris_constraints idris_infixesidris_implicits idris_staticsidris_interfacesidris_openimpls idris_records idris_dslsidris_optimisationidris_datatypesidris_namehints idris_patdefs idris_flagsidris_callgraphidris_docstringsidris_moduledocsidris_tyinfodata idris_fninfoidris_transformsidris_autohintsidris_totcheckidris_defertotcheckidris_totcheckfail idris_options idris_nameidris_lineappsidris_metavarsidris_coercions idris_errRevidris_errReduce syntax_rulessyntax_keywordsimported idris_scprims idris_objs idris_libs idris_cgflags idris_hdrsidris_imported proof_listerrSpanparserWarnings lastParse indent_stack brace_stackidris_parsedSpan hide_listdefault_access default_total ibc_write compiled_soidris_dynamic_libsidris_language_extensionsidris_outputmodeidris_colourReplidris_colourThemeidris_errorhandlers idris_nameIdxidris_function_errorhandlersmodule_aliasesidris_consolewidthidris_postulates idris_externsidris_erasureUsedidris_repl_defs elab_stack idris_symbols idris_exportsidris_highlightedRegionsidris_parserHighlightsidris_deprecatedidris_inmodule idris_ttstats idris_fragileidris_interactiveOptsInteractiveOptsinteractiveOpts_indentWithinteractiveOpts_indentClauseDefaultTotalityDefaultCheckingTotalDefaultCheckingPartialDefaultCheckingCovering OutputMode RawOutputIdeModePPOption ppopt_implppopt_desugarnats ppopt_pinames ppopt_depthppopt_displayrigIOption opt_logLevel opt_logcats opt_typecaseopt_typeintype opt_coverage opt_showimpopt_errContextopt_repl opt_verbose opt_nobanner opt_quiet opt_codegen opt_outputTy opt_ibcsubdiropt_importdirsopt_sourcedirs opt_tripleopt_cpu opt_cmdline opt_origerr opt_autoSolveopt_autoImport opt_optimiseopt_printdepth opt_evaltypesopt_desugarnats opt_autoimplsElabInfoEInfoparamsinblockliftname namespaceelabFC constraintNSpe_depth noCaseLift rhs_trans rec_elabDeclElabWhatETypesEDefnsEAlltoplevel toplevelWith eInfoNames defaultOptsdefaultOptimisedefaultPPOptionverbosePPOptionppOption ppOptionIstprimDefsinitialInteractiveOpts idrisInit catchError throwError is_scopedimplimpl_gen forall_impforall_constraintexpl expl_param expl_linear constrainttacimpl inlinable dictionary initEStatehighlightSource mapPDataFC mapPDeclFCdeclared tldeclareddefinedupdateNupdateNs mapPTermFCmapPTpimppexppconstptacimp highestFC syntaxNames syntaxSymbolsemptySyntaxRulesupdateSyntaxRulesinitDSL defaultSyntaxexpandNSbiprimfcinferTyinferCon inferDecl inferOptsinfTerminfP getInferTerm getInferType primNamesunitTyunitConfalseDocfalseTypairTypairConupairTyupairConeqTyeqConeqDoceqDecl eqParamDoceqOpts modDocNamesigmaTysigmaConpiBindpiBindpannotationColourconsoleDecorateisPostulateName prettyImp prettyIst pprintPTermbasename isHoleName containsHole prettyNameshowCImpshowDImp showDecls showDeclImpgetImpsgetExps getShowArgs getConstsgetAllshowNameshowTm showTmImpls showTmOpts getPArity allNamesIn boundNamesInimplicitNamesInnamesIn usedNamesIngetErasureInfo $fShowFixity $fOrdFixDecl $fShowFixDecl$fSizedPTactic' $fSizedPDo' $fSizedPArg' $fSizedPTerm$fPrettyPTermOutputAnnotation $fShowPTerm $fShowPData' $fShowPDecl' $fShowIState$fShowPClause'$fShowElabWhat $fEqElabWhat $fShowIOption $fEqIOption$fGenericIOption$fShowPPOption$fShowOutputMode$fShowDefaultTotality$fEqDefaultTotality$fGenericDefaultTotality$fShowInteractiveOpts$fGenericInteractiveOpts$fShowSizeChange$fEqSizeChange$fGenericSizeChange $fShowCGInfo$fGenericCGInfo $fEqFixity$fGenericFixity $fEqFixDecl$fGenericFixDecl $fShowStatic $fEqStatic $fOrdStatic $fDataStatic$fGenericStatic $fShowFnOpt $fEqFnOpt$fGenericFnOpt$fShowProvideWhat'$fEqProvideWhat'$fFunctorProvideWhat'$fGenericProvideWhat'$fGenericDirective $fEqPunInfo $fShowPunInfo $fOrdPunInfo $fDataPunInfo$fGenericPunInfo $fEqPAltType $fOrdPAltType$fDataPAltType$fGenericPAltType$fShowPTactic' $fEqPTactic' $fOrdPTactic'$fFunctorPTactic'$fFoldablePTactic'$fTraversablePTactic'$fDataPTactic'$fGenericPTactic'$fEqPDo' $fOrdPDo' $fFunctorPDo' $fDataPDo' $fGenericPDo' $fShowArgOpt $fEqArgOpt $fOrdArgOpt $fDataArgOpt$fGenericArgOpt $fShowPArg' $fEqPArg' $fOrdPArg'$fFunctorPArg' $fDataPArg'$fGenericPArg' $fEqPTerm $fOrdPTerm $fDataPTerm$fGenericPTerm $fShowPlicity $fEqPlicity $fOrdPlicity $fDataPlicity$fGenericPlicity$fFunctorPData'$fGenericPData'$fShowElabShellCmd$fEqElabShellCmd$fShowRecordInfo$fGenericRecordInfo $fShowTIData$fGenericTIData $fShowFnInfo$fGenericFnInfo $fShowOptInfo$fGenericOptInfo $fShowDSL' $fFunctorDSL' $fGenericDSL'$fShowSynContext$fGenericSynContext $fShowSSymbol $fEqSSymbol$fGenericSSymbol $fShowUsing $fEqUsing $fDataUsing$fGenericUsing$fShowSyntaxInfo$fGenericSyntaxInfo$fFunctorPDecl'$fGenericPDecl' $fShowSyntax$fGenericSyntax$fFunctorPClause'$fGenericPClause'$fGenericSyntaxRules$fShowIBCWrite$fGenericIBCWrite$fShowInterfaceInfo$fGenericInterfaceInfo$fGenericIState$fNFDataInteractiveOpts$fNFDataIState$fNFDataDefaultTotality$fNFDataSyntaxInfo $fNFDataUsing$fNFDataSSymbol$fNFDataSyntax$fNFDataSynContext $fNFDataDSL'$fNFDataTypeInfo$fNFDataOptInfo$fNFDataRecordInfo$fNFDataInterfaceInfo $fNFDataPArg' $fNFDataPDo'$fNFDataPTactic'$fNFDataPAltType $fNFDataPTerm$fNFDataPData'$fNFDataPClause'$fNFDataPunInfo$fNFDataProvideWhat'$fNFDataPDecl'$fNFDataDirective$fNFDataDataOpt $fNFDataFnOpt$fNFDataPlicity$fNFDataArgOpt$fNFDataStatic$fNFDataFixDecl$fNFDataFixity$fNFDataCGInfo$fNFDataLogCat$fNFDataIRFormat$fNFDataCodegen$fNFDataFnInfo$fNFDataSizeChange$fNFDataDocTerm$fNFDataInline $fNFDataBlock$fNFDataIBCWrite$fNFDataOutputType$fNFDataColourTheme$fNFDataOptimisation$fNFDataLanguageExt$fNFDataIOption$fNFDataTIData$fNFDataREPLPort $fNFDataOpt$fNFDataSyntaxRules$fNFDataPrimFn$fNFDataConsoleWidth$fNFDataDocstring$fNFDataOutputMode$fNFDataPortNumber$fNFDataIdrisColour$fNFDataDynamicLibField fgetState fputState fmodifyState ctxt_lookupist_optimisationopt_inaccessibleopt_detaggable opt_forceable ist_callgraph cg_usedposopts_idrisCmdline known_termsknown_interfacesrepl_definitionsidris_fixities$fCategoryTYPEFieldgetScreenWidthcatchIO isWindowsisDarwintempfile readSourcereadSourceStrict writeSourcewriteSourceTextisATTY withTempdirrmFilesetupBundledCC EitherErrLeftErrRightOK getContext forCodegengetObjectFiles addObjectFilegetLibsaddLibgetFlagsaddFlagaddDyLibgetAutoImports addAutoImportaddDefinedNamegetDefinedNamesaddTTdumpTTaddHdr addImported addLangExt dropLangExtaddTrans addErrRev addErrReduceaddErasureUsage addExport addUsedNamegetErasureUsage getExportstotcheckdefer_totcheckclear_totchecksetFlagsaddFnOpt setFnInfosetAccessibilitygetFromHideList setTotalitysetInjectivity getTotalitygetCoercionsToaddToCGaddCalls addTyInferredaddTyInfConstraints isTyInferredaddFunctionErrorHandlers getAllNames getCGAllNames addCGAllNamesallNames addCoercion addDocStr addNameHint getNameHints addDeprecated getDeprecated addFragile getFragile push_estack pop_estackaddImplementation addOpenImpl setOpenImpl getOpenImpl addInterfaceupdateIMethods addRecord addAutoHint getAutoHintsaddIBCclearIBC resetNameIdx addNameIdx addNameIdx' getSymbolgetHdrs getImported setErrSpanclearErrgetSOsetSO getIState putIState updateIState withContext withContext_runIOgetNameaddInternalAppgetInternalApp clearOrigPats clearPTypescheckUndefined isUndefined setContext updateContextaddConstraints addDeferredaddDeferredTyCon addDeferred' solveDeferred getUndefined isMetavarNamegetWidthsetWidthsetDepthtypeDescriptiontype1Doc isetPromptisetLoadedRegion setLogLevel setLogCats setCmdLine getCmdLinegetDumpHighlighting getDumpDefun getDumpCaseslogLevel setAutoImpls getAutoImpls setErrContext errContext getOptimise setOptimise addOptimiseremoveOptimise setOptLeveluseREPLsetREPL showOrigErrsetShowOrigErr setAutoSolve setNoBanner getNoBanner setEvalTypesgetDesugarNatssetDesugarNatssetQuietgetQuiet setCodegencodegen setOutputTyoutputTy setIdeModesetTargetTriple setTargetCPUverbose setVerboseiReport typeInType setTypeInTypecoverage setCoverage setIBCSubDir valIBCSubDir addImportDir setImportDirs allImportDirsrankedImportDirs addSourceDir setSourceDirs allSourceDirs setColouriseimpShow setImpShow setColourlogLvl logCoverage logErasure logParserlogElab logCodeGenlogIBC logLvlCats cmdOptTypenoErrors setTypeCase getIndentWith setIndentWithgetIndentClausesetIndentClause expandParams expandParamsDmapsndexpandImplementationScope getPriority addStatics addToUsingaddUsingConstraints addUsingImplsgetUnboundImplicitsimplicit implicit' implicitise addImplPat addImplBoundaddImplBoundInfaddImpladdImpl'aiFnimpInexpArg stripLinearstripUnmatchablemkPApp findStaticstoEither matchClause matchClause' substMatches substMatchsubstMatchShadowsubstMatchesShadowshadow mkUniqueNames$fMonadEitherErr$fApplicativeEitherErr$fFunctorEitherErrwhoCallscallsWho transformPatstransformPatsWithapplyTransRulesapplyTransRulesWithnamespacesInNS namesInNS inlineDef inlineTerm errReverseextractUnquotes desugarAsbugaddrresugar delabSugareddelab delabWithEnvdelabMV delabDirectdelabTydelab'delabTy' pprintDelab pprintNoDelab pprintDelabTy pprintErrannName fancifyAnnotsRFunDefn RDefineFun RFunClause RMkFunClauseRMkImpossibleClause RDataDefnRDefineDatatypeRConstructorDefn RConstructorRTyDeclRDeclareRFunArgargNameargTy argPlicityerasure rFunArgToPArgreflmtacNreify reifyBool reifyListreifyReportPartsreifyTTreifyRaw reifyTTNamereflect reflectRaw reflectFixityreflectTTQuotePatternreflectRawQuotePatternreflectTTQuotereflectRawQuotereflectNameType reflectNamemkList reflectEnvreifyEnvrawList rawPairTyrawPair reflectErr reflectFC fromTTMaybereifyReportPart reifyTyDecl reifyFunDefnreifyRDataDefn envTupleType reflectListgetArgs buildFunDefnsbuildDatatypes reflectArgreflectDatatypereflectFunDefn$fShowRErasure$fShowRPlicity $fShowRFunArg $fShowRTyDecl$fShowRTyConArg$fShowRCtorArg$fShowRDatatype$fShowRFunClause$fShowRFunDefntrivial trivialHoles proofSearch resolveTCpe_apppe_def pe_clauses pe_simple PEArgType ImplicitS ImplicitD ConstraintS ConstraintD ExplicitS ExplicitDUnifiedD partial_evalspecType mkPE_TyDecl mkPE_TermDecl getSpecApps $fEqPEArgType$fShowPEArgTypeMessage messageExtent messageText messageSource OutputDocpshow formatMessageiWarn emitWarningiRenderiPrintTermWithTypeiPrintFunTypes iRenderOutput iRenderResult iRenderError iPrintResult iPrintError iputStrLniputStridemodePutSExpiputGoal warnTotalityprintUndefinedNamesprettyDocumentedIstsendParserHighlightingsendHighlightingwriteHighlightsclearHighlightsrenderExternal$fMonadExceptionExceptT$fMessageSimpleWarningMark ParseErrorParsingParser runparser prettyErrormarkrestoregetFC addExtent trackExtentextent appExtent$fMessageParseError IdrisParser parseErrorDoc someSpacetoken highlightkeywordclearParserWarningsreportParserWarnings parserWarningisEoleol docComment whiteSpace stringLiteral charLiteralnaturalfloatcharstringlcharsymbolreserved identifieriName maybeWithNSname packageNamebindListcommaSeparated pushIndent popIndentindented indentedBlockindentedBlock1indentedBlockSlookAheadMatches openBlock closeBlock terminator notEndApp notEndBlockindentGt notOpenBraces accessibilityaddAccaccData fixErrorMsgtablebacktickOperator operatorName operatorFrontfnNamefixitycheckDeclFixitycheckNameFixity fixityTypeopCharsoperatorLettercommentMarkersinvalidOperatorssymbolicOperator reservedOpiucheckshowErrreport idrisCatch setAndReportifailierrortclifttcliftAttctry getErrSpan warnDisambcheckAllCoveringcheckIfGuarded checkPositivecheckDeclTotalityverifyTotalitybuildSCGcheckSizeChange$fShowGuardednessProvidedProvide providerTy getProvided$fShowProvided $fEqProvided$fFunctorProvidedPkgName IFileTypeIDRLIDRIBC unPkgNameunInitializedPkgNamepkgNamepkgIndexibcPathNoFallback findImportfindIBC findInPath findPkgIndexinstalledPackages $fEqIFileType $fEqPkgName $fShowPkgName$fShowIFileType$fOrdIFileTypeCommandQuitHelpEvalNewDefnUndefineCheckCoreDocStrTotCheckReloadWatchLoadRunShellCommandChangeDirectory ModImportEditCompileExecuteExecValMetavarsProveAddProofRmProof ShowProofProofs UniversesLogLvl LogCategory VerbositySpecWHNF TestInlineDefnMissing DynamicLink ListDynamicPattelabSearch CaseSplitAt AddClauseFromAddProofClauseFromMakeWithMakeCase DoProofSearchUnsetOptNOP SetColourColourOn ColourOffListErrorHandlersSetConsoleWidthSetPrinterDepthBrowseMakeDoc ShowVersionWarrantyPPrint TransformInfo DebugInfo DebugUnifyPkgDescpkgnamepkgdepspkgbrief pkgversion pkgreadme pkglicense pkgauthor pkgmaintainer pkghomepage pkgsourceloc pkgbugtrackerlibdepsobjsmakefile idris_opts sourcedirmodules idris_mainexecout idris_tests defaultPkg $fShowPkgDescdirectiveActionIBCPhase IBC_BuildingIBC_REPLhasValidIBCVersionloadIBC loadPkgIndexwriteIBC writePkgIndex$fBinaryIRFormat$fBinaryCodegen$fBinarySSymbol $fBinaryDSL'$fBinarySyntax$fBinarySynContext$fBinaryTypeInfo$fBinaryFnInfo$fBinaryOptInfo$fBinaryRecordInfo$fBinaryInterfaceInfo $fBinaryPArg' $fBinaryPDo'$fBinaryPTactic'$fBinaryPAltType $fBinaryPTerm$fBinaryPunInfo$fBinaryPData'$fBinaryPClause'$fBinarySyntaxInfo $fBinaryUsing$fBinaryProvideWhat'$fBinaryPDecl'$fBinaryDirective$fBinaryLanguageExt$fBinaryDefaultTotality$fBinaryPlicity$fBinaryStatic$fBinaryArgOpt$fBinaryFixDecl$fBinaryFixity $fBinaryFnOpt$fBinaryDataOpt$fBinaryMetaInformation$fBinaryTotality$fBinaryPReason$fBinaryAccessibility $fBinaryDef$fBinaryCaseInfo$fBinaryCaseDefs$fBinaryCaseAlt' $fBinarySC'$fBinaryCaseType$fBinaryCGInfo$fBinarySizeChange$fBinaryNumWrapper$fBinaryCodeAttr$fBinaryListType$fBinaryInline $fBinaryBlock$fBinaryDocTerm$fBinaryOptions$fBinaryDocstring$fShowIBCPhase $fEqIBCPhase $fShowIBCFileperformUsageAnalysis mkFieldName $fShowArg$fEqArg$fOrdArg $fShowVarInforecheckCrecheckC_borrowingcheckDeprecated checkFragileiderrcheckDef checkAddDefinaccessibleImpsinaccessibleArgs elabCaseBlock checkInferred inferredDiff checkDocs decorateidpbindspbtygetPBtyspsolvepvarsgetFixedInType getFlexInTypegetParamsInTypegetTCinjgetTCParamsInType paramNames getLinearUsed getUniqueUsedgetStaticNames getStaticsmkStatic mkStaticTycheckVisibility findParams setDetaggabledisplayWarningspropagateParams orderPatsliftPatsisEmpty hasEmptyPat findLinear setLinear linearArg pruneByType isPlausible elabRewriteelabRewriteLemma$fShowParamInfoDocsDocs'FunDocDataDoc InterfaceDoc RecordDocNamedImplementationDocModDocFunDoc'FD pprintDocsgetDocspprintConstDocs pprintTypeDoc$fFunctorFunDoc'$fFunctorDocs' generateDocs applyOpts$fOptimisableTT$fOptimisableBinder$fOptimisableBinder0$fOptimisableRaw$fOptimisableEither$fOptimisable[]$fOptimisable(,,)$fOptimisable(,) debindAppdesugar TacticArgNameTArgExprTArgAltsTArg StringLitTArg SetOrUpdateFieldSet FieldUpdateSynMatchSynTmSynBindallowImp disallowImp scopedImp allowConstrfullExpr tryFullExprexpropExprexpr' externalExprsimpleExternalExpr extensions extensionupdateSynMatch internalExpr impossiblecaseExpr caseOptionwarnTacticDeprecation proofExpr tacticsExpr simpleExpr bracketed bracketed' dependentPair bracketedExpr modifyConstalt hsimpleExprdisamb noImplicitsapp implicitArg constraintArg quasiquoteunquote namequote recordTypemkTypetypeExprlambda rewriteTermrigCountlet_ let_bindingif_ quoteGoal bindsymbol explicitPi autoImplicitdefaultImplicitnormalImplicit constraintPi implicitPi unboundPiunboundPiNoConstraintpipiOptsconstraintListconstraintList1 typeDeclList tyOptDeclListlistExprdoBlockdo_do_altidiom constantsconstantverbatimStringLiteralstatictacticstactic fullTactic$fShowSynMatchrecordrecordParameterdataIrecordIdataOptsdata_ constructorsimpleConstructordslcheckDSLoverloadmkPatTm genClausesvalidCoverageCaserecoverableCoverageElabCtxte_inarge_isfn e_guardede_intypee_qq e_nomatching ElabResult resultTermresultMetavarsresultCaseDecls resultContext resultTyDeclsresultHighlighting resultNameElabModeETyDecl ETransLHSELHS EImpossibleERHSbuildbuildTCgetUnmatchable initElabCtxtgoal_polymorphicelabpruneAlt findHighlight solveAuto solveAutos tcRecoverabletrivial' trivialHoles' proofSearch' resolveTC'collectDeferred metavarName runElabActionrunTacelaboratingArgErrwithErrorReflectionsolveAllprocessTacticDecls $fEqElabMode elabValBindelabVal elabDocTermselabExecelabREPL buildTypeelabType elabType' elabPostulate elabExtern searchByType searchPreddefaultScoreFunction$fMonoidAsymMods $fMonoidSided $fMonoidScore $fOrdScore $fEqAsymMods$fShowAsymMods $fEqSided $fShowSided $fEqScore $fShowScore $fShowStateelabData elabRecord elabInterface $fShowMArgTy elabTransform elabRunElabelabImplementation elabClauses forceWithelabPE checkPossiblecheckPossibles findUnique elabClausemapRHS mapRHSdeclexecute elabProviderrecinfoelabMain elabPrims elabDeclselabDecl elabDecl' ImportInfoimport_reexport import_path import_renameimport_namespaceimport_locationimport_modname_location moduleNamedecl addReplSyntax parseExpr parseConst parseTacticparseElabShellStep parseImports fixColour loadModule loadFromIFileparseCmd setOptionshelpallHelpreplCompletionproverCompletion$fEqCompletionModeprover showProof showRunElab ModuleTreeMTreemod_pathmod_needsRecheckmod_timemod_depsgetModuleFiles getImports buildTree$fShowModuleTree splitOnLine replaceSplitsgetUniqnameRoot getClausegetProofClausemkWith nameMissing caseSplitAt addClauseFromaddProofClauseFrom addMissingmakeWithmakeCase doProofSearch makeLemmaaproposaproposModules $fApropos[]$fAproposMaybe $fApropos(,)$fAproposDocstring$fAproposConst $fAproposTT$fAproposBinder $fAproposDef $fAproposName findExports getExpNamesCGConfheaderfooterjsbnPath extraRunTimeCGStats usedBigIntpartialApplications hiddenClasses codegenJs$fMonoidCGStatsJSTargetNode JavaScriptcodegenJavaScript codegenNode $fEqJSTargetcodegenCcompilegenerategetIdrisFlagsLibgetIdrisFlagsIncgetIdrisFlagsEnv getIdrisCCgetIdrisVersiongetIdrisVersionNoGitgetIdrisUserDataDirgetIdrisInitScriptgetIdrisHistoryFilegetIdrisInstalledPackagesgetIdrisLoggingCategories defaultPort loadInputsbannerwarrantyrepl startServer runClient idemodeStartproofsprocess replSettingsrunMain idrisMainidrisshowIdrisCRTSDirshowExitIdrisCRTSDirshowIdrisJSRTSDirshowExitIdrisJSRTSDirshowIdrisFlagsLibsshowExitIdrisFlagsLibsshowIdrisDataDirshowExitIdrisDataDirshowIdrisLibDirshowExitIdrisLibDirshowIdrisDocDirshowExitIdrisDocDirshowIdrisFlagsIncshowExitIdrisFlagsIncshowIdrisInstalledPackagesshowExitIdrisInstalledPackagesshowIdrisLoggingCategoriesshowExitIdrisLoggingCategories showIdrisInfoshowExitIdrisInfo runArgParserexecArgParserPure pureArgParserPParser parseDescpPkgpPkgNamefilename textUntilEolclausecommaSeppOptionspClause getPkgDescbuildPkgcheckPkgreplPkgcleanPkg documentPkgtestPkg installPkg auditPackage buildModstestLibrmIBCrmIdxrmExe toIBCFile installIBC installIdx installObjmkDirCmdinPkgDir makeTargetmake mergeOptions extraLibDirsmkSGRcolouriseWithSTX getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileNameoverrideIdrisSubDirWithhasBundledToolchaingetToolchainDirlistenOnLocalhostlistenOnLocalhostAnyPort/annotated-wl-pprint-0.7.0-DNYYSY1DDb7tEMAJgGBVV!Text.PrettyPrint.Annotated.LeijenhPutDocputDocdisplayDecoratedAdisplayDecorated displaySpans displayIOdisplaySdisplay renderCompact renderPretty noAnnotateannotategroupnestingcolumnnest linebreaklinetextemptyalignhangwidth fillBreakrationaldoubleintegerintboolpipeequals backslashdotspacecommacolonsemidquotesquoterbracketlbracketrbracelbraceranglelanglerparenlparenenclosebracketsanglesparensbracesdquotessquotes softbreaksoftline<$$><$><+><>vcathcatfillCatcatvsephsepfillSepsep punctuate encloseSep semiBracestupledlistDocSpanList SimpleDocSEmptySCharSTextSLine SAnnotStart SAnnotStopPrettyprettySizedsize nestingSizeWkEnvTT weakenEnv weakenTmEnvWkOption TTypeInTType CheckConvLineTypeProgBlankCommvarsInQueue SolverStatequeue domainStorecons_lhscons_rhsDomainpruneGroupConGroupConTypeCNameCFnCSucCConst PartitionConsVarsPatPConPConst PInferredPVPSuc PReflectedPAnyPTyPateval MkContextEvalOptAtREPLRunTTUnfold EvalStatelimitednextholeblockingWDConWTConWPRef StackEntryWVWBindWApp WConstantWProjWTypeWUTypeWErased WImpossible cantUnifyUInfoUI BinderPathTermPath replaceTop rebuildTerm rebuildBinderfindHolehole updateEnvupdateSolvedPathPTpath subterm_envsubtermupdatesLetTLetVGuessTGuessVTopAppLAppRInBindInScopedoInlineghc-prim GHC.Classesmax bindExprsbindExpr CodegenFileCGFilefileTypecgInfofgetfsetisMinTTY GHC.TypesTrueFalsereplaceUnderscore errorIndent renameMNsreflCallreflectNameQuotePatternrawBool rawTripleTy RDatatypeRCtorArgRCtorParameter RCtorField RTyConArg RParameterRIndexRPlicity RExplicit RImplicit RConstraintRErasureRErased RNotErasedfindImplementationsPEDeclinterfaceConstraintconcreteInterface mkNewPatsconsoleDisplayAnnotatedideModeReturnAnnotated SimpleWarningAnnATextATaggedASplitsimpleWhiteSpacesingleLineCommentmultiLineComment initsEndAtmkName lastIndentkeepTerminatoraccessibility'baseGHC.Base. calcTotality GuardednessToplevel UnguardedGuardedDelayeddoesFileExist'doesDirectoryExist' processAccessIBCFilever sourcefile ibc_importsibc_importdirsibc_sourcedirs ibc_implicits ibc_fixes ibc_staticsibc_interfaces ibc_recordsibc_implementationsibc_dsls ibc_datatypes ibc_optimise ibc_syntax ibc_keywordsibc_objsibc_libs ibc_cgflagsibc_dynamic_libsibc_hdrsibc_totcheckfail ibc_flags ibc_fninfoibc_cgibc_docstringsibc_moduledocsibc_transforms ibc_errRev ibc_errReduce ibc_coercions ibc_lineapps ibc_namehintsibc_metainformationibc_errorhandlersibc_function_errorhandlers ibc_metavars ibc_patdefsibc_postulates ibc_externsibc_parsedSpan ibc_usage ibc_exports ibc_autohintsibc_deprecatedibc_defs ibc_total ibc_injective ibc_access ibc_fragileibc_constraints ibc_langextsVarInfoviDepsviFunArgviMethodCondDepSetUseMap minimalUsage forwardChain buildDepMapVIArgResult ParamInfoIndexParam ImplicitIndex ImplicitParamhowMuchNsDictNsInfo FullDocstringNsItemNsNameFailableerrtoNsNamegetNs rootNsStr nsName2Str fetchInfo removeOrphans filterName filterIncludetraceNss referredNssnsDict getAccess mayHaveDocsloadDocsextractPTermNamesextract extractPArg extractPDoextractPTactic createDocs createIndex createNsDoc genRelNsPath genTypeHeader createFunDoccreateOtherDocwrappernbspexistingNamespacescopyDependencies nsDocstring nsContentsapplyDataOptRT Optimisablevar mtl-2.2.1-DscMMmDQUE6GBfOSl4qMUHControl.Monad.State.Classstate Data.OldList\\ integer-gmpGHC.Integer.TypeIntegerIntCharDoubleStringStateargsAndInterfacesscore usedNames InterfacesArgsDAGScore transposition equalityFlipsasymModsSidedAsymMods searchUsing reverseDag computeDagPusedVars deleteFromDagbothscoreCriterionsubsetsmatchTypesBulkleftrightModsargApp interfaceAppinterfaceIntroelabProjection elabUpdatein_nameasArgrecName asPRefArgelabRecordFunctions memberDocs expandMethNSfindDetsMArgTyIAEACAimpBind addParamscheckInjectiveDefimport_progdecl' syntaxDecl addSyntax syntaxRulepattern syntaxSymfnDeclfnDecl'fnOptsfnOpt postulateusing_ openInterfacemutualimplementationBlockinterfaceBlock interface_implementation docstring usingDeclList usingDeclcafargExprrhswExpr whereBlockcodegen_ directivetotalityprovider transform runElabDecl parseProgcollect loadModule' loadSource' loadSourceaddHidesnames completeCmdCompletionModeUpTorunWithInterruptElabShellHistoryElabStepLetStepBothStepextractFileNamesplit mergePat' MergeStateMSnamemapinvented isApropos doCodegen BodyResTargetReturnBTDecBTSetBT DecConstBTGetExpBT CGBodyStatedefs lastIntNamereWrittenNamescurrentFnNameAndArgsusedArgsTailCallOptim isTailRec usedITBig partialApps hiddenCls codegenC'gitHashrunIdeModeCommandideModeForceTermImplicitsmkPromptlit execScript initScript