Fy       !"#$%&'()*+,-./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[\]^_`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"{"|"}"~""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""#########$$$$$$$$%%%%% % % % % % % % & & ' ( ( ( ( ) * * * * * * * * * * * + + + + + + + !+ "+ #+ $+ %+ &+ '+ (+ ), *, +, ,, -, ., /, 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 ~0 0 0 0 0 0 0 0 0 0 0 0 1 1 2 3 3 3 3 3 4 4 4 4 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 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 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 9 9 : : : : ; ; ; < < = = > > ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ !@ "@ #@ $@ %@ &@ '@ (@ )@ *@ +@ ,@ -@ .@ /@ 0@ 1@ 2@ 3@ 4@ 5@ 6@ 7@ 8@ 9A :A ;A <A =B >B ?B @B AB BC CD DD ED FD GD HD IE JF KG LH MI NI OI PI QI RI SI TI UI VI WI XI YI ZI [I \I ]I ^I _I `I aI bI cI dI eI fI gI hI iI jI kI lI mI nI oI pI qI rI sI tI uI vI wI xI yI zI {I |I }I ~I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I J K K K K K K K K K K L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L M N N N N N N O O O O O O O O O O O P P P P Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q !Q "Q #Q $Q %Q &Q 'Q (Q )Q *Q +Q ,Q -Q .Q /Q 0Q 1Q 2Q 3Q 4Q 5Q 6Q 7Q 8Q 9Q :Q ;Q <Q =Q >Q ?Q @Q AQ BQ CQ DQ EQ FR GR HR IR JR KR LR MR NS OS PS QS RS SS TS UT VT WT XU YU ZV [V \V ]V ^V _V `V aV bW cW dW eX fX gX hX iX jX kX lX mX nX oY pY qY rY sY tY uY vY wY xY yY zY {Y |Y }Y ~Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Z Z Z Z Z Z Z Z Z [ [ [ [ [ [ [ [ [ [ [ [ [ [ [ [ [ [b\None./23468   None ./23468FT  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSS  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRT6=<;:98715432-0/.(,+*)&'S%$#"!  >?@ABCDEFGHIJKLMNOPQR!%$#"!  &'(,+*)-0/.154326=<;:987>?@ABCDEFGHIJKLMNOPQRS]None./23468   ^None./23468   _None./23468   `None./23468 T U VT U V T U VNone./23468X(One kind of argument followed by anotherY#Zero or one of one kind of argumentZ$Zero or more of one kind of argument[5An Idris declaration, as might be contained in a file\The width of the console] do not use^No completion (yet!?)_)The command is the colour-setting command` The command takes a metavariableaThe command takes an optionb"The command takes a namespace namecThe command takes a numberd)The command takes a list of package nameseThe command takes a module namefThe command takes a filegThe command takes a namehThe command takes an expressioni6Use these for completion, but don't show them in :helpWXYZ[\]^_`abcdefghi WXYZ[\]^_`abcdefghiWhgfedcba`_^]\[ZYXiWhgfedcba`_^]\[ZYXi None ./23468jjjjNone./23468$Idris's default console colour theme3Set the colour of a string using POSIX escape codes CSet the colour of a string using POSIX escape codes, with trailing '\STX'? denoting the end (required by Haskeline in the prompt string)'klmnopqrstuvwxyz{|}~ %klmnopqrstuvwxyz{|}~%~tuvwxyz{|}ksrqponmlksrqponmlt uvwxyz{|}~ None ./23468IRead a source file, same as readFile but make sure the encoding is utf-8.JWrite a source file, same as writeFile except the encoding is set to utf-8  None ./23468 TUV VUT None ./23468:M aNone./23468 ]                           ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B    None +-./23468c&an environment with de Bruijn indices  normalised, so that they all refer to this environmentData declaration options8Set if a case function should be generated for data type6Set if an eliminator should be generated for data type'Set if the the data-type is coinductiveTerms in the core language. The type parameter is the type of identifiers used for bindings and explicit named references; usually we use TT /..Uniqueness type universe (disjoint from TType)the type of types at some level"special case for totality checkingan erased termTargument projection; runtime only (-1) is a special case for 'subtract one from BI'constantfunction, function type, arg a binding%a resolved de Bruijn-indexed variable#named references with type (P for  ParameterC, motivated by McKinna and Pollack's Pure Type Systems Formalized)Type constructorData constructorUniverse constraintsLess than or equal toStrictly less than*Universe expressions for universe checkingexplicit universe leveluniverse variableAll binding forms are represented in a uniform fashion. This type only represents the types of bindings (and their values, if any); the attached identifiers are part of the  constructor for the  type.A pattern variableA binding that occurs in a let expressionvalue for bound variable:A binding that occurs in a function type expression, e.g. (x:Int) -> ... 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. "type annotation 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).0>Reference to IBC file symbol table (used during serialisation)1Decorated function names2.Name of something which is never used in scope3Machine chosen names4Root, namespaces5User-provided name:eIdris errors. Used as exceptions in the compiler, but reported to users if they reach the top level.<NUser-specified message, proof term, goals with context (first goal is focused)M8Location, bad universe, old domain, new domain, suspectsiUsed for error reflectionn&Output annotations for pretty-printingoA 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.q*more general, isomorphic, or more specificr pprint bound vars, original termvname, doc overviewwtype, doc overviewy%^ The name and whether it is implicitzB^ The name, classification, docs overview, and pretty-printed type{Text formatting output:Output annotation for pretty-printed name - decides colourFC with equality<Source location. These are typically produced by the parser QbLocations with file only%Locations for machine-generated termsFilename: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 FC+Get the largest span containing the two FCsEmpty source locationSource location with file onlyReturn True if the argument /3 should be interpreted as the name of a typeclass.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.oif 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.<Count the number of instances of a de Bruijn index in a termFReplace 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.Cast 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.?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 amountGather up all the outer s and =s in an expression and reintroduce them in a canonical orderPretty-print a term4Pretty-printer helper for the binding site of a nameHIgnore source location equality (so deriving classes do not compare FCs)u      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~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 printed^ the bound name^ whether the name is implicit     J      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~{~}|nzyxwvutsrqpoimlkjchgfed:ba`_^]\[ZYXWVUTSRQPONMLKJIHGFEDCBA@?>=<;9687/543210%.-,+*)('&  $#"!                #"! $% .-,+*)('&/5432106879:(ba`_^]\[ZYXWVUTSRQPONMLKJIHGFEDCBA@?>=<;chgfedimlkjn zyxwvutsrqpo{~}|      None -./23468F)reflection function0 already checked to be impossible1 error message3<special case for projections/thunk-forcing before inspection4invariant: lowest tags first9Return 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 argumentsQ C D E F G H I J K L M N O P Q R S T ! U" V W#$%&'()*+,-./0123456789 X: Y Z [; \ ] ^ _ ` a b c d e f g h i j k l m n o?Convert single branches to projections (only useful at runtime) p<=> q r s  !"#$%&'()*+,-./0123456789:;<=> 56+/43210$%*)('&"! #,.-;789:<=>4 C D E I H G F J L K M T S R Q P O N! U" V W#$%*)('&+,.-/4321056789 X: Y Z [; \ ] ^ _ ` a b c d e f g h i j k l m n o p<=> q r s None./23468?;Check that a list of universe constraints can be satisfied. tvariables in a constraint u v w x y z { | } ~  ? t?? u v w x y z { | } ~  ? t None ./23468F@vContexts used for global definitions and for proof state. They contain universe constraints and existing definitions.DCMeta information for a data declaration with position of parametersENo meta-informationF'Reasons why a function may not be totalPThe result of totality checkingS productiveTwell-founded argumentsd5A 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 kA HOAS representation of valuesyONormalise fully type checked terms (so, assume all names/let bindings resolved)~Like normalise, but we only reduce functions that are marked as okay to inline (and probably shouldn't reduce lets?) 20130908: now only used to reduce for totality checking. Inlining should be done elsewhere.+Simplify for run-time (i.e. basic inlining)!Reduce a term to head normal form Evaluate in a context of locally named things (i.e. not de Bruijn indexed, such as we might have during construction of a proof)The initial empty context"Get the definitions from a contextSGet the list of pairs of fully-qualified names and their types that match some namenGet the pair of a fully-qualified name and its type, if there is a unique one matching the name used as a key."Get the types that match some name4Get the single type that matches some name precisely=Check whether a resolved name is certainly a data constructor=Check whether any overloading of a name is a data constructor;Create a unique name given context and other existing names@ ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvw xyz{|}~      j@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~l{|yz~}dhgfeYZ[\]^_`abcUXWVPTSRQFONMLKJIHGCED@ABAkwvutsrqponmlijxBS@ ABCEDF ONMLKJIHGPTSRQUXWVYZ[\]^_`abcdhgfeijk wvutsrqponml   xyz{|}~      None./23468 None -./23468F None ./23468F 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       None ./23468F PSmart constructor for unification errors that takes into account the FailContext             None ./23468F "holes still to be solved#used names, don't use again$ name supply%current proof term& original goal'(explicitly given by programmer, leave it*Udot pattern holes + environment either hole or something in env must turn up in the ) list during elaboration.names we'll need to define/%instance arguments (for type classes)0 unsolved auto implicits with their holes1for undo       !"#$%&'()*+,-./012345678 9 :; <=>      ?@   A  B   U      !"#$%&'()*+,-./0123456789:;<=>?@ABU !"#$%&'()*+,-./012345678<=>     B9:;?@AM ,      !"#$%&'()*+,-./012345678 9 :; <=>      ?@   A  B   None ./23468FUModify the auxiliary stateVGet the auxiliary stateW#Set whether to show the unifier logY4Process a tactic within the current elaborator state_Get the global context`rUpdate the context. (should only be used for adding temporary definitions or all sorts of stuff could go wrong)cget the proof termdmodify the proof terme4get the local context at the currently in focus holei\Return recently solved names (that is, the names solved since the last call to get_recents)jget the current goal typel2Get the guess at the current hole, if there is onemTypecheck locallyo-get holes we've deferred for later definitionqget instance argument namesrget auto argument namess4given a desired hole name, return a unique hole nameWTurn the current hole into a pattern variable with the provided name, made unique if MNSet the zipper in the proof state to point at the current sub term (This currently happens automatically, so this will have no effect...)KPrepare to apply a function by creating holes to be filled by the argumentswCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~The operation being appliedWhether arguments are implicitWThe names of the arguments and their holes to be filled with elaborated argument values      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~wEFDCGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~vCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~None -./23468F      !"#$%&'()*+,-./0123456789:;<=>?@A      !"#$%&'()*+,-./0123456789:;<=>?@3654021 /.-,+*)('&%$#"!     789:;<=>?@A?      /.-,+*)('&%$#"!0213654789:;<=>?@ANone -./23468M NBlock-level elements.VRepresentation of Idris's inline documentation. The type paramter represents the type of terms that are associated with code blocks.X>The various kinds of code samples that can be embedded in docs]"Render a term in the documentation^Run 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 docs`5Convert a docstring to be shown by the pretty-printerasConstruct a docstring consisting of the first block-level element of the argument docstring, for use in summaries.bThe empty docstringc"Check whether a docstring is emtpyd$Empty documentation for a definitione%Does a string occur in the docstring?g(Annotate the code samples in a docstring. BCDEFGHIJKLMNOPQRSTU VWXYZ[\]^_ `a     bcdefgHow to annotate code samples&BCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefg&VWNUTSRQPOBMLKJIHGFEDC_`bcdaefgX\[ZY]^ B MLKJIHGFEDCNUTSRQPO VWX\[ZY]^_ `a     bcdefgNone./23468    h  !hh    h  !None ./23468F*ijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ijklmnopqrstuvwxyz{|}~*t~}|{zyxwvupsrqmonlikjikjlmonpsrqt ~}|{zyxwvuNone./23468 " # $ % & ' ( ) *   " # $ % & ' ( ) *None./23468None +-./23468FSyntactic sugar info)Miscellaneous information about functions.possible solutions to a metavariable in a type(a function with a partially defined type"second FC is precise name location"second FC is precise name location2)the bool is whether to search recursivelyG"flag sets whether delay is allowedHHigh level language termsI$%runElab tm - New-style proof scriptJ`{n}K~TermL`(Term [: Term])M)never run implicit converions on the termN/dump a trace of unifications when building termO#Preferences for explicit namespacesP5To mark a coerced argument, so as not to coerce twiceQ6Special case for declaring when an LHS can't typecheckRError to report on elaborationSAs PProof, but no auto solvingT Proof scriptU/A metavariable, ?name, and its precise locationWIdiom bracketsX Do notationY UnderscoreZ Builtin types[)quoteGoal, used for %reflection functions\ Some universe] type^Irrelevant or hidden pattern_'True if only one may work. (| A, B, C|)`@-pattern, valid LHS onlyapA dependent pair (tm : a ** b) and whether it's a sigma type or a pair that inhabits one (solved by elaboration)bOA pair (a, b) and whether it's a product type or a pair (solved by elaboration)c+"rewrite" syntax, with optional result typed.Solve this dictionary by type class resolutione Unit type..?fWA case expression. Args are source location, scrutinee, and a list of pattern/RHS pairsgDConditional expressions - elaborated to an overloading of ifThenElseh$Make an application by type matchingiimplicitly bound applicationjBImplicit argument application (introduced during elaboration only)ke.g. IO (), List Char, length xlTerm with explicit typem2A let binding (second FC is precise name location)nH(n : t1) -> t2, where the FC is for the precise location of the variableo-A lambda abstraction. Second FC is name span.pA pattern variableqA name to be defined laterrA reference to a variables5Inclusion of a core term into the high-level language{Data declaration| Placeholder. for data whose constructors are defined later}Data declaration~The name of the datatype1The precise location of the type constructor nameType constructor ConstructorsIOne 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)A normal top-level definition.For elaborator stateA set of instructions for things that need to happen in IState after a term elaboration when there's been reflected elaboration.The set of source directives\Top-level declarations such as compiler directives, definitions, datatypes and typeclasses.WSource-to-source transformation rule. If bool is True, lhs and rhs must be convertible>Type provider. The first t is the type, the second is the termCompiler directive. Mutual blockSyntax definitionDSL declarationInstance declaration: arguments are documentation, syntax info, source location, constraints, class name, parameters, full instance type, optional explicit name, and definitionsType class: arguments are documentation, syntax info, source location, constraints, class name, class name location, parameters, method declarations, optional constructor nameRecord declarationJNew namespace, where FC is accurate location of the namespace in the file Params blockData declaration.Top level constantPattern clause Postulate3Type declaration (last FC is precise name location)Fixity declarationType provider - what to provide$goal type must be Type, so only term2the first is the goal type, the second is the term6^ attempt to reverse normalise before showing in error=^ an error handler for use with the ErrorReflection extension8Automatically issue "solve" tactic in interactive prover#Automatically adjust terminal width REPL commands0jthe first bool is whether to update, the second is whether to search recursively (i.e. for the arguments)UEach zV should be either a type declaration (at most one) or a clause defining the same name._The monad for the main REPL - reading and processing files and updating global state (hence the IO inner monad). type Idris = WriterT [Either String (IO ())] (State IState a))d6The 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 termsGA list of universe constraints and their corresponding source locations!Currently defined infix operators.list of lhs/rhs, and a list of missing clausesfmodule documentation is saved in a special MN so the context mechanism can be used for disambiguation#Full application LHS on source lineThe 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, and the Bool is whether :p is allowedThe imported modules'Imported ibc file names, whether public-What was the span of the latest token parsed?Global error handlersSpecific error handlers#How many chars wide is the console?4Function/constructor name, argument position is usedFList of names that were defined in the repl, and can be re-/un-defined)Stack of names currently being elaborated)Symbol table (preserves sharing of names)Functions with ExportListHow wide is the console?+Attempt to determine width, or 80 otherwise%Manually specified - must be positive:Have pretty-printer assume that lines should not be brokenThe output mode in use1Send IDE output for some request ID to the handle(Print user output directly to the handle^ whether to show implicits^ show implicits,automatically apply "solve" tactic in provere.g. Builtins+Prelude/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 compiler4+Get the highest FC in a term, if one existsTThe 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.YColourise 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.[^Pretty-print a high-level closed Idris term with no information about precedence/associativity\8Serialise something to base64 using its Binary instance.4Do the right thing for rendering a term in an IState]MPretty-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 GuessaEPretty-printer helper for names that attaches the correct annotationskShow Idris namem&Show a term with implicits, no colours      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[^ pretty printing options^ the term to pretty-print\]^ pretty printing options9^ the currently-bound names and whether they are implicit.^ names to always show in pi, even if not used^ Fixity declarations^ the term to pretty-print^_`aE^ whether the name should be parenthesised if it is an infix operator^ whether to show namespaces;^ the current bound variables and whether they are implicit^ the name to pprintbcdefghijk:^ the Idris state, for information about names and colours2^ the bound variables and whether they're implicit^ pretty printing options^ whether to colourise^ the term to showl@^ the Idris state, for information about identifiers and colours^ the term to showmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrst     `~}|{zyxwvutsrqponmlkjihgfedcba_\^]Y[ZXWVUTSRQPONMLKJIHGFEDCBA@?>=<;:9876543210/.-,+*)('&%$#"!      ~ !"#$%&'(){}|~~zyx*+,-.twvuHsrqponmlkjihgfedcba`_^]\[ZYXWVUTSRQPONMLKJIEGF/DCBA@?>=<;:9876543210/.-,+*)('&%$#"! }|     {0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXzyxwvYZ[\]^_`abcdefghijklmunopqrst       (DCBA@?>=<;:9876543210/.-,+*)('&%$#"! EGFH+srqponmlkjihgfedcba`_^]\[ZYXWVUTSRQPONMLKJItwvuxyz{ }|~~:     <XWVUTSRQPONMLKJIHGFEDCBA@?>=<;:9876543210/.-,+*)('&%$#"! Y[Z\^]_`)~}|{zyxwvutsrqponmlkjihgfedcbaG      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~None./23468'''None./23468None./23468None./23468&&& None -./23468FNone./23468None./23468 None./23468   !None ./23468F1^ the Int is the column count for pretty-printing&^ Recursive?, line, name, hints, depth9aThe version of the IDE mode command set. Increment this when you change it so clients can adapt.O     !"#$%&'()*+,-./012345 + , - . / 0 1 2 3 4 5 6 7 867 98 :9 ; < = > ? @ A B C D E F G H I0     !"#$%&'()*+,-./0123456789078&(' %$#"!    6.3210/,-)+*954* %$#"!    &(')+*,-.3210/45 + , - . / 0 1 2 3 4 5 6 7 867 98 :9 ; < = > ? @ A B C D E F G H I"None -./23468F_wAdds error handlers for a particular function and argument. If names are ambiguous, all matching handlers are updated.jAdd a class instance function.8Precondition: the instance should have the correct type.WDodgy hack 1: Put integer instances first in the list so they are resolved by default..Dodgy hack 2: put constraint chasers (@@) lastOA version of liftIO that puts errors into the exception type of the Idris monad5Save information about a name that is not yet defined+Tell clients how much was parsed and loadedAdd 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 type classes).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).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.:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghij'whether the name is an Integer instance2whether to include the instance in instance searchthe name of the classthe name of the instanceklmnopqrstuvwxyz{|}~The 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_      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrst:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~:<;:<;=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~#None ./23468FHMM 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 { | } ~   F 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 { | } ~  $None ./23468F$Replace DSL-bound variable in a term%None ./23468F                      &None ./23468F        'None./23468 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    (None ./23468F    )None ./23468F    *None ./23468F 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 anyuse full names#Don't treat metavariables specially                                       +None ./23468F 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. pe_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 3Erasable dynamic argument (found under unification) Explicit dynamic argument !Explicit static argument "Implicit dynamic argument #Implicit static argument $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  %.uThis should: specialise any static argument position, then generalise over any function applications in the result. >Checks if a given argument is a type class constraint argument Checks if the given arguments of a type class 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       ! " # $ % & ' (       ! " # $ % & ' ( $ ( % & '  # " !            # " !  $ % & ' (,None ./23468F >Prefix a name with the Language.Reflection namespace ?Prefix a name with the Language.Reflection.Elab namespace @1Reify tactics from their reflected representation C/Reify terms from their reflected representation E3Reify raw terms from their reflected representation S7Create a reflected call to a named function/constructor T:Lift a term into its Language.Reflection.TT representation U;Lift a term into its Language.Reflection.Raw representation WConvert 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 intact `Elaborate 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 _. fBReflect the environment of a proof into a List (TTName, Binder TT) g<Reflect an error into the internal datatype of Idris -- TODO oReflect a file context rAttempt to reify a report part from TT to the internal representation. Not in Idris or ElabD monads because it should be usable from either. v]Build the reflected datatype definition(s) that correspond(s) to a provided unqualified nameO ) * + , - . / 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 wO ) * + , - . / 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 wU 7 : 9 8 ; < ; < ; < 5 6 0 2 1 3 4 3 4 . / = + - , ) * > ? @ 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 wA ) * + - , . / 0 2 1 3 4 3 4 5 6 7 : 9 8 ; < ; < ; < = > ? @ 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-None./23468 x x x x.None./23468 yFind 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. zFind 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. y z y z y z y z/None./23468 {Find 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 apropos |bFind modules whose names or docstrings contain all the space-delimited components of some string. { |  { | { |  { | 0None -./23468FU 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 } ~  } ~  } ~  } ~   1None./23468   2None./23468    3None ./23468F8        2        4None./23468 AWrite a pretty-printed term to the console with semantic coloring UPretty-print a collection of overloadings to REPL or IDEMode - corresponds to :t name @Write pretty-printed output to IDEMode with semantic annotations (Show an error with semantic highlighting 7Warn about totality problems without failing to compile    5None +./23468 GIssue a warning on "with"-terms whose namespace is empty or nonexistent 6None ./23468:FM    7None ./23468F PGet the list of (index, name) of inaccessible arguments from an elaborated type FGet the list of (index, name) of inaccessible arguments from the type. Check 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!) XReturn whether inferred term is different from given term (as above, but return a Bool) Check 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. Treat 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.    8None./23468 *Get the index file name for a package name     9None./23468 +Run the action corresponding to a directive    :None -./23468F 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.       ;None ./23468F      <None ./23468F !"#$%&'()*+,-. /01 2   !"#$%&'()*+-,. /01 2=None ./23468F 3456789:;<  3456789:;<>None ./23468F Given a mainF term to compiler, return the IRs which can be used to generate code.=>?@ ABCDEFGHIJKL  =>?@ ABCDEFGHIJKL?None ./23468F Generate a pattern from an  impossible LHS.nWe need this to eliminate the pattern clauses which have been provided explicitly from new clause generation. 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. 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                                     @None  ./23468FT Function part of application can'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 %Returns 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) (BUse the local elab context to work out the highlighting for a name )Find the names of instances that have been designeated for searching (i.e. non-named instances or instances from Elab scripts) /-Resolve type classes. This will only pick up normal9 instances, never named instances (which is enforced by  )). 8RDo the left-over work after creating declarations in reflected elaborator scripts-                   ! " # $ % & ' ( ) * + , - . /using default Intallow metavariables in the goaldepth"top level goal, for error messages)top level function name, to prevent loops 0 1 2 3 4 5 6 7 8-                   ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8-             ! "       # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8                    ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8ANone ./23468F 9 : ; < 9 : ; < : 9 ; < 9 : ; <BNone ./23468F >IElaborate a top-level type declaration - for example, "foo : Int -> Int". = > The precise location of the name ? @ A = > ? @ A = > ? @ A = > ? @ ACNone ./23468F B B B BDNone ./23468F C\Elaborate a collection of left-hand and right-hand pairs - that is, a top-level definition. DFind staticY applications in a term and partially evaluate them. Return any new transformation rules E2Checks if the clause is a possible left hand side. C D E F G H C D E F G H C D E F G H C D E F G HENone ./23468FM INO I IM INOFNone ./23468FPQRS J determining params  class body  instance ctor name and location instance ctor docs TUV J JPSRQ JTUVGNone ./23468F KW K K KWHNone ./23468F LElaborate a type provider L L L LINone&*./23468BF> MRepresentation of an operation that can compare the current indentation with the last indentation, and an error message if it fails Q+Generalized monadic parsing constraint type U+Idris parser with state used during parsing V5Helper to run Idris inner parser based stateT parsers ZKConsumes 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 line ]Consumes a single-line comment  SingleLineComment_t ::= '--' ~EOL_t* EOL_t ; ^Consumes 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 aParses a string literal bParses a char literal cParses a natural number dParses an integral number eParses a floating point number f5Idris Style for parsing identifiers/reserved keywords iParses a character as a token jParses string as a token kParses a reserved identifier loParses a reserved identifier, computing its span. Assumes that reserved identifiers never contain line breaks. mParses a reserved operator oParses an identifier as a token p6Parses an identifier with possible namespace as a name q1Parses an string possibly prefixed by a namespace r Parses a name sList of all initial segments in ascending order of a list. Every such initial segment ends right before an element satisfying the given condition. t Create a /D from a pair of strings representing a base name and its namespace. yParses an operator zParses an operator {SGet filename from position (returns "(interactive)" when no source file is given) |Get line number from position } Get column number from position ~Get file position as FC Bind constraints to term Push indentation to stack Pops indentation from stack Gets current indentation Gets last indentation &Applies parser in an indented position FApplies parser to get a block (which has possibly indented statements) bApplies parser to get a block with at least one statement (which has possibly indented statements) LApplies parser to get a block with exactly one (possibly indented) statement 9Checks if the following character matches provided parser Parses a start of block Parses an end of block Parses a terminator Parses and keeps a terminator -Checks if application expression does not end "Checks that it is not end of block ?Allows comparison of indent, and fails if property doesn't hold Greater-than indent property (Greater-than or equal to indent property Equal indent property Less-than indent property %Less-than or equal to indent property 3Checks that there are no braces that are not closed 7Parses an accessibilty modifier (e.g. public, private) &Adds accessibility option for function HAdd accessbility option for data declarations (works for classes too - abstract2 means the data/class is visible but members not) 'Error message with possible fixes list Collect  with the same function nameP 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 { | } ~  N 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 { | } ~  P U R S T Q O P 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 { | } ~  M N 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 { | } ~  JNone ./23468F(X4A map from namespace names to information about themY2All information to be documented about a namespaceZ7Docstrings 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 message_IdrisDoc version`RConverts a Name into a [Text] corresponding to the namespace part of a NS Name.a&Retrieves the namespace part of a Nameb(String to replace for the root namespacec Converts a NsName to string formd.Fetch info about namespaces and their contentsefRemoves loose class methods and data constructors, leaving them documented only under their parent.f9Whether a Name names something which should be documentedgWhether a NsItem should be included in the documentation. It must not be Hidden and filterName must return True for the name. Also it must have Docs -- without Docs, nothing can be done.h~Finds all namespaces indirectly referred by a set of namespaces. The NsItems of the namespaces are searched for references.i1Gets all namespaces directly referred by a NsItemjGReturns an NsDict of containing all known namespaces and their contentsk!Gets the Accessibility for a Namel/Simple predicate for whether an NsItem has DocsmPredicate saying whether a Name possibly may have docs defined Without this, getDocs from Idris.Docs may fail a pattern match.nRetrieves the Docs for a NameoExtracts 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 casesp"Shorter name for extractPTermNamesq%Helper function for extractPTermNamesr%Helper function for extractPTermNamess%Helper function for extractPTermNamestGenerates 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.u(Over)writes the  'index.html'Z file in the given directory with an (updated) index of namespaces in the documentationvdGenerates a HTML file for a namespace and its contents. The location for e.g. Prelude.Algebra is  basePrelude Algebra.htmlwEGenerates a relative filepath for a namespace, appending an extensionxmGenerates a HTML type signature with proper tags TODO: Turn docstrings into title attributes more robustlyy,Generates HTML documentation for a function.zbGenerates HTML documentation for any Docs type TODO: Generate actual signatures for typeclasses{7Generates everything but the actual content of the page|Non-break space character}GReturns a list of namespaces already documented in a IdrisDoc directory~?Copies IdrisDoc dependencies such as stylesheets to a directory+XYZ[\] <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 convertaName to retrieve namespace forbcNsName to convertdIState to fetch info from$List of namespaces to fetch info for9Mapping from namespace name to info about its contentseList to remove orphans fromOrphan-free listf Name to checkPredicate resultgAccessibility to checkPredicate resulth)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 onei7The name to get all directly referred namespaces forjk+IState containing accessibility informationThe Name to retrieve access forlThe NsItem to test The resultmThe Name to test The resultn!IState to extract infomation fromName to load Docs foroWhere to extract names fromExtracted namespWhere to extract names fromExtracted namesqrst&Needed to determine the types of names$All info from which to generate docs=The base directory to which documentation will be written.u1Set of namespace names to include in the index=The base directory to which documentation will be written.v&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.w Namespace to generate a path forExtension suffixx&Needed to determine the types of names%Type to generate type declaration forResulting HTMLy&Needed to determine the types of namesFunction to generate block forResulting HTMLz&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  (XYZ[\] ^_`abcdefghijklmnopqrstuvwxyz{|}~KNone &./23468BF Creates table for fixity declarations to build expression parser using pre-build and user-defined operator/fixity declarations (Calculates table for fixity declarations Binary operator Prefix operator Backtick operator )Operator without fixity (throws an error) ZParses an operator in function position i.e. enclosed by `()', with an optional namespace  OperatorFront ::= '(' '=' ')' | (Identifier_t )? '(' Operator_t ')' ; 2Parses a function (either normal name or operator) # FnName ::= Name | OperatorFront; Parses a fixity declaration ? Fixity ::= FixityType Natural_t OperatorList Terminator ; FParses a fixity declaration type (i.e. infix or prefix, associtavity)  FixityType ::= 'infixl' | 'infixr' | 'infix' |   ; LNone &./23468BF9 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 |  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  Allow implicit type declarations #Disallow implicit type declarations  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 | %  'instance' | Refl} ('{' Expr '}')? | ProofExpr | TacticsExpr | FnName | Idiom | List | Alt | Bracketed | Constant | Type | Void. | Quasiquote | NameQuote | Unquote | '_' ; @ Parses an expression in braces  Bracketed ::= '(' Bracketed' +Parses the rest of an expression in braces = Bracketed' ::= ')' | Expr ')' | ExprList ')' | Expr ? Expr ')' | Operator Expr ')' | Expr Operator ')' | Name : Expr  Expr ')' ; (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 ::=  SimpleExpr | SimpleExpr ; 3Parses a unification log expression UnifyLog ::= %   SimpleExpr ; 7Parses a new-style tactics expression RunTactics ::= %   SimpleExpr ; 1Parses a disambiguation expression Disamb ::= %   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)? '}' ; HParses a constraint argument (for selecting a named type class instance) . 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 '}' (Parses a record field setter expression  RecordType ::= record '{' FieldTypeList '}';  C FieldTypeList ::= FieldType | FieldType ',' FieldTypeList ;   FieldType ::= FnName '=' Expr ; 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 ; !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 ::= ? 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 | 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) ,VerbatimString_t ::= '"""' ~'"""' '"""' ; Parses a static modifier Static ::= '[' static ']' ; ;A list of available tactics and their argument requirements Parses a tactic as a wholeM M M G   MNone  ./23468F 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 ParametersParameter Docs Fields Constructor Name Constructor Doc Constructor SyntaxInfoRecord type name ParametersFieldsConstructor Name Target type 'Name of the argument in the constructorProjection NameProjection PlicityProjection TypeProjection DocumentationProjection SyntaxInfoProjection target type Data constructor tame $Placeholder Arguments to constructor All Field Names Argument Index 'Name of the argument in the constructor Field Name Field Plicity Field TypeField DocumentationField SyntaxInfoProjection Source Type Data Constructor Name Arguments to constructor  All fields Argument Index Optional  NNone -./23468F 'Return the elaborated term which calls main Elaborate primitives    ONone &./23468BF 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' | ; LParses if a data should not have a default eliminator DefaultEliminator ::= noelim? $Parses a data type declaration Data ::= DocComment? Accessibility? DataI DefaultEliminator FnName TypeSig ExplicitTypeDataRest? | DocComment? Accessibility? DataI DefaultEliminator 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;                        PNone./23468 *Load an entire package from its index file 0True = reexport, False = make everything private   Reexporting Reexporting?      !"#$%&'(      j.         !"#$%&'(QNone &./23468BF2 Parses 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 | Class | Instance | DSL | Directive | Provider | Transform | Import! ; 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 ; -Parses function options given initial options  FnOpts ::= total | partial | covering |  | %  no_implicit | %  assert_total | %  error_handler | %  reflection | % } '[' 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 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 instances)  InstanceBlock ::= 'where' OpenBlock FnDecl* CloseBlock &7Parses a methods and instances block (for type classes) 2MethodOrInstance ::= FnDecl | Instance ; ClassBlock ::= 'where'9 OpenBlock Constructor? MethodOrInstance* CloseBlock ; 'Parses a type class declaration (ClassArgument ::= Name | '(' Name : Expr ')' ; )Class ::= DocComment_t? Accessibility? 'class'5 ConstraintList? Name ClassArgument* ClassBlock? ; ((Parses a type class instance declaration ! Instance ::= DocComment_t?  'instance'E InstanceName? ConstraintList? Name SimpleExpr* InstanceBlock? ; InstanceName ::= '[' 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 '}'; 0Parses 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; 1Parses with pattern  WExpr ::= '|' Expr'; 2Parses a where block WhereBlock ::= 'where' OpenBlock Decl+ CloseBlock; 3-Parses a code generation target language name  Codegen ::= C | Java |  JavaScript | Node | LLVM | ] ; 4Parses 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 | access& Accessibility |  'default' Totality | logging Natural | dynamic" StringList |  r( Name NameList | error_handlers Name NameList | language  | language  ; 6Parses a totality  Totality ::= partial | total 7Parses a type provider Provider ::= DocComment_t? % provide' Provider_What? '(' FnName TypeSig ')' with Expr; ProviderWhat ::= proof | term | 'type' |   8Parses a transform Transform ::= %  8 Expr ==> Expr 9 Parses an expression from input :Parses a constant form input ;Parses a tactic from input <Parse module header and imports =-There should be a better way of doing this... >CCheck if the coloring matches the options and corrects if necessary ?UA program is a list of declarations, possibly with associated documentation strings. @<Load idris module and show error if something wrong happens ALoad idris module BLoad idris code from file CALoad idris source code and show error if something wrong happens DLoad Idris source code EAdds names to hide list ;                   ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E 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;                   ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E4                    ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D ERNone ./23468F)*+,-./0123456789:;< F line numbervariable name of file G H I J(line number that the type is declared on Function nameSource file name K%line number that the type is declared Function nameSource file name L M F G H I J K L M F G J K L M H I)*+,-./0123456789:;< F G H I J K L MSNone ./23468F N O P Q R S=>? T N O P Q R S T N O P Q R S T N O P Q R S=>? TTNone./23468+@ U V WABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefg U V W U V W+@ U V WABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefgUNone./23468hmConvert a name into a string usable for completion. Filters out names that users probably don't want to see.i>Get the user-visible names from the current interpreter state.j4Get the completion function for a particular command X.Complete REPL commands and defined identifiers Y$Complete tactics and their argumentsklmhinopqrstuvwxj Xyz Y&The names of current local assumptions X Y X Yklmhinopqrstuvwxj Xyz YVNone./23468 Z [ \ ] ^ _{ `|} a Z [ \ ] ^ _ ` a a ` Z [ \ ] ^ _ Z [ \ ] ^ _{ `|} aWNone ./23468M~;The state corresponding to an attempted match of two types.#names which have yet to be resolvedOarguments and typeclass constraints for each type which have yet to be resolvedthe score so farall names that have been usedA list of typeclass 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 predicate cOur 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. d 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.4~ b cfilter to remove some arguments d b c d b c d$~ b c dXNone ./23468F e f g h i j k l m n e f g h i j k l m n e f g h i j k l m n e f g h i j k l m nYNone -./23468F o Run the REPL pRun the REPL server r(Run a command on the server on localhost tRun the IdeMode vRun IDEMode commands w7Show a term for IDEMode with the specified implicitness z8The prompt consists of the currently loaded modules, or Idris if there are none {-Determine whether a file uses literate syntax YInvoke as if from command line. It is an error if there are unresolved totality problems. 2Get the platform-specific, user-specific Idris dir 9Locate the platform-specific location for the init script Run the initialisation script sReturns None if given an Opt which is not PkgMkDoc Otherwise returns Just x, where x is the contents of PkgMkDocA oThe initial stateThe loaded modulesThe file to edit (with :e) p q r s t u v^ The handle for communication$^ The continuation ID for the client^ The original IState^ The current open file^ The currently loaded modules^ The command to process w x y z { | } ~  Opt to extractResult the option to extractthe package file to test A o p q r s t u v w x y z { | } ~  A o p q r s t u v w x y z { | } ~  A o p q r s t u v w x y z { | } ~  ZNone ./23468 cNone ./23468 [None ./23468 +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 Clean Package build files Generate 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/1572 CBuild a package with a sythesized main function that runs the tests Install package #Invoke a Makefile's default target. !Invoke a Makefile's clean target.  Show Warningsquit on failurePath to ipkg file. Path to ipkg file. Path to .ipkg file.    defghijklmnopqrstuvwxyz{|}~jtu```      !"#$%&'()*+,-./0123456789:;<<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwx y z { | } ~                                                                                                                                                                      ! " # $ % & ' ( ) *+,-.K/0123456789:;<==>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrsJtuvwxyz{|}~8      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghhijklmnopqrstuvwxyz{|}~n  W   ?  !"#$%&'()*+,-./.0123456789:;<=>>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnnopqrsI0JsituveowxyzrWXY{Z|T}_~       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~a      ! " # $ % & ' ( ) * + , - . / 0 1!2!3!4!5!U!6!7!8!9!:!Y!Z!;!c!<![!=!>!e!t!?!g!@!A!B!C!D!E!F!G!H!!4!3!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, 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 0 0 0 0 0 0 0 0 0 0 0 0 1 1 2 3 3 3 3 3 4 4 4 4 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 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 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 9 9 : : : : ; ; ; < < = = > > ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? !@ "@ "@ #@ $@ %@ &@ '@ (@ )@ )@ *@ +@ ,@ -@ .@ /@ 0@ 1@ 2@ 3@ 4@ 5@ 6@ 7@ 8@ 9@ :@ ;@ <@ =@ >@ ?@ @@ A@ B@ C@ D@ E@ F@ G@ H@ I@ J@ K@ LA MA NA OA PB QB RB SB TB UC VD WD XD YD ZD [D \E ]F ^G _H `I aI aI bI cI dI eI eI fI gI hI iI jI kI lI mI nI oI pI qI rI sI tI uI vI wI xI yI zI {I |I }I ~I I I I I I I I I I I I I I I I I IbI I I II I I I I I I I I I I I I I I I I I I I I I I I I I J K K K K K K K K K K L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L LLL L L LL L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L M N N N N N N O O O O O O O O O O O P P P P Q Q Q Q Q Q Q Q Q Q Q !Q "Q #Q $Q %Q &Q 'Q (Q )Q *Q +Q ,Q -Q8Q .Q;Q /Q 0Q 1Q 2Q 3Q 4Q 5Q 6Q 7Q 8Q 9Q :Q ;Q <Q =Q >Q ?Q @Q AQ BQ CQ DQ EQ FQ GQ HQ IQ JQ KQ LQ MQ NQ OR PR QR RR SR TR UR VR WS XS YS ZS [S \S ]S ^T _T `T aU bU cV dV eV fV gV hV iV jV kW lW mW nX oX pX qX rX sX tX uX vX wX xY yY zY {Y |Y }Y ~Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Z Z Z Z Z Z Z Z Z [ [ [ [ [ [ [ [ [ [ [ [ [ [ [ [ [ [ \ \ ] ] ^ _ `` ` ` ` ` ` ` ` `         a a a a a a a      y      w v  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  v  w  w x y z {  |  | ^ ^  } ~      c r s                      E                        $                                         (         ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! # # # # # # # # # # # # # # # # # !# "# ## $# %# &# '# (# )# *# +# ,# -# .# /# 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+ h+ k- l- m- n- o- p/[/ q/ r/ s/ t/ u/ v/ w/ x/ y/ z/ {/ |0 }0 ~0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 22 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 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 : : : ; < N< < < < < < < < < < < < < < < < < < = = = = = = = = = = > N> > > > > > > > 4> > >>>>>EEEFF F F F F FGJJJJJJJJJJJJJJJJJJ J!J"J#J$J%J&J'J(J)J*J+J,J-J.J/J0J1J2J3J4J5JJ6J789:;<=>?8@A8BCDEFGHIGHJGHK89LMMMNMOMPMQMRMSMTMUPVPVP PWPXPYPZP[P\P]P^P_P`PaPbPcPdPePfPgPhPiPjPkPlPmPnPoPpPqPrPsPtPuPvPwPxPyPzP{P|P}P~PPPPPPPPPPPPP PPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPRRRRRR RRRRRRRRRRRRRRSSSTTTTTTTTTTTTTT T T T T TTTTTTTTTTTTTTTTTTT T!T"T#U$U U%U&U'U U(U)U*U+U,U-U.U/U0U1U2U3U4V5V6V7W8WvW9WW:W;W<W=W>W?W@WAWBWCWDWEWFWGWHWIGHJGHKWLWMW8W=WAWNWOWPWQWRWSWTWUWVWWWXWYWZW[W\W]W^W_W`WaWbWcWdWecfcfcgchcicjckclc)cmcncocpcqcrcsctc c u idris-0.9.18IRTS.JavaScript.AST IRTS.System Idris.HelpUtil.ScreenSize Idris.Colours Util.SystemUtil.DynamicLinker Idris.Core.TTIdris.Core.CaseTreeIdris.Core.ConstraintsIdris.Core.EvaluateIdris.Core.DeepSeqIdris.Core.TypecheckIdris.Core.ProofTermIdris.Core.UnifyIdris.Core.ProofStateIdris.Core.Elaborate IRTS.LangIdris.Docstrings Idris.UnlitIRTS.DefunctionaliseIRTS.SimplifiedIRTS.CodegenCommonIdris.AbsSyntaxTree Idris.DeepSeqIdris.ASTUtils IRTS.BCImp IRTS.Bytecode IRTS.LangOpts IRTS.DumpBC IRTS.InlinerIdris.Core.Binary Idris.IdeModeIdris.AbsSyntaxIdris.Primitives Idris.DSLIdris.DataOpts Idris.InlinerIdris.Elab.AsPatIdris.TransformsIdris.ErrReverseIdris.DelaborateIdris.PartialEvalIdris.ReflectionIdris.ElabQuasiquoteIdris.REPL.Browse Idris.Apropos Idris.DocsIdris.WhoCalls IRTS.CodegenCIRTS.CodegenJavaScript Idris.Output Idris.ErrorIdris.Core.ExecuteIdris.Elab.Utils Idris.ImportsIdris.DirectivesIdris.ProvidersIdris.ProofSearch Idris.Erasure IRTS.Exports IRTS.CompilerIdris.CoverageIdris.Elab.TermIdris.Elab.ValueIdris.Elab.TypeIdris.Elab.TransformIdris.Elab.ClauseIdris.Elab.DataIdris.Elab.ClassIdris.Elab.InstanceIdris.Elab.ProviderIdris.ParseHelpersIdris.IdrisDocIdris.ParseOpsIdris.ParseExprIdris.Elab.RecordIdris.ElabDeclsIdris.ParseData Idris.IBC Idris.ParserIdris.CaseSplitIdris.InteractiveIdris.REPLParserIdris.Completion Idris.ChaserIdris.TypeSearch Idris.Prover Idris.REPLIdris.CmdOptions Pkg.Package Tools_idrisUtil.Net Version_idris Util.Zlib Paths_idris Util.PrettygetFC Pkg.PParserFFIFFIErrorFFIArgFFICodeJSJSNoop JSAnnotationJSFFIJSWhileJSParens JSTernaryJSCondJSSwitchJSIndexJSAllocJSAssignJSWordJSNumJSStringJSArrayJSFalseJSTrueJSThis JSUndefinedJSNullJSProjJSPostOpJSPreOpJSBinOpJSErrorJSNewJSAppJSReturnJSSeqJSType JSFunctionJSIdentJSRaw JSConstructorJSWord64JSWord32JSWord16JSWord8 JSIntegerJSFloatJSInt JSBigIntExprJSBigIntJSBigOne JSBigZero JSForgotTyJSPtrTyJSCharTy JSFloatTy JSIntegerTy JSStringTyJSIntTyffi compileJS compileJS' jsInstanceOfjsOrjsAndjsMethjsCalljsTypeOfjsEqjsNotEq jsIsNumberjsIsNulljsBigInt jsUnPackBits jsPackUBits8 jsPackUBits16 jsPackUBits32 jsPackSBits8 jsPackSBits16 jsPackSBits32$fShowJSAnnotationversion getDataDirgetDataFileNameCmdArgSeqArgs OptionalArgManyArgsDeclArgConsoleWidthArgSpecialHeaderArgNoArg ColourArg MetaVarArg OptionArg NamespaceArg NumberArgPkgArgs ModuleArgFileArgNameArgExprArg extraHelpgetScreenWidth ColourTypePostulateColour PromptColour DataColour TypeColourFunctionColourImplicitColourBoundVarColour KeywordColour ColourTheme keywordColourboundVarColourimplicitColourfunctionColour typeColour dataColour promptColourpostulateColour IdrisColourcolourvivid underlinebolditalic defaultTheme colourise colouriseKwdcolouriseBoundcolouriseImplicit colouriseFun colouriseType colouriseDatacolourisePromptcolouriseKeywordcolourisePostulatecatchIO isWindowstempfile readSource writeSource withTempdirrmFilesetupBundledCCgetCC getEnvFlagsgetMvn getTargetDir getLibFlagsgetIdrisLibDir getIncFlagsgetExecutablePom ForeignFunFunfun_name fun_handle DynamicLibLiblib_name lib_handle tryLoadLib tryLoadFnWkEnvWkEnvTTWkEnvTypeTermTypeInfoTI con_namescodata data_opts param_pos mutual_typesDataOptsDataOpt DataErrRevDefaultCaseFunDefaultEliminatorCodataDatatypeData d_typename d_typetagd_typed_uniqued_consEnvTTTermSizetermsizeTTUTypeTType ImpossibleErasedProjConstantAppBindVP AppStatusHoles MaybeHolesCompleteNameTypeTConDConnt_tagnt_arity nt_uniqueRefBoundUCs ConstraintFC uconstraintufc UConstraintULEULTUExpUValUVarBinderPVTyPVarGuessGHoleenvlenHoleNLetLet binderValPi binderImpl binderKindLambinderTy ImplicitInfoImpl tcinstanceRaw RConstantRForceRUTypeRTypeRAppRBindVarUniverseAllTypes UniqueTypeNullTypeConstForgotVoidTypeTheWorld WorldTypeStrTypeATypeB64B32B16B8StrChFlBIIArithTyATFloatATIntIntTyITCharITBigITNativeITFixedNativeTyIT64IT32IT16IT8Ctxt SpecialNameMetaN InstanceCtorNElimNCaseNMethodNParentN InstanceNWithNWhereNNameSymRefSNNErasedMNNSUNTCErrorOKErrErr'ElabScriptStuckElabScriptDebugReflectionFailedReflectionError LoadingFailed ProviderErrorElaboratingArg ElaboratingAt NoRewritingProofSearchFailAlreadyDefinedNonCollapsiblePostulate CantMatch InaccessibleProgramLineCommentUniqueKindError UniqueError UniverseError NoEliminatorIncompleteTermCantResolveAlts InvalidTCArg CantResolve NotInjective NoTypeDecl WithFnTypeNoSuchVariable CantIntroduceTooManyArguments NotEqualityNonFunctionType CantInferType UnifyScope CantSolveGoal CantConvert InfiniteUnify CantUnify InternalMsgMsg Provenance SourceTermGivenVal InferredVal TooManyArgs ExpectedTypeErrorReportPart SubReportTermPartNamePartTextPartOutputAnnotation AnnNamespaceAnnErrAnnSearchResultAnnTerm AnnTextFmtAnnFC AnnKeywordAnnTypeAnnDataAnnConst AnnBoundNameAnnNameTextFormatting UnderlineText ItalicTextBoldText NameOutputPostulateOutput MetavarOutput DataOutput FunOutput TypeOutputFC'unwrapFCFCFileFCNoFC _fc_fname _fc_start_fc_endOption CheckConv TTypeInTTypefc_fnamefc_startfc_endspanFCemptyFCfileFCbindTCscoretfailfailMsgtrundiscardshowSeppmap traceWhentxtstrtnulltheadsUNsNSsMN sInstanceNsParentNshowCG emptyContextmapCtxttcname implicitablensrootaddDeflookupCtxtName lookupCtxtlookupCtxtExactdeleteDefExact updateDeftoAlistaddAlist intTyName nativeTyWidth intTyWidth isTypeConst constIsType constDocsfmapMB raw_apply raw_unapply isInjective vinstances instantiatesubstV explicitNamespToVpToV' addBinderpToVsvToPfinalise pEraseTypesubstpsubst substNames substTerm occurrences noOccurrence freeNamesarityunApplymkAppunListforget safeForget forgetEnv safeForgetEnvbindAll bindTyArgs getArgTysgetRetTyuniqueNameFrom uniqueName uniqueNameSet uniqueBindersnextName itBitsNameshowEnv showEnvDbg prettyEnvshowEnv'pureTermweakenTm weakenEnv weakenTmEnv orderPatsrefsInliftPats allTTNamespprintTT bindingOf $fShowConst$fShowTT$fEqTT $fPrettyTTo $fSizedTT$fSizedUniverse $fTermSizeTT $fTermSize[] $fEqNameType $fPrettyNameTypeOutputAnnotation$fSizedNameType$fShowUConstraint$fOrdConstraintFC$fEqConstraintFC $fShowUExp $fSizedUExp $fSizedBinder$fPrettyRawOutputAnnotation $fSizedRaw$fShowUniverse$fPrettyConstOutputAnnotation $fSizedConst$fPrettyArithTyOutputAnnotation $fPrettyNativeTyOutputAnnotation$fShowSpecialName $fShowName$fPretty[]OutputAnnotation$fPrettyNameOutputAnnotation $fSizedName$fShowTC$fPrettyTCOutputAnnotation$fPrettyErr'OutputAnnotation $fShowErr' $fSizedErr'$fSizedErrorReportPart$fAlternativeTC$fApplicativeTC $fMonadPlusTC $fMonadTC$fShowFC $fSizedFC$fEqFC'$fEqFCPhaseRunTime CompileTime ErasureInfoCaseTreeCaseAltCaseAlt' DefaultCaseSucCase ConstCaseFnCaseConCaseSCCaseTypeShared UpdatableSC'ImpossibleCase UnmatchedCaseSTermProjCaseCaseCaseDefsmall namesUsed findCalls findUsedArgs simpleCasesubstSCsubstAltmkForceucheckContext next_tvar definitionsMetaInformationDataMIEmptyMIPReason NotProductiveMutual BelieveMe ExternalIOUseUndef NotPositive NotCoveringItselfOtherTotality UncheckedPartial ProductiveTotal AccessibilityHiddenFrozenPublicCaseInfocase_inlinablecase_alwaysinline tc_dictionaryCaseDefscases_totcheckcases_compiletime cases_inlined cases_runtimeDefCaseOpOperatorTyDeclFunctionQuotequoteValueVTmpVProj VConstant VImpossibleVErasedVUTypeVTypeVAppVBLetVBindVVVPinitEval normaliseC normaliseAll normalisenormaliseTrace specialisesimplify rt_simplifyhnf isUniverseconvEq'convEq initContext mapDefCtxt ctxtAlist addToCtxt setAccesssetTotalsetMetaInformation addCtxtDef addTyDecl addDatatype addCasedefsimplifyCasedef addOperator lookupNames lookupTyNamelookupTyNameExactlookupTy lookupTyExact isConName isTConName isDConName canBeDConNameisFnNameisTCDictlookupP lookupP_alllookupDefExact lookupDef lookupNameDef lookupDefAcclookupDefAccExact lookupTotallookupMetaInformationlookupNameTotal lookupVal lookupTyEnvuniqueNameCtxtuniqueBindersCtxt$fNFDataCaseAlt' $fNFDataSC'$fNFDataCaseDefs$fNFDataCaseInfo $fNFDataDef$fNFDataMetaInformation$fNFDataPReason$fNFDataTotality$fNFDataAccessibility $fNFDataTT $fNFDataConst$fNFDataArithTy $fNFDataIntTy$fNFDataNativeTy$fNFDataNameType $fNFDataUExp$fNFDataBinder$fNFDataImplicitInfo $fNFDataErr'$fNFDataConstraintFC$fNFDataUConstraint$fNFDataProvenance $fNFDataFC $fNFDataRaw$fNFDataUniverse$fNFDataSpecialName $fNFDataName UniqueUseManyLendOnlyOnceNever convertsCconvertsisHoleerrEnvisTyperecheckrecheck_borrowingcheckcheck' checkUniqueGoalGDpremisesgoalType RunTactic' ProofTermrefocus mkProofTerm getProofTermupdateSolvedTermupdateSolvedTerm'updsubst updateSolvedgoalatHolebound_in bound_in_termFails FailContextfail_sourcelocfail_fn fail_paramFailAtUnifyMatch unrecoverable match_unifyunifyTacticQEDUndo ProofState UnifyGoal UnifyProblems MatchProblemsMoveLast SetInjectiveAutoArgInstance DeferTypeDeferFocusPatBindPatVarEquivCaseTac InductionRewrite ExpandLetLetBindForallIntroTyIntroCheckInEvalIn HNF_ComputeSimplify ComputeLetComputeUnifyAllEndUnify StartUnifySolveRegret CompleteFillPrepFill MatchFillFillExactReorderClaimFnClaimAttackPSthnameholesusednsnextnameptermptype dontunifyunified notunifieddottedsolvedproblems injectivedeferred instancesautospreviouscontext datatypesplogunifylogdonerecentswhile_elaboratingnowElaboratingPSdoneElaboratingAppPSdoneElaboratingArgPSnewProof envAtFocus goalAtFocus dropGiven keepGiven getProvenance processTacticElabElab' ElabStateESproof proofFailexplicit saveState loadState getNameFrom setNextNameinitNextNameFromerrAterunrunElabexecElabinitElaborator elaborate updateAuxgetAuxunifyLog getUnifyLogprocessTactic'updatePSnow_elaboratingdone_elaborating_appdone_elaborating_argelaborating_app get_context set_context get_datatypes set_datatypesget_term update_termget_envget_inj get_holes get_probs get_recentsis_guess get_guessget_type get_type_val get_deferredcheckInjective get_instances get_autos unique_hole unique_hole'eloggetLogattackclaimclaimFn unifyGoalexactfill match_fill prep_fill complete_fillsolve start_unify end_unify unify_allregretcompute computeLet hnf_computeeval_incheck_inintrointroTyforallletbind expandLetrewrite inductioncasetacequivpatvarpatbindfocusmovelastdotterm get_dottermzipHere matchProblems unifyProblemsdefer deferType instanceArgautoArgsetinj proofstatereorder_claimsqedundo prepare_applyapply match_applyapply'apply2 apply_elab checkPiGoal simple_apparg no_errorstry handleErrortry'tryCatchtryWhentryAll prunStateTdebugElaboratorqshow dumpprobs LiftStateLSLOptNoInlineInlineLDefsLDecl LConstructorLFunLAltLAlt' LDefaultCase LConstCaseLConCaseFTypeFAny FManagedPtrFPtrFUnitFString FFunctionIO FFunctionFArith FCallType FConstructorFObjectFStaticPrimFnLNoOp LExternalLParLFork LSystemInfo LWriteStrLReadStrLStrRev LStrIndexLStrConsLStrTailLStrHeadLFNegateLFCeilLFFloorLFSqrtLFATanLFACosLFASinLFTanLFCosLFSinLFLogLFExpLBitCastLIntChLChInt LStrFloat LFloatStrLStrIntLIntStr LFloatInt LIntFloatLStrLenLStrEqLStrLt LStrConcatLTruncLZExtLSExtLSGeLSGtLSLeLSLtLGeLGtLLeLLtLEqLASHRLLSHRLSHLLComplLXOrLOrLAndLSRemLURemLSDivLUDivLTimesLMinusLPlus ExportIFaceExport ExportFun ExportDataFDescFAppFIOFUnknownFStrFConLExpLErrorLNothingLOpLForeignLConstLCaseLConLProjLLamLLetLForceLLazyExpLLazyAppLAppLVLVarGlobLoc EndiannessLEBENativeaddTagslnameliftAll lambdaLift getNextNameaddFnlift allocUniqueusedArgusedIn $fShowLExpRawHtmlEntityImageLinkCodeStrongEmph LineBreak SoftBreakSpaceBlockHRule HtmlBlock CodeBlockList BlockquoteHeaderPara Docstring DocStringDocTermFailingExampleChecked renderDocTermcheckDocstringparseDocstringrenderDocstringoverviewemptyDocstring nullDocstringnoDocs containsText renderHtml annotCodeunlit EvalApply ApplyCaseEvalCaseDDefsDDecl DConstructorDFunDAlt DDefaultCase DConstCaseDConCaseDExpDErrorDNothingDOpDForeignDConstDChkCaseDCaseDCDProjDUpdateDLetDAppDVdefunctionalisegetFnaddAppseEVALtoConstoConsA mkApplyCasemkEvalmkApplydeclaregenArgsmkFnCon mkUnderCon mkBigCasegroupsOf dumpDefuns $fShowDExpSDeclSFunSAlt SDefaultCase SConstCaseSConCaseSExpSErrorSNothingSOpSForeignSConstSProjSChkCaseSCaseSConSUpdateSLetSAppSV simplifyDefs CodeGenerator CodegenInfo outputFile outputType targetTriple targetCPUincludes importDirs compileObjs compileLibs compilerFlags debugLevel simpleDecls defunDecls liftDecls interfaces exportDecls OutputType MavenProject ExecutableObjectDbgLevelTRACEDEBUGNONE environment SyntaxInfoSynusing syn_params syn_namespaceno_imp imp_methods decoration inPatternimplicitAllowedmaxline mut_nestingdsl_infosyn_in_quasiquoteUsing UImplicit SyntaxRulessyntaxRulesListSSymbol SimpleExprExprBindingSymbolKeywordSyntaxRule SynContext AnySyntax TermSyntax PatternSyntaxDSLDSL'dsl_bind dsl_return dsl_applydsl_puredsl_var index_first index_next dsl_lambdadsl_letdsl_piOptInfoOptimise inaccessible detaggableFnInfo fn_paramsTIData TISolution TIPartial ClassInfoCIinstanceCtorName class_methodsclass_defaultsclass_default_superclasses class_paramsclass_instancesclass_determinersPArgArgOptInaccessibleArg HideDisplay AlwaysShowPArg' PTacImplicit getScript PConstraintPExpPImppriority machine_infargoptspnamegetTmPDoPDo'DoLetPDoLetDoBindPDoBindDoExpPTacticPTactic'SourceFCAbandonQedTFailSkipTSearchTDocStrTEvalTCheckGoalTypeReflect ByReflection ApplyTacticTSeqTry ProofSearch TCInstanceTrivialLetTacTyLetTac MatchRefineUnfocusDoUnifyRefineIntrosPAltType FirstSuccess ExactlyOnePTermPRunElab PQuoteNamePUnquote PQuasiquote PNoImplicits PUnifyLogPDisambPCoerced PImpossible PElabErrorPTacticsPProofPMetavarPReturnPIdiomPDoBlock Placeholder PConstantPGoal PUniversePTypePHidden PAlternativePAsPDPairPPairPRewrite PResolveTCPTruePCase PIfThenElse PMatchAppPAppBindPAppImplPAppPTypedPLetPPiPLamPPatvar PInferRefPRefPQuotePunInfo TypeOrTermIsTermIsTypePClausePDataPDeclPData' PLaterdecl PDatadecld_name d_name_fcd_tconPClause'PWithRPClauseRPWithElabDEState case_decls delayed_elab new_tyDecls highlightingRDeclInstructions RAddInstanceRClausesInstrs RTyDeclInstrs DirectiveDUsed DLanguageDErrorHandlers DNameHint DDynamicLibsDLoggingDDefaultDAccessDFreezeDHideDIncludeDFlagDLinkDLibPDecl' PTransform PProvider PDirectivePMutualPSyntaxPDSL PInstancePClassPRecord PNamespacePParamsPCAFPClauses PPostulatePTyPFix ProvideWhat ProvideWhat' ProvPostulateProvTermFnOptsFnOptAutoHint Constructor Specialise Reflection ErrorReverse ErrorHandlerCExport NoImplicitImplicit Dictionary AssertTotal Coinductive CoveringFn PartialFnTotalFn InlinablePlicityTacImppscript ConstraintExpImppargoptspstaticpparampscopedStaticDynamicFixDeclFixFixityPrefixNInfixNInfixrInfixlprecOptUseConsoleWidth AutoSolve AutoWidth ShowOrigErrClient RemoveOptAddOptOptLevel TargetCPU TargetTripleEvalExprInterpretScript ExtensionOutputTy UseCodegen DumpCases DumpDefunBCAsmPkgWarnOnlyPkgIndexPkgTestPkgMkDocPkgREPLPkgCheckPkgClean PkgInstallPkgBuild ImportDir IBCSubDirPortVerboseShowImpl ErrContext NoCoverage WarnReach WarnPartialDefaultPartial DefaultTotal TypeInTypeTypeCase InterfaceOutputOLoggingNoREPL NoBuiltins NoPrelude NoBasePkgsShowPkgsShowIncs ShowLibdirShowLibs IdemodeSocketIdemode ColourREPLNoBannerQuietFilename OutputFmt LaTeXOutput HTMLOutputCommand DebugUnify DebugInfo TransformInfoPPrintPrintDefWarrantyMakeDocBrowseCallsWhoWhoCallsAproposSetConsoleWidthListErrorHandlers ColourOffColourOn SetColourNOPUnsetOptSetOpt DoProofSearch MakeLemmaMakeWith AddMissingAddProofClauseFrom AddClauseFrom CaseSplitAtSearchPattelab ListDynamic DynamicLinkMissingDefn TestInlineHNFSpecLogLvl UniversesProofs ShowProofRmProofAddProofProveMetavarsExecValExecuteCompileEdit ModImportChangeDirectoryLoadReloadTotCheckDocStrCoreCheckUndefineNewDefnEvalHelpQuit HowMuchDocs OverviewDocsFullDocsCodegenBytecodeViaIdrisIBCWrite IBCAutoHint IBCExportIBCUsage IBCModDocsIBCParsedRegionIBCTotCheckErr IBCExtern IBCPostulateIBCFunctionErrorHandlerIBCErrorHandler IBCLineApp IBCNameHintIBCDef IBCCoercionIBCDocIBCCG IBCErrRevIBCTrans IBCFnInfoIBCFlagsIBCTotalIBCMetaInformation IBCAccess IBCHeaderIBCDyLib IBCCGFlagIBCLibIBCObj IBCImportDir IBCImport IBCKeyword IBCSyntax IBCMetavarIBCOptIBCDataIBCDSL IBCInstanceIBCClass IBCStaticIBCImpIBCFixCGInfoargsdefcallsscgargsusedusedpos UsageReasonSCGEntry SizeChangeUnknownBiggerSameSmallerIStatett_ctxtidris_constraints idris_infixesidris_implicits idris_statics idris_classes idris_dslsidris_optimisationidris_datatypesidris_namehints idris_patdefs idris_flagsidris_callgraphidris_calledgraphidris_docstringsidris_moduledocsidris_tyinfodata idris_fninfoidris_transformsidris_autohintsidris_totcheckidris_defertotcheckidris_totcheckfail idris_options idris_nameidris_lineappsidris_metavarsidris_coercions idris_errRev syntax_rulessyntax_keywordsimported idris_scprims idris_objs idris_libs idris_cgflags idris_hdrsidris_imported proof_listerrSpanparserWarnings lastParse indent_stack brace_stack lastTokenSpanidris_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_whocallsidris_callswhoidris_repl_defs elab_stack idris_symbols idris_exports ConsoleWidthAutomaticWidthColsWideInfinitelyWide OutputModeIdeMode RawOutput LanguageExtErrorReflection TypeProviders Optimisation PETransformPPOption ppopt_implIOption opt_logLevel opt_typecaseopt_typeintype opt_coverage opt_showimpopt_errContextopt_repl opt_verbose opt_nobanner opt_quiet opt_codegen opt_outputTy opt_ibcsubdiropt_importdirs opt_tripleopt_cpu opt_cmdline opt_origerr opt_autoSolveopt_autoImport opt_optimiseElabInfoEInfoparamsinblockliftname namespaceelabFC rec_elabDeclElabWhatEAllEDefnsETypestoplevel eInfoNames defaultOptsdefaultOptimisedefaultPPOptionverbosePPOptionppOption ppOptionIstprimDefs idrisInit catchError throwError is_scopedimpl forall_impforall_constraintexpl expl_param constrainttacimpl inlinable dictionary initEStatehighlightSourcedeclared tldeclareddefinedupdateNupdateNsmapPTpimppexppconstptacimp highestFC syntaxNames syntaxSymbolsemptySyntaxRulesupdateSyntaxRulesinitDSL defaultSyntaxexpandNSbiinferTyinferCon inferDecl inferOptsinfTerminfP getInferTerm getInferType primNamesunitTyunitConfalseDocfalseTypairTypairConupairTyupairConeqTyeqConeqDoceqDecl eqParamDoceqOpts modDocNamesigmaTysigmaConpiBindpiBindpconsoleDecorateisPostulateName prettyImp prettyIst pprintPTermbasename isHoleName containsHole prettyNameshowCImpshowDImp showDecls showDeclImpgetImpsgetExps getShowArgs getConstsgetAllshowNameshowTm showTmImpls getPArity allNamesIn boundNamesInimplicitNamesInnamesIn usedNamesIngetErasureInfo $fSizedPTerm$fPrettyPTermOutputAnnotation $fShowPData'$fShowPClause' $fShowPDecl' $fShowPTerm $fSizedPArg' $fSizedPDo'$fSizedPTactic' $fOrdFixDecl $fShowFixDecl $fShowFixity $fShowIState$fNFDataSyntaxInfo $fNFDataUsing$fNFDataSSymbol$fNFDataSyntax$fNFDataSynContext $fNFDataDSL'$fNFDataTypeInfo$fNFDataOptInfo$fNFDataClassInfo $fNFDataPArg' $fNFDataPDo'$fNFDataErrorReportPart$fNFDataPTactic'$fNFDataPAltType $fNFDataPTerm$fNFDataPData'$fNFDataPClause'$fNFDataPunInfo$fNFDataProvideWhat'$fNFDataPDecl'$fNFDataDataOpt $fNFDataFnOpt$fNFDataPlicity$fNFDataArgOpt$fNFDataStatic$fNFDataFixDecl$fNFDataFixity$fNFDataCGInfo$fNFDataCodegen$fNFDataFnInfo$fNFDataSizeChange$fNFDataDocTerm$fNFDataNumWrapper$fNFDataCodeAttr$fNFDataListType$fNFDataInline $fNFDataBlock$fNFDataOptions$fNFDataDocstringFieldfgetfsetfmodify fgetState fputState fmodifyState ctxt_lookup maybe_defaultist_optimisationopt_inaccessibleopt_detaggable ist_callgraph cg_usedposopts_idrisCmdline known_terms known_classesrepl_definitionsidris_fixities$fCategory*FieldBCRegLRValtoBCbcERRORNULLOPSTOREOLDBASETOPTOPBASEADDTOPRESERVEREBASESLIDE FOREIGNCALLTAILCALLCALL CONSTCASE PROJECTINTOPROJECTCASEMKCONUPDATE ASSIGNCONSTASSIGNTmpTcleanisConstmoveRegassignconCase constCasecaseAltconstAlt defaultAlt inlineAllnextNdoInlineinterMapindent serializeReg serializeCaseserializeDefault serializeBC serializedumpBCinlineinlevalD $fBinaryTT $fBinaryUExp$fBinaryNameType$fBinaryUniverse$fBinaryBinder$fBinaryImplicitInfo $fBinaryRaw $fBinaryConst$fBinarySpecialName $fBinaryText $fBinaryName $fBinaryFC $fBinaryErr'$fBinaryConstraintFC$fBinaryUConstraint$fBinaryProvenance$fBinaryErrorReportPartIdeModeCommandGetIdrisVersion ErrPPrint ErrStringTermElabTermNoImplicitsTermShowImplicits TermNormaliseBrowseNS MetavariablesGetOptsDocsForLoadFile MakeWithBlockAddProofClause AddClause CaseSplitTypeOf InterpretREPLCompletionsWhatDocsFullOverviewSExpabletoSExp SymbolAtom IntegerAtomBoolAtom StringAtomSexpListgetNChargetLen sexpToCommand parseMessageconvSExp ideModeEpoch EitherErrRightOKLeftErr getContext forCodegengetObjectFiles addObjectFilegetLibsaddLibgetFlagsaddFlagaddDyLibgetAutoImports addAutoImportaddHdr addImported addLangExtaddTrans addErrRevaddErasureUsage addExport addUsedNamegetErasureUsage getExportstotcheckdefer_totcheckclear_totchecksetFlags setFnInfosetAccessibility setTotality getTotalitygetCoercionsToaddToCG addTyInferredaddTyInfConstraints isTyInferredaddFunctionErrorHandlersgetFunctionErrorHandlers getAllNamesallNames addCoercion addDocStr addNameHint getNameHints addToCalledG push_estack pop_estack addInstanceaddClass addAutoHint getAutoHintsaddIBCclearIBC resetNameIdx addNameIdx addNameIdx' getSymbolgetHdrs getImported setErrSpanclearErrgetSOsetSO getIState putIState updateIState withContext withContext_runIOgetNameaddInternalAppgetInternalApp clearOrigPats clearPTypescheckUndefined isUndefined setContext updateContextaddConstraints addDeferredaddDeferredTyCon addDeferred' solveDeferred getUndefined isMetavarNamegetWidthsetWidthtype1Doc isetPromptisetLoadedRegion setLogLevel setCmdLine getCmdLine getDumpDefun getDumpCaseslogLevel setErrContext errContext getOptimise setOptimise addOptimiseremoveOptimise setOptLeveluseREPLsetREPL showOrigErrsetShowOrigErr setAutoSolve setNoBanner getNoBannersetQuietgetQuiet setCodegencodegen setOutputTyoutputTy setIdeModesetTargetTriple setTargetCPUverbose setVerbose typeInType setTypeInTypecoverage setCoverage setIBCSubDir valIBCSubDir addImportDir setImportDirs allImportDirs setColouriseimpShow setImpShow setColourlogLvl cmdOptTypeiLOGnoErrors setTypeCase expandParams expandParamsDmapsnd getPriority addStatics addToUsingaddUsingConstraints addUsingImplsgetUnboundImplicitsimplicit implicit' implicitise addImplPat addImplBoundaddImplBoundInfaddImpladdImpl'aiFn stripLinearstripUnmatchablemkPApp findStaticstoEither matchClause matchClause' substMatchessubstMatchesShadow substMatchsubstMatchShadowshadow mkUniqueNames$fMonadEitherErr$fApplicativeEitherErrPrimp_namep_typep_arityp_defp_lexpp_total primitives debindAppdslifydesugarmkTTName expandSugarvarunIdiomdebind Optimisable applyOptsprelapplyDataOptRT$fOptimisableTT$fOptimisableBinder$fOptimisableBinder0$fOptimisableRaw$fOptimisableEither$fOptimisable[]$fOptimisable(,,)$fOptimisable(,) inlineDef inlineTerm desugarAs transformPatstransformPatsWithapplyTransRulesapplyTransRulesWith errReversebugaddrdelabdelabMVdelabTydelab'delabTy' pprintDelab pprintDelabTy pprintErrannName fancifyAnnotspe_apppe_def pe_clauses pe_simple PEArgTypeUnifiedD ExplicitD ExplicitS ImplicitD ImplicitS partial_evalspecType mkPE_TyDecl mkPE_TermDecl getSpecAppsRFunDefn RDefineFun RFunClauseRMkImpossibleClause RMkFunClause RDatatype RTyConArgRIndex RParameter tcArgNametcArgTyRTyDeclRDeclareRArg RConstraint RImplicit RExplicitargNameargTy rArgToPArgreflmtacNreifyreifyAppreifyReportPartsreifyTT reifyTTAppreifyRaw reifyRawApp reifyTTNamereifyTTNameAppreifyTTNamespacereifyTTNameType reifyTTBinderreifyTTBinderApp reifyTTConstreifyTTConstApp reifyArithTy reifyNativeTy reifyIntTy reifyTTUExpreflCallreflect reflectRawclaimTTreflectTTQuotePatternreflectRawQuotePatternreflectBinderQuotePatternreflectUniversereflectTTQuotereflectRawQuotereflectNameType reflectNamereflectSpecialNamereflectNameQuotePattern reflectBinderreflectBinderQuotemkListreflectConstant reflectUExp reflectEnvrawBoolrawNilrawConsrawList rawPairTyrawPair reflectCtxt reflectErr reflectFC fromTTMaybe reflErrNamereifyReportPart reifyTyDecl reifyFunDefn envTupleTypebuildDatatypesreflectDatatypeextractUnquotesnamespacesInNS namesInNSaproposaproposModulesDocsDocs'ModDocNamedInstanceDocClassDocDataDocFunDocFunDoc'FD pprintDocsgetDocspprintConstDocswhoCallscallsWhocodegenCJSTarget JavaScriptNodecodegenJavaScript codegenNodepshowiWarniRenderconsoleDisplayAnnotatediPrintTermWithTypeiPrintFunTypes iRenderOutput iRenderResultideModeReturnWithStatusideModeReturnAnnotated iRenderErroriPrintWithStatus iPrintResult iPrintError iputStrLnidemodePutSExpiputGoal warnTotalityprintUndefinedNamesprettyDocumentedIstsendHighlightingrenderExternal$fMonadExceptionExceptTiucheckshowErrreport idrisCatch setAndReportifailierrortclifttctry getErrSpan warnDisambexecuterecheckCrecheckC_borrowingiderrcheckDef checkAddDefinaccessibleImpsinaccessibleArgs elabCaseBlock checkInferred inferredDiff checkDocs decorateidpbindspbtygetPBtyspsolvepvarsgetFixedInType getFlexInTypegetParamsInType paramNames getUniqueUsedgetStaticNames getStaticsmkStatic mkStaticTy IFileTypeIBCLIDRIDRpkgIndexsrcPathlsrcPathibcPathibcPathWithFallbackibcPathNoFallback findImport findInPath findPkgIndexinstalledPackagesdoesFileExist'doesDirectoryExist' caseSensitivedirectiveAction disambiguateProvidedProvide providerTy getProvidedtrivial trivialHoles proofSearchperformUsageAnalysis mkFieldName findExports getExpNamescompilegenerate MultiPath GuardednessGuarded UnguardedToplevelmkPatTm genClausesvalidCoverageCaserecoverableCoveragegenAllupdcheckAllCovering checkPositivecalcProd calcTotality checkTotalitycheckDeclTotalitybuildSCGdelazydelazy' buildSCG'checkSizeChange mkMultiPathscheckMP allNothingcollapseNothing noPartialcollapse collapse'ElabCtxte_inarge_isfn e_guardede_intypee_qq e_nomatching ElabResult resultTermresultMetavarsresultCaseDecls resultContext resultTyDeclsresultHighlightingElabModeERHSELHSETyDeclbuildbuildTCgetUnmatchable initElabCtxtgoal_polymorphicelabpruneAlt pruneByType findHighlight findInstances solveAuto solveAutostrivial' trivialHoles' proofSearch' resolveTCresTC'collectDeferredcase_ runTacticalrunTacelaboratingArgErrwithErrorReflectionsolveAllprocessTacticDecls elabValBindelabVal elabDocTermselabExec buildTypeelabType elabType' elabPostulate elabExtern elabTransform elabClauseselabPE checkPossiblepropagateParams findUnique elabClauseelabData elabClass elabInstance elabProviderIndentPropertyHasLastTokenSpangetLastTokenSpanMonadicParsingIdrisInnerParserrunInnerParser IdrisParser runparsernoDocCommentHereclearParserWarningsreportParserWarningssimpleWhiteSpaceisEoleolsingleLineCommentmultiLineComment docComment whiteSpace stringLiteral charLiteralnaturalintegerfloat idrisStylecharstringlcharsymbolreserved reservedFC reservedOp reservedOpFC identifieriName maybeWithNSname initsEndAtmkNameopCharsoperatorLettercommentMarkersinvalidOperatorsoperator operatorFCfileNamelineNum columnNumbindList pushIndent popIndent lastIndentindented indentedBlockindentedBlock1indentedBlockSlookAheadMatches openBlock closeBlock terminatorkeepTerminator notEndApp notEndBlockindentPropHoldsgtPropgtePropeqPropltProplteProp notOpenBraces accessibilityaddAccaccData fixErrorMsgcollect$fHasLastTokenSpanStateT$fTokenParsingStateT generateDocstabletoTablebinaryprefixbackticknofixityoperator operatorFrontfnNamefixity fixityType TacticArg StringLitTArgAltsTArgExprTArgNameTArgSynMatchSynBindSynTmallowImp disallowImpfullExpr tryFullExprexpropExprexpr' externalExprsimpleExternalExpr extensions extension internalExpr impossiblecaseExpr caseOption proofExpr tacticsExpr simpleExpr bracketed bracketed' bracketedExpr modifyConstalt hsimpleExprdisamb noImplicitsapp implicitArg constraintArg quasiquoteunquote namequote recordTypemkTypetypeExprlambda rewriteTermlet_ let_bindingif_ quoteGoal bindsymbol explicitPi autoImplicitdefaultImplicitnormalImplicit implicitPi unboundPipipiOptsconstraintListconstraintList1 typeDeclList tyOptDeclListlistExprdoBlockdo_do_altidiom constantsconstantverbatimStringLiteralstatictacticstactic fullTactic elabRecordrecinfoelabMain elabPrims elabDeclselabDecl elabDecl'recordrecordParameterdataIrecordIdataOptsdata_ constructorsimpleConstructordslcheckDSLoverloadloadIBC loadPkgIndexwriteIBC writePkgIndex ImportInfoimport_reexport import_path import_renameimport_namespaceimport_locationimport_modname_location moduleHeaderimport_progdecldecl' syntaxDecl addSyntax addReplSyntax syntaxRule syntaxSymfnDeclfnDecl'fnOpts postulateusing_mutual instanceBlock classBlockclass_ instance_ docstring usingDeclList usingDeclpatterncafargExprrhsclausewExpr whereBlockcodegen_ directivepLangExttotalityprovider transform parseExpr parseConst parseTactic parseImportsfindFC fixColour parseProg loadModule loadModule' loadFromIFile loadSource' loadSourceaddHides splitOnLine replaceSplitsgetUniqnameRoot getClausegetProofClausemkWith nameMissing caseSplitAt addClauseFromaddProofClauseFrom addMissingmakeWith doProofSearch makeLemmaparseCmdhelpallHelpreplCompletionproverCompletion ModuleTreeMTreemod_pathmod_needsRecheckmod_timemod_depsgetModuleFiles buildTree searchByType searchPreddefaultScoreFunctionprover showProofproverSettingsassumptionNamesproveelabStep dumpStatelifte receiveInputplooprepl startServer processNetCmd runClientinitIdemodeSocket idemodeStartidemoderunIdeModeCommandideModeForceTermImplicits splitNameidemodeProcessmkPromptlit processInput resolveProof removeProofeditproofs insertScriptprocess showTotal showTotalN displayHelp pprintDefhelphead replSettingsidris loadInputs idrisMainrunMain execScriptgetIdrisUserDataDir getInitScript initScriptgetFilegetBC getOutput getIBCSubDir getImportDir getPkgDirgetPkg getPkgClean getPkgREPL getPkgCheck getPkgMkDoc getPkgTest getCodegengetConsoleWidth getExecScript getPkgIndex getEvalExpr getOutputTygetLanguageExt getTriplegetCPU getOptLevelgetOptimisation getColour getClientgetPortoptver defaultPortbannerwarranty runArgParser pureArgParserparser parseFlags parseVersion preProcOpts parseCodegenparseConsoleWidth integerReaderbuildPkgcheckPkgreplPkgcleanPkg documentPkgtestPkg installPkg buildModstestLibrmIBCrmIdx toIBCFile installIBC installIdx installObjmkDirCmdmakehasBundledToolchaingetToolchainDirlistenOnLocalhostlistenOnLocalhostAnyPortgitHashdecompressEitherbindirlibdirdatadir libexecdir sysconfdir getBinDir getLibDir getLibexecDir getSysconfDir $fShowCmdArgcolouriseWithSTXmkColourthrowIO mvnCommandextraLibgmpLib extraIncludePrettyprettySizedsize nestingSize $fSized[] $fSized(,)annotated-wl-pprint-0.6.0!Text.PrettyPrint.Annotated.LeijenhPutDocputDocdisplayDecorated displaySpans displayIOdisplaySdisplay renderCompact renderPretty noAnnotateannotategroupnestingcolumnnest linebreaklinetextemptyalignhangwidth fillBreakrationaldoubleintboolpipeequals backslashdotspacecommacolonsemidquotesquoterbracketlbracketrbracelbraceranglelanglerparenlparenenclosebracketsanglesparensbracesdquotessquotes softbreaksoftline<$$><$><+><>vcathcatfillCatcatvsephsepfillSepsep punctuate encloseSep semiBracestupledlistDocSpanListSEmptySCharSTextSLine SAnnotStart SAnnotStop SimpleDocGroupConGroupConTypeCConstCSucCFnCName PartitionVarsConsPatPTyPatPAny PReflectedPSucPVPConstPCon CaseBuilderCSClause directUsefindAllUsedArgsisUsedrunCaseBuildercheckSameTypes isConstTypetoPatstoPatisVarPatisConPat partitionordermatchmixtureconRule caseGroups argsToAltgetVar groupConsvarRuledepattprune stripLambdas$fTermSizeCaseAlt' $fTermSizeSC' $fShowSC'varsInQueue SolverStatequeue domainStorecons_lhscons_rhsDomainordNubeval MkContextEvalOptRunTTAtREPL EvalStatelimitednextholeblocking finalEntrybindEnv unbindEnvusablefnCountsetBlockdeduct reinstatewknVisUsableUniversespecvevaltfst$fShowTotality $fShowDef $fQuoteValue $fEqValue $fShow(->) $fShowValue BinderPathTermPath replaceTop rebuildTerm rebuildBinderfindHolehole updateEnvupdateSolvedPathPTpath subterm_envsubtermupdatesGuessVGuessTLetVLetTInScopeInBindAppRAppLToprefocus'same cantUnifyUResultUFailUPartOKUOKUInfoUIInjs renameBindersrenameBindersTm trimSolutions expandLetshasvboundVshighVenvPos recoverableholeInpatIn RunTacticTStateholeName match_unify'mergeSolutionsunify' dropUntilactionqueryaddLogmkPtmap solve_unified updateProv updateError updateRessolveInProblemsmergeNotunifiedupdateNotunifiedupdateProblems"$fPrettyProofStateOutputAnnotation$fShowProofStateInlinesBlocksoptions renderBlocks renderBlock renderList renderInlines renderInlineLineTypeCommBlankProgulLinechkAdjhvarldefssVarmkappmkfappsAltlvar scopecheck sExpToString maybePropsconstTy namespaceOf encodeTerm decodeTerm encodeErr decodeErrescapepSExpatomatomC quotedChar parseSExp receiveString getHexLength $fSExpableFC$fSExpableOutputAnnotation$fSExpableNameOutput$fSExpable(,,,,)$fSExpable(,,,)$fSExpable(,,) $fSExpable(,) $fSExpable[]$fSExpableMaybe$fSExpableName $fSExpableInt$fSExpableInteger $fSExpable[]0$fSExpableBool$fSExpableSExptytotalpartial iopartialintOpsintSCmpsintCmpsintArithintConv bitcastPrim concatWord8 concatWord16 concatWord32 truncWord16 truncWord32 truncWord64aTyNameiCmpiBinOpiUnOpiCoercefBinbfBinbcBinbsBinsBinbsrembsdivbashrbUnbitBinbCmpcmpOpsCmpOptoIntintToIntzextsexttruncintToStrgetIntstrToInt intToFloat floatToInt c_intToChar c_charToInt c_negFloat c_floatToStr c_strToFloatp_fPrim p_floatExp p_floatLog p_floatSin p_floatCos p_floatTan p_floatASin p_floatACos p_floatATan p_floatSqrt p_floatFloor p_floatCeilp_strLen p_strHead p_strTail p_strIndex p_strConsp_strRev p_cantreducereplaceUnderscore collectAsapplyAll applyFnRules applyRule matchTerm errorIndent renameMNs pprintTerm pprintTerm' pprintProv pprintErr'addImplicitDiffsisUNannName'annTmshowScshowqual showbasicPEDeclclassConstraint concreteClass mkNewPatsextract1extract2extractTUnquotesextractPArgUnquotesextractDoUnquotes isApropostextIndefType $fApropos[]$fAproposMaybe $fApropos(,)$fAproposDocstring$fAproposConst $fAproposTT$fAproposBinder $fAproposDef $fAproposNamehowMuchshowDocpprintFDdocDatadocClassdocFun getPArgNamesoccursnames occursBinder namesBinderoccursSCnamesSC occursCaseAlt namesCaseAlt occursDefnamesDef findOccurs codegenC'headersdebuggccFlagsgccDbgcnamecregtoDecltoCshowCStrbcctoATypetoFTypec_irtsirts_cbitOp bitCoercesignedTydoOpflUnOpifaceCmkBodyctypecarithcdesccodegenH writeIFace hdr_guard hdr_export CompileInfocompileInfoApplyCasescompileInfoEvalCasescompileInfoNeedsBigIntinitCompileInfo codegenJS_alloptimizeConstructorscollectSplitFunctions splitFunction translateDecl jsFUNPRELUDEjsALLOCMYOLDBASE translateRegtranslateConstant translateChar translateNamejsASSIGN jsASSIGNCONSTjsCALL jsTAILCALL jsFOREIGNjsREBASE jsSTOREOLDjsADDTOP jsTOPBASE jsBASETOPjsNULLjsERRORjsSLIDEjsMKCONjsCASE jsCONSTCASE jsPROJECTjsOP jsRESERVEjsSTACK jsCALLSTACK jsSTACKBASE jsSTACKTOP jsOLDBASE jsMYOLDBASEjsRETjsLOCjsTOPjsPUSHjsPOP translateBCtoFnTypeioretermodprmod cantSolveGoalVarInfoVIviDepsviFunArgviMethodCondDepSetReasonDepsArgResultUseMap minimalUsage forwardChain buildDepMap $fShowArgexpNamestoIFace toIFaceTyVal toIFaceValtoFDesc toFDescRet toFDescBase toFDescArgs toFDescPrimdeNSirMainmkDecls showCaseTreesisCondeclArgsmkLDeclirTerm doForeignirTreeirSCirAltEliminatorStateelabCon elabCaseFunMArgTyCAEAIA memberDocs expandMethNSfindDetscheckInjectiveArgsNsDictNsInfo FullDocstringNsItemNsNameFailableerrtoNsNamegetNs rootNsStr nsName2Str fetchInfo removeOrphans filterName filterIncludetraceNss referredNssnsDict getAccesshasDoc mayHaveDocsloadDocsextractPTermNamesextract extractPArg extractPDoextractPTactic createDocs createIndex createNsDoc genRelNsPath genTypeHeader createFunDoccreateOtherDocwrappernbspexistingNamespacescopyDependencies nsDocstring nsContentsbaseGHC.Base.parsers-0.12.2.1Text.Parser.Combinators mtl-2.2.1Control.Monad.State.Classstate GHC.Float** Data.List\\ integer-gmpGHC.Integer.TypeIntegerghc-prim GHC.TypesIntCharDoubleStringelabProjection elabUpdatein_nameasArgrecName asPRefArgelabRecordFunctionsrecRef projectInTypeIBCFile sourcefilesymbols ibc_importsibc_importdirs ibc_implicits ibc_fixes ibc_statics ibc_classes ibc_instancesibc_dsls ibc_datatypes ibc_optimise ibc_syntax ibc_keywordsibc_objsibc_libs ibc_cgflagsibc_dynamic_libsibc_hdrs ibc_access ibc_totalibc_totcheckfail ibc_flags ibc_fninfoibc_cgibc_defsibc_docstringsibc_moduledocsibc_transforms ibc_errRev ibc_coercions ibc_lineapps ibc_namehintsibc_metainformationibc_errorhandlersibc_function_errorhandlers ibc_metavars ibc_patdefsibc_postulates ibc_externsibc_parsedSpan ibc_usage ibc_exports ibc_autohints ibcVersioninitIBC makeEntryentries writeArchivemkIBCibcgetEntrytimestampOlder pPostulatespExterns pParsedSpanpUsagepExports pAutoHints pImportDirspImportspImpspFixespStaticspClasses pInstancespDSLs pDatatypes pOptimisepSyntax pKeywordspObjspLibspCGFlagspDyLibspHdrspPatdefspDefspDocspMDocspAccesspFlagspFnInfopTotal pTotCheckErrpCG pCoercionspTranspErrRev pLineApps pNameHintspMetaInformationpErrorHandlerspFunctionErrorHandlers pMetavars safeToEnum$fBinaryCodegen$fBinarySSymbol $fBinaryDSL'$fBinarySyntax$fBinarySynContext$fBinaryTypeInfo$fBinaryFnInfo$fBinaryOptInfo$fBinaryClassInfo $fBinaryPArg' $fBinaryPDo'$fBinaryPTactic'$fBinaryPAltType $fBinaryPTerm$fBinaryPunInfo$fBinaryPData'$fBinaryPClause'$fBinarySyntaxInfo $fBinaryUsing$fBinaryProvideWhat'$fBinaryPDecl'$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 MergeStateMSnamemapinventedsplit addUpdate inventNamemkSupplyvarliststripNS mergeAllPatsmergePat mergeUserImplargTystidy elabNewPatfindPats replaceVar updateMeta checkProv addBracket CommandTableparserCommandsForHelpparserCommandsnoArgCmd nameArgCmdnamespaceArgCmd exprArgCmd metavarArgCmd optArgCmd proofArgCmdpCmdcmdnoArgsexprArggenArgnameArg fnNameArgstrArg moduleArg namespaceArgoptArgproofArgcmd_doccmd_consolewidth cmd_execute cmd_dynamic cmd_pprint cmd_compile cmd_addproofcmd_logcmd_let cmd_unlet cmd_loadto cmd_colouridChar cmd_apropospackageBasedCmd cmd_searchcmd_proofsearch cmd_refine nameString completeCmdcommands tacticArgsmetavarsmodules completeWith completeName completeExprcompleteMetaVarcompleteOptioncompleteConsoleWidth isWhitespace lookupInHelpcompleteColour completePkgcompleteTacticlatestextractFileName getIModTimeStateargsAndClasses usedNamesClassesArgsDAGScore transposition equalityFlipsasymModsSidedAsymMods searchUsing reverseDag computeDagPusedVars deleteFromDagbothscoreCriterionTrueFalsesubsetsmatchTypesBulkleftrightModsargApp typeClassApptypeClassIntro typeFromDefunLazydeleteFromArgListsided displayScore modifyTypesfindNameInArgsDAGfindName deleteName tcToMaybeinArgTystypeclassUnifyisTypeClassArgflipEqualities $fMonoidScore$fMonoidAsymMods $fMonoidSided $fOrdScorePkgDescpkgnamelibdepsobjsmakefile idris_opts sourcedir idris_mainexecout idris_testsPParser defaultPkg parseDescpPkgpClause