Z-4      !"#$%&'()*+,-./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-{.|.}.~.........................................................................................//////////////////////////////00001111112333344555 6 7 8 9 :;<===>>?@AAAAAABBB B!B"B#C$D%E&F'G(G)G*G+G,G-G.G/G0G1G2G3GM Safe-InferredState for the parser monad*The most recently marked indentation levelNone+23468BgThe type checking monad, which provides the state of the type checker, and error reporting capabilities3A class for errors which support unification errors State required for type checking #The next fresh unification variable The current substitution MA substitution maintains a mapping from unification variables to their values*Identifies types which support unification.A type which can contain unification variablesUntyped unification variables An empty  UnifyStateRun a computation in the Unify monad, failing with an error, or succeeding with a return value and the new next unification variable(Substitute a single unification variableSReplace a unification variable with the specified value in the current substitution[Perform the occurs check, to make sure a unification variable does not occur inside a value-Generate a fresh untyped unification variable8Generate a fresh unification variable at a specific type          Safe-Inferred+-!UData type for literal values. Parameterised so it can be used for Exprs and Binders."An object literal#An array literal$A boolean literal%A string literal&A numeric literal!"#$%&!"#$%&!&%$#"!&%$#" Safe-Inferred'()*+,-'()*+,-'()*+,-'()*+,- Safe-Inferred+M0 Source name1Start of the span3Source position information5 Line number6 Column number ./012345678 ./0123456 34568./0127./012345678 Safe-Inferred+9Fixity data for infix operators;!Associativity for infix operators?(A precedence level for an infix operator9:;<=>?@9:;<=>??;>=<@9:9:;>=<?@H Safe-Inferred 456789:;<=>?@5;<=>?@ 456789:;<=>?@ Safe-InferredEABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~EABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~EABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~EABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~NoneB None6  Safe-Inferred!"(* !The data type of compiler options)Disable inclusion of the built in PreludeDisable tail-call elimination>Disable inlining of calls to return and bind for the Eff monad#When specified, checks the type of mainN in the module, and generate a call to run main after the module definitions.Skip all optimizationsVerbose error message)Remove the comments from the generated js_Specify the namespace that PureScript modules will be exported to when running in the browser.Per-mode optionsVIndicates the mode of the compiler. Lifted using DataKinds to refine the Options type.Default compiler optionsDefault make options   Safe-Inferred+-:A qualified name, i.e. a name with an optional module name Module namesTProper names, i.e. capitalized names for e.g. module names, type//data constructors.Names for value identifiers%A symbolic name for an infix operatorAn alphanumeric identifier7Provide a default module name, if a name is unqualified   Safe-Inferred4Convert an Ident into a valid Javascript identifier:,Alphanumeric characters are kept unmodified.2Reserved javascript identifiers are prefixed with $$.Symbols are prefixed with A2 followed by a symbol name or their ordinal value.;Test if a string is a valid JS identifier without escaping.kAttempts to find a human-readable name for a symbol, if none has been specified returns the ordinal value.<Checks whether an identifier name is reserved in Javascript.7Checks whether a proper name is reserved in Javascript.  Safe-Inferred+-Data type for binders/A binder which binds its input to an identifierPA binder which matches a data constructor (type name, constructor name, binders)"A binder which binds an identifier&A binder which matches a literal valueWildcard binder Safe-Inferred+-"An alternative in a case statement6A collection of binders with which to match the inputs9The result expression or a collect of guarded expressionsSA guard is just a boolean-valued expression that appears alongside a set of bindersA let or module binding.3Mutually recursive binding group for several values(Non-recursive binding for a single value#Data type for expressions and terms A let bindingA case expressionVariableFunction applicationFunction introductionPartial record updateA record property accessor=A data constructor (type name, constructor name, field names)A literal value"Extract the annotation from a termModify the annotation on a term  Safe-Inferred Safe-Inferred+Data constructor metadata7The constructor is for a type with multiple construcors6The constructor is for a type with a single construcorMetadata annotations9The contained value is a typeclass dictionary constructor The contained value is a newtype)The contained value is a data constructorNone+The data type of kindsFunction kinds5Kinds for labelled, unordered rows without duplicatesThe kind of effectsThe kind of types!Unification variable of type KindNone+A typeclass constraintThe type of types%A placeholder used in pretty printing%A placeholder used in pretty printing%A placeholder used in pretty printing%A placeholder used in pretty printingA type with a kind annotationA non-empty row An empty rowA skolem constant+A type with a set of type class constraintsForall quantifier7A type synonym which is "saturated", i.e. fully appliedA type applicationA type constructor:A type wildcard, as would appear in a partial type synonymA named type variable#A unification variable of type Type0An identifier for the scope of a skolem variable4Convert a row to a list of pairs of labels and types+Convert a list of labels and types to a row"Check whether a type is a monotypeUniversally quantify a type?Replace a type variable, taking into account variable shadowing'Replace named type variables with types.Collect all type variables appearing in a type3Collect all free type variables appearing in a type EUniversally quantify over all type variables appearing free in a type 5Move all universal quantifiers to the front of a type "Check if a type contains wildcards%     %     %          None+A simplified representation of expressions which are used to represent type class dictionaries at runtime, which can be compared for equalityA subclass dictionary0A dictionary which depends on other dictionariesCA dictionary which is brought into scope by an instance declaration>A dictionary which is brought into scope by a local constraint#The type of a type class dictionaryXA type class dictionary which is an alias for an imported dictionary from another moduleA regular type class dictionary;Data representing a type class dictionary which is in scopeCThe identifier with which the dictionary can be accessed at runtimeDThe name of the type class to which this type class instance applies3The types to which this type class instance appliesLType class dependencies which must be satisfied to construct this dictionaryThe type of this dictionary (Is this instance exported by its module?!MFind the original dictionary which a type class dictionary in scope refers to ! ! ! !None+*" The type ('data' or  'newtype') of a data type declaration#A newtype constructor$A standard data constructor%The kinds of a type&A scoped type variable'A local type variable( Foreign data) Type synonym* Data type+The kind of a name,OA type class dictionary, generated during desugaring of type class declarations-A data constructor.SA local name introduced using a lambda abstraction, variable introduction or binder/A foreign import0fA type class dictionary member accessor import, generated during desugaring of type class declarations1+A value introduced as a binding in a module2!The visibility of a name in scope3_The name is defined in the another binding group, or has been made visible by a function binder4DThe name is defined in the current binding group, but is not visible5The type of a foreign import6EA foreign import which contains inline Javascript as a string literal7A regular foreign import8The  Environment; defines all values and types which are currently in scope::Value names currently in scope;Type names currently in scope<XData constructors currently in scope, along with their associated data type constructors= Type synonyms currently in scope>!Available type class dictionaries? Type classes@TThe initial environment with no values and only the default javascript types definedA)Construct a ProperName in the Prim moduleB#Construct a type in the Prim moduleCType constructor for functionsDType constructor for stringsEType constructor for numbersFType constructor for booleansGType constructor for arraysHType constructor for objectsI$Smart constructor for function typesJWThe primitive types in the external javascript environment with their associated kinds.KGFinds information about data constructors from the current environment.L3Checks whether a data constructor is for a newtype.,"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLM+"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKL,89:;<=>?@576243+10/.-,%*)('&"$#MABCDEFGHIJKL"$#%*)('&+10/.-,24357689:;<=>?@ABCDEFGHIJKLM Safe-Inferred+NOPNOPNPONPO Safe-Inferred+ QData type for bindersR)A binder with source position informationS/A binder which binds its input to an identifierT;A binder which matches an array and binds its head and tailU6A binder which matches an array and binds its elementsV8A binder which matches a record and binds its propertiesW)A binder which matches a data constructorX"A binder which binds an identifierY(A binder which matches a numeric literalZ'A binder which matches a string literal[(A binder which matches a boolean literal\Wildcard binder]8Collect all names introduced in binders in an expression QRSTUVWXYZ[\] QRSTUVWXYZ[\] Q\[ZYXWVUTSR]Q \[ZYXWVUTSR] Safe-Inferred+8^/Data type for simplified Javascript expressions_Commented Javascript`VRaw Javascript (generated when parsing fails for an inline foreign import declaration)aContinue statementbBreak statementcLabelled statementdInstanceOf testeType-Of operatorfThrow statementgReturn statementhIf-then-else statementi ForIn loopjFor loopk While looplA variable assignmentm3A variable introduction and optional initializationn A block of expressions in bracesoConditional expressionpVariableqFunction applicationr8A function introduction (optional name, arguments, body)s&An object property accessor expressiontAn object literaluAn array indexer expressionvAn array literalwA binary operator applicationxA unary operator applicationyA boolean literalzA string literal{A numeric literal|Built-in binary operators}"Bitwise right shift with zero-fill~Bitwise right shiftBitwise left shift Bitwise xor Bitwise or Bitwise and Boolean or Boolean andNumeric greater-than-or-equalNumeric greater-thanNumeric less-than-or-equalNumeric less-thanGeneric inequality testGeneric equality test RemainderNumeric divisionNumeric multiplicationNumeric subtractionNumeric additionBuilt-in unary operators ConstructorNumeric unary 'plus'Bitwise negationBoolean negationNumeric negation;^_`abcdefghijklmnopqrstuvwxyz{|}~;^_`abcdefghijklmnopqrstuvwxyz{|}~;|~}^{zyxwvutsrqponmlkjihgfedcba`_^{zyxwvutsrqponmlkjihgfedcba`_|~}None+MN"A statement in a do-notation block6A do notation element with source position information0A let statement, i.e. a pure value with a binderA monadic value with a binder A monadic value without a binder"An alternative in a case statement6A collection of binders with which to match the inputs9The result expression or a collect of guarded expressions#Data type for expressions and terms(A value with source position informationeA placeholder for a superclass dictionary to be turned into a TypeClassDictionary during typechecking`A typeclass dictionary accessor, the implementation is left unspecified until CoreFn desugaring.A placeholder for a type class dictionary to be inserted later. At the end of type checking, these placeholders will be replaced with actual expressions representing type classes dictionaries which can be evaluated at runtime. The constructor arguments represent (in order): whether or not to look at superclass implementations when searching for a dictionary, the type class name and instance type, and the type class dictionaries in scope.\An application of a typeclass dictionary constructor. The value should be an ObjectLiteral.A do-notation block A let bindingA value with a type annotationA case expression. During the case expansion phase of desugaring, top-level binders will get desugared into case expressions, hence the need for guards and multiple binders per branch here.A data constructor%Conditional (if-then-else expression)VariableFunction applicationFunction introductionyPartial record updater. This will be removed during desugaring and expanded into a lambda that returns an object update.Partial record update&An record property accessor expression An object property getter (e.g. `_.x`k). This will be removed during desugaring and expanded into a lambda that reads a property from an object.An object constructor (object literal with underscores). This will be removed during desugaring and expanded into a lambda that returns an object literal.An object literalAn array literalOperator section. This will be removed during desugaring and replaced with a partially applied operator or lambda to flip the arguments.jExplicit parentheses. During the rebracketing phase of desugaring, this data constructor will be removed.qBinary operator application. During the rebracketing phase of desugaring, this data constructor will be removed.A prefix -, will be desugaredA boolean literalA string literalA numeric literalSA guard is just a boolean-valued expression that appears alongside a set of bindersThe data type of declarations.A declaration with source position informationbA type instance declaration (name, dependencies, class name, instance types, member declarations)GA type class declaration (name, argument, implies, member declarations)'A module import (module name, qualified unqualified%hiding, optional "qualified as" name)1A fixity declaration (fixity data, operator name)$A type class instance foreign import'A data type foreign import (name, kind)KA foreign import declaration (type, name, optional inline Javascript, type)6A minimal mutually recursive set of value declarationsDA value declaration (name, top-level binders, optional guard, value))A type declaration for a value (name, ty)2A type synonym declaration (name, arguments, type):A minimal mutually recursive set of data type declarationsMA data type declaration (data or newtype, name, arguments, data constructors)8The data type which specifies type of import declarationDAn import with a list of references to hide: `import M hiding (foo)`IAn import with an explicit list of references to import: `import M (foo)`+An import with no explicit list: `import M`0An item in a list of explicit imports or exports8A declaration reference with source position information]A type class instance, created during typeclass desugaring (name, class name, instance types) A type classA value)A type constructor with data constructorsA module declaration, consisting of comments about the module, a module name, a list of declarations, and a list of the declarations that are explicitly exported. If the export list is Nothing, everything is exported.Return a module's name.@Test if a declaration is exported, given a module's export list.VTest if a data constructor for a given type is exported, given a module's export list.7Return the exported data constructors for a given type.,Test if a declaration is a value declaration@Test if a declaration is a data type or type synonym declaration(Test if a declaration is a module import3Test if a declaration is a data type foreign import=Test if a declaration is a type class instance foreign import-Test if a declaration is a fixity declaration)Test if a declaration is a foreign import:Test if a declaration is a type class instance declaration1Test if a declaration is a type class declarationCRecursively flatten data binding groups in the list of declarationsRQRNone Safe-Inferred     Safe-InferredEliminate tail callsBB Safe-InferredCCInline type class dictionaries for >>= and return for the Eff monadE.g.;Prelude[">>="](dict)(m1)(function(x) { return ...; })becomes-function __do { var x = m1(); ... }D!Inline functions in the ST moduleCDCD Safe-Inferred EFG EFG Safe-Inferred Safe-Inferred@Collapse blocks which appear nested directly below another block  Safe-Inferred3 @Apply a series of optimizer passes to simplified Javascript code HI   HI!None  Type alias for basic annotations #Initial annotation with no metadata &Remove the comments from an annotation            "None       # Safe-InferredEJCWe use Text.Parsec.Token to implement the string and number lexemesK/A token parser based on the language definition:1Parse zero or more values separated by semicolons;0Parse one or more values separated by semicolons<-Parse zero or more values separated by commas=,Parse one or more values separated by commasJ)A list of purescript reserved identifiersL+The characters allowed for use in operators\LMNOPQRSTUVWXYZ[\]^_`abcdefghijklJK !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHImJKLn7 !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKL7 !"#$%&'()*+,-./0123456789:;<=>?ACB@DEIFGHJKL=fedcba`_^]\[ZYXWVUTSRQPONMLghijklJK !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHImJKLn$ Safe-Inferred3 NParse a module nameO0Parse a qualified name, i.e. M.name or just nameP-Parse an identifier or parenthesized operatorQnRun the first parser, then match the second if possible, applying the specified function on a successful matchRnRun the first parser, then match the second zero or more times, applying the specified function for each matchSPBuild a parser from a smaller parser and a list of parsers for postfix operatorsT"Mark the current indentation levelU;Check that the current identation level matches a predicateVACheck that the current indentation level is past the current markWWCheck that the current indentation level is at the same indentation as the current markX?Read the comments from the the next token, without consuming itY Run a parser MNOPQRSTUVWXY MNOPQRSTUVWXY MNOPQRSTUVWXY MNOPQRSTUVWXY%NoneZ Parse a kindopqZZZopqZ&None[5Parse a type as it appears in e.g. a data constructor\Parse a monotype]Parse a polytype^&Parse an atomic type with no wildcardsrstuvwxy[z{\]^|}~[\]^\]^[rstuvwxy[z{\]^|}~' Safe-InferredbWrap a string in parenthesesc)Number of characters per identation leveld)Pretty print with a new indentation levele!Get the current indentation levelfPrint many linesg.Prints an object key, escaping reserved names. _`abcdefg _`abcdefg b_`acdefg_`abcdefg(Noneh4Generate a pretty-printed string representing a Kindhhhh)Nonei3Generate a pretty-printed string representing a Rowj\Generate a pretty-printed string representing a Type, as it should appear inside parenthesesk4Generate a pretty-printed string representing a Type ijkijkkji ijk*NoneEGenerate a pretty-printed string representing a Javascript expressionlrGenerate a pretty-printed string representing a collection of Javascript expressions at the same indentation levelPGenerate an indented, pretty-printed string representing a Javascript expressionllllINoneu./01234569:;<=>?QRSTUVWXYZ[\]+None3m)A list of modules with their dependenciesn:Sort a collection of modules based on module dependencies.6Reports an error if the module graph contains a cycle.NCalculate a list of used modules based on explicit imports and qualified namesFConvert a strongly connected component of the module graph to a modulemnmnnmmn,NoneE  Read source position informationpParse a single declarationr6Parse a module header and a collection of declarationssParse a collection of modulestParse a collection of modules/Parse an expression in backticks or an operatoru Parse a valuevParse a binderw<Parse a binder as it would appear in a top level declarationx Parse a guard>opqrstuvwx opqrstuvwx prtsuxvwoq>opqrstuvwxJNoneV !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^opqrstuvwx-Noney;Generate a pretty-printed string representing an expressionz6Generate a pretty-printed string representing a BinderyzyzyzyzKNonehijklyz.None36B {A stack trace for an error~A type of error messages.Get the error code for a particular error type/Create an error set from a single error message?Lift a function on ErrorMessage to a function on MultipleErrors5Pretty print a single error, simplifying if necessaryPretty print multiple errors6Interpret multiple errors in a monad supporting errorsJRethrow an error with a more detailed error message in the case of failure1Rethrow an error with source position informationCollect errors in in parallel\{|}~X{|}~\~{|}{|}~J/None !"2346BHMgThe type checking monad, which provides the state of the type checker, and error reporting capabilities!State required for type checking: The current  Environment(The next fresh unification variable name#The next type class dictionary nameThe current module0Temporarily bind a collection of names to values/Temporarily bind a collection of names to types/Temporarily bind a collection of names to typesBTemporarily make a collection of type class dictionaries available;Get the currently available list of type class dictionaries9Temporarily bind a collection of names to local variables>Temporarily bind a collection of names to local type variables-Update the visibility of all names to Defined*Lookup the type of a value by name in the  Environment0Lookup the visibility of a value by name in the  EnvironmentAssert that a name is visible)Lookup the kind of a type by name in the  EnvironmentGet the current  Environment Update the  Environment Modify the  Environment=Run a computation in the Check monad, starting with an empty  EnvironmentmRun a computation in the Check monad, failing with an error, or succeeding with a return value and the final  Environment.0Make an assertion, failing with an error message'Generate new type class dictionary nameLift a computation in the Check# monad into the substitution monad.bRun a computation in the substitution monad, generating a return value and the final substitution.0None246EInfer the kind of a single typeQInfer the kind of a single type, returning the kinds of any scoped type variablestInfer the kind of a type constructor with a collection of arguments and a collection of associated data constructorsNSimultaneously infer the kinds of several mutually recursive type constructors^Solve the set of kind constraints associated with the data constructors for a type constructor3Default all unknown kinds to the Star kind of typesInfer a kind for a type  1None!"36,Build a type substitution for a type synonym:Replace all instances of a specific type synonym with the SaturatedTypeSynonym data constructor#Replace all type synonyms with the SaturatedTypeSynonym data constructor "Desaturate" SaturatedTypeSynonyms-Replace fully applied type synonyms with the SaturatedTypeSynonymR data constructor, which helps generate better error messages during unification.>Replace a type synonym and its arguments with the aliased type  2None9Generate foreign imports for all declarations in a module3None3SReplace all sets of mutually-recursive declarations in a module with binding groupsBCollapse all binding groups in a module to individual declarations6Collapse all binding groups to individual declarationsoConvert a group of mutually-recursive dependencies into a BindingGroupDeclaration (or simple ValueDeclaration).4None3@Replace all top-level binders in a module with case expressions.4Replace all top-level binders with case expressions.  5None3Add type synonym declarations for type class dictionary types, and value declarations for type class instance dictionary expressions.  6None 4Desugars a module from AST to CoreFn representation.Find module names from qualified references to values. This is used to ensure instances are imported from any module that is referenced by the current module, not just from those that are imported explicitly (#667).?Desugars import declarations from AST to CoreFn representation.@Desugars foreign declarations from AST to CoreFn representation.Desugars export declarations references from AST to CoreFn representation. CoreFn modules only export values, so all data constructors, class constructor, instances and values are flattened into one list.Makes a typeclass dictionary constructor function. The returned expression is a function that accepts the superclass instances and member implementations and returns a record for the instance dictionary. "Converts a ProperName to an Ident.      LNone6!"#$%&     7None Key type to use in graph ZEliminate all declarations which are not a transitive dependency of the entry point module .Extract declaration names for a binding group. ,Extract the ident for a foreign declaration. .Find dependencies for each member in a module.2Find all referenced values within a binding group.&Check whether a binding group is used.*Check whether a named declaration is used.            8None$The state object used in this moduleDA map from names bound (in the input) to their names (in the output)DThe set of names which have been used and are in scope in the outputCRuns renaming starting with a list of idents for the initial scope.bCreates a new renaming scope using the current as a basis. Used to backtrack when leaving an Abs.qAdds a new scope entry for an ident. If the ident is already present, a new unique name is generated and stored.'Finds the new name to use for an ident.(Finds idents introduced by declarations. ,Renames within each declaration in a module.PRenames within a declaration. isTopLevel is used to determine whether the declaration is a module member or appearing within a Let. At the top level declarations are not renamed or added to the scope (they should already have been added), whereas in a Let declarations are renamed if their name shadows another in the current scope.Renames within a value.Renames within literals.!Renames within case alternatives.Renames within binders.      9None !"3M iGenerate code in the simplified Javascript intermediate representation for all declarations in a module. B^_`abcdefghijklmnopqrstuvwxyz{|}~   MNoneC^_`abcdefghijklmnopqrstuvwxyz{|}~ :None3M  Replace all DoNotationBind and DoNotationValueH constructors with applications of the Prelude.(>>=) function, and all  DoNotationLet# constructors with let expressions. !   !;None3M"]An imported environment for a particular module. This also contains the module's own members.#HLocal names for types within a module mapped to to their qualified names$TLocal names for data constructors within a module mapped to to their qualified names%JLocal names for classes within a module mapped to to their qualified names&ILocal names for values within a module mapped to to their qualified names'(The exported declarations from a module.(#The types exported from each module)%The classes exported from each module*$The values exported from each module+MThe global export environment - every declaration exported from every module.,Updates the exports for a module from the global environment. If the module was not previously present in the global environment, it is created.--Adds an empty module to an ExportEnvironment..<Adds a type belonging to a module to the export environment./'Adds a class to the export environment.0'Adds a class to the export environment.1eAdds an entry to a list of exports unless it is already present, in which case an error is returned.FReplaces all local names with qualified names within a set of modules.2Make all exports for a module explicit. This may still effect modules that have an exports list, as it will also make all data constructor exports explicit.3Add `import X ()` for any modules where there are only fully qualified references to members. This ensures transitive instances are included when using a member from a module.4vReplaces all local names with qualified names within a module and checks that all existing qualified names are valid.54Finds all exported declarations in a set of modules.6mFilters the exports for a module to ensure only explicit exports are kept in the global exports environment.7|Finds the imports within a module, mapping the imported module name to an optional set of explicitly imported declarations.8,Constructs a local environment for a module.9TExtends the local environment for a module by resolving an import of another module.:IRaises an error for when there is more than one definition for something.";#$%&'<()*+,-./0123456789:";#$%&'<()*+,-./0123456789:<None3M=None3HMDRemove explicit parentheses and reorder binary operator applications=>?@ABCDEFGHI=>?@ABCDEFGHI>None3IReplace all top level type declarations in a module with type annotations=Replace all top level type declarations with type annotations?None3,The desugaring pipeline proceeds as follows: $Remove signed literals in favour of J applications3Desugar object literals with wildcards into lambdasDesugar operator sectionsDesugar do-notation using the  Prelude.Monad type classBDesugar top-level case declarations into explicit case expressionsPDesugar type declarations into value declarations with explicit type annotations'Qualify any unqualified names and types'Rebracket user-defined binary operators3Introduce type synonyms for type class dictionariesIGroup mutually recursive value and data declarations into binding groups. @None+Ensure rows do not contain duplicate labelsANoneGenerate a new skolem constant5Introduce skolem scope at every occurence of a ForAllGenerate a new skolem scopePSkolemize a type variable by replacing its instances with fresh skolem constantsThis function has one purpose - to skolemize type variables appearing in a SuperClassDictionary placeholder. These type variables are somewhat unique since they are the only example of scoped type variables.1Ensure skolem variables do not escape their scopeBNone23462Unify two types, updating the current substitution1Unify two rows, updating the current substitutionCommon labels are first identified, and unified. Remaining labels and types are unified with a trailing row unification variable, if appropriate, otherwise leftover labels result in a unification error.Check that two types unify >Replace a single type variable with a new unification variable!$Replace type wildcards with unknowns"JReplace outermost unsolved unification variables with named type variables !"KL !" !" !"KLCNone#Check that the current set of type class dictionaries entail the specified type class goal, and, if so, return a type class dictionary reference.MCheck whether the type heads of two types are equal (for the purposes of type class dictionary lookup), and return a substitution from type variables to types which makes the type heads unify.N5Check all values in a list pairwise match a predicate#MN###MNDNone$\Check whether one type subsumes another, rethrowing errors to provide a better error messageO'Check whether one type subsumes another$O$$$OENone36%Infer the types of multiple mutually-recursive values, and return elaborated values including type class dictionaries and type annotations.P+Check if a value contains a type annotationQ=Map a function over type annotations appearing inside a valueRPReplace type class dictionary placeholders with inferred type class dictionariesS9Check the kind of a type, failing if it is not of kind *.TyRemove any ForAlls and ConstrainedType constructors in a type by introducing new unknowns or TypeClassDictionary values.iThis is necessary during type checking to avoid unifying a polymorphic type with a unification variable.UUInfer a type for a value, rethrowing any error to provide a more useful error messageVInfer a type for a valueW>Infer the type of a property inside a record with a given typeX;Infer the types of variables brought into scope by a binderYLCheck the types of the return values in a set of binders in a case statementZNCheck the type of a value, rethrowing errors to provide a better error message[Check the type of a value\5Check the type of a collection of named record fieldsThe laxt parameter controls whether or not every record member has to be provided. For object updates, this is not the case.]]Check the type of a function application, rethrowing errors to provide a better error message^(Check the type of a function application_sCompute the meet of two types, i.e. the most general type which both types subsume. TODO: handle constrained types`JEnsure a set of property names and value does not contain duplicate labelsab%cdePQRSTUVfWXYZ[g\]^_`%%ab%cdePQRSTUVfWXYZ[g\]^_`FNone24h4Check that type synonyms are fully-applied in a typei'Type check all declarations in a moduleWAt this point, many declarations will have been desugared, but it is still necessary to)Kind-check all types and add them to the  Environment*Type-check all values and add them to the  Environment%Bring type class instances into scopeProcess module imports&Type check an entire module and ensure all types and classes defined within the module that are required by exported members are also exported. jklmnopqrhi&*%&& jklmnopqrhi&GNone(3M '#Determines when to rebuild a module(Always rebuild this module)Never rebuild this module*SA type class which collects the IO actions we need to be able to run in "make" mode+Get a file timestamp,Read a file as a string-Write a text file.Respond to a progress update/Compile a collection of modules-The compilation pipeline proceeds as follows:PSort the modules based on module dependencies, checking for cyclic dependencies.#Perform a set of desugaring passes.YType check, and elaborate values to include type annotations and type class dictionaries.URegroup values to take into account new value dependencies introduced by elaboration.Eliminate dead code.5Generate Javascript, and perform optimization passes.%Pretty-print the generated Javascript1[Compiles in "make" mode, compiling each module separately to a js files and an externs fileIf timestamps have not changed, the externs file can be used to provide the module's types without having to typecheck the module again.sSAdd an import declaration for a module if it does not already explicitly import it.'()*+,-./0tu1vswx23@./01234569:;<=>?     "#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^hijklmnopqrstuvwxyz{|}~    %&'()*+,-./0123 /0')(*+,-.123 ')(*+,-./0tu1vswx23yNNOPPQRSTTUVWWXYZ[\]^_`abcdefghijklmnopqrstuvwxxyz{||}~  g                            k !"#$%&'()*+,-./0123456789:;<<=>?@ABCDEFGHIJKLMNOPQRSTUVVWXYZ[\]^_`abcdefghijklmnopqrsttuvwxyz{|}~ lmnop       !"#$%&'( )!*!+!,"-"""."/"0"1"2"3#4#5#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'{'{'G'@'|'}'~''()))*++,,,,,,,,,,--............................................................................................///////////////////////////// / 0 0 0 0111111233334455567 8!9":#;$<%=&='=(>)>*?+@,A-A.A/A0A1A2B3B4B5B6B7B8C9D:E;F<G=G>G?G@GAGBGCGDGEGFGGGGHHIHHHJHKHLHMHNHOHPHQHRHSHTUVWXYZ[\ ] ^#_#`#a#o#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#{#|#}#~####%%%w&&&&&&&&&&&&&((())))))))****************++,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,----------------0000000111333333333344444445 5 5 5 5 555566666677777778888 8!8"8#8$8%8&8'8(8)8*88+:,;-;.;/;0;1;2;3;4;5;6;7;8;9;:;;;<;=;>;?;@;A;B;C;D;E;-;2=F=G=H=I=J=K=L=M=<==N=O=PUQBRBSCTCUDVEWEXEYEZE[EEE\E]E^E_E`EaEbEcEdEeEfEgEhEiEjEkElFmFnFoFpFqFrF;F:FsFtFuGvGwGxGyGzG{|purescript-0.6.9.5 Language.PureScript.Parser.StateControl.Monad.Unify#Language.PureScript.CoreFn.LiteralsLanguage.PureScript.Traversals!Language.PureScript.AST.SourcePos!Language.PureScript.AST.OperatorsLanguage.PureScript.ConstantsControl.Monad.SupplyControl.Monad.Supply.ClassLanguage.PureScript.OptionsLanguage.PureScript.Names%Language.PureScript.CodeGen.JS.Common"Language.PureScript.CoreFn.BindersLanguage.PureScript.CoreFn.Expr%Language.PureScript.CoreFn.TraversalsLanguage.PureScript.CoreFn.MetaLanguage.PureScript.KindsLanguage.PureScript.Types)Language.PureScript.TypeClassDictionariesLanguage.PureScript.EnvironmentLanguage.PureScript.CommentsLanguage.PureScript.AST.Binders"Language.PureScript.CodeGen.JS.AST$Language.PureScript.AST.Declarations"Language.PureScript.AST.Traversals/Language.PureScript.CodeGen.JS.Optimizer.Common,Language.PureScript.CodeGen.JS.Optimizer.TCO0Language.PureScript.CodeGen.JS.Optimizer.MagicDo0Language.PureScript.CodeGen.JS.Optimizer.Inliner/Language.PureScript.CodeGen.JS.Optimizer.Unused/Language.PureScript.CodeGen.JS.Optimizer.Blocks(Language.PureScript.CodeGen.JS.OptimizerLanguage.PureScript.CoreFn.Ann!Language.PureScript.CoreFn.Module Language.PureScript.Parser.Lexer!Language.PureScript.Parser.Common Language.PureScript.Parser.Kinds Language.PureScript.Parser.Types!Language.PureScript.Pretty.Common Language.PureScript.Pretty.Kinds Language.PureScript.Pretty.TypesLanguage.PureScript.Pretty.JS&Language.PureScript.ModuleDependencies'Language.PureScript.Parser.Declarations!Language.PureScript.Pretty.ValuesLanguage.PureScript.Errors%Language.PureScript.TypeChecker.Monad%Language.PureScript.TypeChecker.Kinds(Language.PureScript.TypeChecker.Synonyms#Language.PureScript.CodeGen.Externs'Language.PureScript.Sugar.BindingGroups*Language.PureScript.Sugar.CaseDeclarations%Language.PureScript.Sugar.TypeClasses"Language.PureScript.CoreFn.Desugar'Language.PureScript.DeadCodeEliminationLanguage.PureScript.RenamerLanguage.PureScript.CodeGen.JS$Language.PureScript.Sugar.DoNotationLanguage.PureScript.Sugar.Names)Language.PureScript.Sugar.ObjectWildcards#Language.PureScript.Sugar.Operators*Language.PureScript.Sugar.TypeDeclarationsLanguage.PureScript.Sugar$Language.PureScript.TypeChecker.Rows'Language.PureScript.TypeChecker.Skolems%Language.PureScript.TypeChecker.Unify*Language.PureScript.TypeChecker.Entailment+Language.PureScript.TypeChecker.Subsumption%Language.PureScript.TypeChecker.TypesLanguage.PureScript.TypeCheckerLanguage.PureScriptPaths_purescriptLanguage.PureScript.ASTLanguage.PureScript.ParserLanguage.PureScript.PrettyLanguage.PureScript.CoreFnLanguage.PureScript.CodeGen ParseStateindentationLevelUnifyTunUnifyUnificationErroroccursCheckFailed UnifyState unifyNextVarunifyCurrentSubstitution SubstitutionrunSubstitution Unifiable=?=Partialunknown isUnknownunknowns$?UnknowndefaultUnifyStaterunUnify substituteOne=:= occursCheckfresh'fresh$fMonadErroreUnifyT$fMonadStatesUnifyT$fMonoidSubstitutionLiteral ObjectLiteral ArrayLiteralBooleanLiteral StringLiteralNumericLiteralfstMsndMthirdMpairMmaybeMeitherMdefS SourceSpanspanName spanStartspanEnd SourcePos sourcePosLinesourcePosColumn$fShowSourceSpan$fShowSourcePosFixity AssociativityInfixInfixrInfixl Precedence$fShowAssociativity$#<>++>>=+-*/%<><=>===/=.&..|..^.&&|| unsafeIndexnegateshlshrzshr complementnotzeroonereturnpure' returnEscapeduntilEwhileErunST stRefValuenewSTRef readSTRef writeSTRef modifySTRefmkFnrunFnunit undefinedmonadEffDictionaryapplicativeEffDictionarybindEffDictionarysemiringNumber ringNumbermoduloSemiringNumber numNumber ordNumbereqNumbereqString eqBoolean bitsNumberboolLikeBooleansemigroupStringsemigroupoidArrmain __superclass___unusedprimprelude preludeUnsafeeffst dataFunctionSupplySupplyT unSupplyT runSupplyT evalSupplyT runSupply evalSupply MonadSupply freshName$fMonadSupplyStateT$fMonadSupplySupplyTOptionsoptionsNoPrelude optionsNoTcooptionsNoMagicDo optionsMainoptionsNoOptimizationsoptionsVerboseErrorsoptionsNoCommentsoptionsAdditional ModeOptions MakeOptionsCompileOptionsModeMakeCompilebrowserNamespaceentryPointModulescodeGenModulesdefaultCompileOptionsdefaultMakeOptions Qualified ModuleName ProperName runProperNameIdentOprunIdent runModuleNamemoduleNameFromStringqualify$fShowQualified$fShowModuleName$fShowProperName $fShowIdent identToJsidentNeedsEscapingidentCharToStringnameIsJsReservedmoduleNameToJsproperNameIsJsReservedBinder NamedBinderConstructorBinder VarBinder LiteralBinder NullBinderCaseAlternativecaseAlternativeBinderscaseAlternativeResultGuardBindRecNonRecExprLetCaseVarAppAbs ObjectUpdateAccessor Constructor extractAnn modifyAnn$fFunctorCaseAlternativeeverywhereOnValueseverythingOnValuesConstructorTypeSumType ProductTypeMetaIsTypeClassConstructor IsNewtype IsConstructorKindFunKindRowBangStarKUnknowneverywhereOnKindseverythingOnKinds ConstraintTypePrettyPrintForAllPrettyPrintObjectPrettyPrintArrayPrettyPrintFunction KindedTypeRConsREmptySkolemConstrainedTypeForAllSaturatedTypeSynonymTypeAppTypeConstructor TypeWildcardTypeVarTUnknown SkolemScoperunSkolemScope rowToList rowFromList isMonoTypemkForAllreplaceTypeVarsreplaceAllTypeVarsusedTypeVariablesfreeTypeVariablesquantifymoveQuantifiersToFrontcontainsWildcardseverywhereOnTypeseverywhereOnTypesTopDowneverywhereOnTypesMeverywhereOnTypesTopDownMeverythingOnTypesDictionaryValueSubclassDictionaryValueDependentDictionaryValueGlobalDictionaryValueLocalDictionaryValueTypeClassDictionaryTypeTCDAlias TCDRegularTypeClassDictionaryInScopetcdName tcdClassNametcdInstanceTypestcdDependenciestcdType tcdExportedcanonicalizeDictionary DataDeclTypeNewtypeDataTypeKind ScopedTypeVarLocalTypeVariable ExternData TypeSynonymDataTypeNameKindTypeInstanceDictionaryValueDataConstructor LocalVariableExternTypeClassAccessorImportValueNameVisibilityDefined UndefinedForeignImportTypeInlineJavascript ForeignImport EnvironmentnamestypesdataConstructors typeSynonymstypeClassDictionaries typeClassesinitEnvironmentprimNameprimTy tyFunctiontyStringtyNumber tyBooleantyArraytyObjectfunction primTypeslookupConstructorisNewtypeConstructor$fShowDataDeclTypeComment BlockComment LineCommentPositionedBinder ConsBinder ArrayBinder ObjectBinder NumberBinder StringBinder BooleanBinder binderNamesJS JSCommentJSRaw JSContinueJSBreakJSLabel JSInstanceOfJSTypeOfJSThrowJSReturnJSIfElseJSForInJSForJSWhile JSAssignmentJSVariableIntroductionJSBlock JSConditionalJSVarJSApp JSFunction JSAccessorJSObjectLiteral JSIndexerJSArrayLiteralJSBinaryJSUnaryJSBooleanLiteralJSStringLiteralJSNumericLiteralBinaryOperatorZeroFillShiftRight ShiftRight ShiftLeft BitwiseXor BitwiseOr BitwiseAndOrAndGreaterThanOrEqualTo GreaterThanLessThanOrEqualToLessThan NotEqualToEqualToModulusDivideMultiplySubtractAdd UnaryOperatorJSNewPositive BitwiseNotNotNegateeverywhereOnJSeverywhereOnJSTopDowneverythingOnJSDoNotationElementPositionedDoNotationElement DoNotationLetDoNotationBindDoNotationValuePositionedValueSuperClassDictionaryTypeClassDictionaryAccessorTypeClassDictionary!TypeClassDictionaryConstructorAppDo TypedValue IfThenElse ObjectUpdater ObjectGetterObjectConstructorOperatorSectionParensBinaryNoParens UnaryMinus DeclarationPositionedDeclarationTypeInstanceDeclarationTypeClassDeclarationImportDeclarationFixityDeclarationExternInstanceDeclarationExternDataDeclarationExternDeclarationBindingGroupDeclarationValueDeclarationTypeDeclarationTypeSynonymDeclarationDataBindingGroupDeclarationDataDeclarationImportDeclarationTypeHidingExplicitImplicitDeclarationRefPositionedDeclarationRefTypeInstanceRef TypeClassRefValueRefTypeRefModule getModuleName isExportedexportedDeclarationsisDctorExportedexportedDctors isValueDecl isDataDecl isImportDeclisExternDataDeclisExternInstanceDecl isFixityDecl isExternDeclisTypeClassInstanceDeclarationisTypeClassDeclaration flattenDecls$fEqDeclarationRefeverywhereOnValuesTopDownMeverywhereOnValuesMeverythingWithContextOnValueseverywhereWithContextOnValuesM accumTypesapplyAll replaceIdent replaceIdents isReassigned isReboundisUsedtargetVariable isUpdatedremoveFromBlocktcomagicDo etaConvertunThunk evaluateIifesinlineVariables inlineValuesinlineOperatorinlineCommonOperatorsremoveCodeAfterReturnStatementsremoveUnusedArgremoveUndefinedAppcollapseNestedBlockscollapseNestedIfsoptimizeAnnnullAnnremoveComments ForeignDeclmoduleComments moduleName moduleImports moduleExports moduleForeign moduleDecls TokenParserPositionedToken ptSourcePosptToken ptCommentsTokenlexanyTokentokenmatchlparenrparenparenslbracerbracebraceslsquarersquaresquaresindentindentAtlarrowrarrow lfatArrow rfatArrowcolon doubleColonequalspipetickdotcommasemiat underscoresemiSepsemiSep1commaSep commaSep1lname qualifierreservedunamemnameuname'symbolsymbol' stringLiteralnumbernatural identifierreservedPsNamesreservedTypeNamesopChars properNameparseQualified parseIdentaugmentfoldbuildPostfixParsermarkcheckIndentationindentedsame readCommentsrunTokenParser parseKind parseTypeAtom parseType parsePolyType noWildcards PrinterState blockIndent withIndent currentIndentprettyPrintManyprettyPrintObjectKeyprettyPrintKindprettyPrintRowprettyPrintTypeAtomprettyPrintType prettyPrintJS ModuleGraph sortModulesparseImportDeclaration'parseDeclarationparseLocalDeclaration parseModuleparseModulesFromFiles parseModules parseValue parseBinderparseBinderNoParens parseGuardprettyPrintValueprettyPrintBinderMultipleErrorsrunMultipleErrors ErrorMessagePositionedErrorErrorInForeignImportErrorInValueDeclarationErrorInTypeSynonymErrorInDataBindingGroupErrorInBindingGroupErrorInTypeConstructorErrorInDataConstructorErrorInApplicationErrorInferringTypeErrorCheckingKindErrorCheckingTypeErrorInSubsumptionErrorInInstance ErrorInModuleErrorInExpressionTransitiveExportErrorInvalidInstanceHeadInvalidNewtypeTypeSynonymInstanceCannotApplyFunctionErrorUnifyingTypesPropertyIsMissingExprDoesNotHaveTypeSubsumptionCheckFailedIncorrectConstructorArity ExpectedTypeMissingClassMemberOverlappingArgNamesArgListLengthsDifferDuplicateValueDeclarationDuplicateLabelNoInstanceFoundOverlappingInstancesConstrainedTypeUnifiedKindsDoNotUnifyTypesDoNotUnifyUnspecifiedSkolemScope EscapedSkolem NotYetDefinedPartiallyAppliedSynonymUndefinedTypeVariableNameNotInScopeNameIsUndefinedCycleInTypeSynonymCycleInDeclaration InvalidDoLet InvalidDoBindDuplicateTypeArgumentDuplicateValueExportDuplicateClassExportClassConflictsWithCtorClassConflictsWithTypeCtorConflictsWithClassTypeConflictsWithClassConflictingCtorDeclsConflictingTypeDeclsConflictingImportsConflictingImportUnknownTypeConstructorUnknownDataConstructor UnknownValueUnknownTypeClass UnknownType UnknownModuleOverlappingNamesInLetRedefinedIdentRedefinedModuleOrphanFixityDeclarationOrphanTypeDeclarationMultipleFixitiesCannotReorderOperators InfiniteKind InfiniteType errorCode errorMessageonErrorMessagesprettyPrintSingleErrorprettyPrintMultipleErrors renderBoxinterpretMultipleErrorsrethrowrethrowWithPositionparU$$fUnificationErrorKindMultipleErrors$$fUnificationErrorTypeMultipleErrors"$fUnificationErrorKindErrorMessage"$fUnificationErrorTypeErrorMessageCheckunCheck CheckStatecheckEnv checkNextVarcheckNextDictNamecheckCurrentModule bindNames bindTypeswithScopedTypeVarswithTypeClassDictionariesgetTypeClassDictionariesbindLocalVariablesbindLocalTypeVariablesmakeBindingGroupVisiblelookupVariable getVisibilitycheckVisibilitylookupTypeVariablegetEnvputEnv modifyEnvrunCheck runCheck' guardWithfreshDictionaryName liftCheck liftUnifykindOfkindOfWithScopedVarskindsOf kindsOfAllsaturateAllTypeSynonymsdesaturateAllTypeSynonymsreplaceAllTypeSynonymsexpandTypeSynonym'expandTypeSynonymexpandAllTypeSynonyms moduleToPscreateBindingGroupsModulecollapseBindingGroupsModulecreateBindingGroupscollapseBindingGroupsdesugarCasesModule desugarCasesdesugarTypeClassestypeClassMemberNamesuperClassDictionaryNamesmoduleToCoreFneliminateDeadCoderenameInModules moduleToJsdesugarDoModuledesugarImportsdesugarObjectConstructors rebracketremoveSignedLiteralsdesugarOperatorSectionsdesugarTypeDeclarationsModuledesugarTypeDeclarationsdesugarcheckDuplicateLabelsnewSkolemConstantintroduceSkolemScopenewSkolemScope skolemizeskolemizeTypesInValueskolemEscapeCheck unifyTypes unifyRows unifiesWithreplaceVarWithUnknownreplaceTypeWildcards varIfUnknownentailssubsumestypesOftypeCheckModule RebuildPolicy RebuildAlways RebuildNever MonadMake getTimestamp readTextFile writeTextFileprogresscompilecompile'makeversioncatchIObindirlibdirdatadir libexecdir sysconfdir getBinDir getLibDir getDataDir getLibexecDir getSysconfDirgetDataFileNamebaseGHC.Basetco'magicDo'inlineST shouldInline isPreludeDict isPreludeFn optimize'untilFixedPointlangDef tokenParserNumberSymbol QualifierUNameLName UnderscoreAtSemiCommaDotTickPipeEquals DoubleColonColon RFatArrow LFatArrowRArrowLArrowIndentRSquareLSquareRBraceLBraceRParenLParenprettyPrintToken parseTokens whitespace parseCommentparsePositionedToken parseTokenvalidModuleName$fShowPositionedToken parseStar parseBang parseArray parseArrayOf parseFunction parseObjectparseTypeWildcardparseTypeVariableparseTypeConstructor parseForAllparseConstrainedType parseAnyTypeparseNameAndTypeparseRowEndingparseRow typeLiteralsmatchRowfunKindtypeAppappliedFunctionkindedinsertPlaceholders matchTypeAtom matchTypeforall_prettyPrintJS1prettyPrintJS'literalsstring conditionalaccessorindexerlamapptypeOf instanceOfunary'unarynegateOperatorbinaryprettyStatements usedModulestoModulewithSourceSpanparseInfixExpr kindedIdentparseDataDeclarationparseTypeDeclarationparseTypeSynonymDeclarationparseValueDeclarationparseExternDeclarationparseAssociativity parseFixityparseFixityDeclarationparseImportDeclarationparseDeclarationRefparseTypeClassDeclarationparseTypeInstanceDeclaration positionedbooleanLiteralparseNumericLiteralparseStringLiteralparseBooleanLiteralparseArrayLiteralparseObjectLiteralparseIdentifierAndValueparseAbsparseVarparseConstructor parseCaseparseCaseAlternativeparseIfThenElseparseLetparseValueAtomparseOperatorSectionparsePropertyUpdate parseAccessorparseDoparseDoNotationLetparseDoNotationBindparseDoNotationElementparseObjectGetterparseUpdaterBodyparseObjectUpdaterWildcardparseStringBinderparseBooleanBinderparseNumberBinderparseVarBinderparseNullaryConstructorBinderparseConstructorBinderparseObjectBinderparseArrayBinderparseNamedBinderparseNullBinderparseIdentifierAndBinderprettyPrintDeclarationprettyPrintCaseAlternativeprettyPrintDoNotationElementprettyPrintObject' ifThenElse objectUpdateprettyPrintValue'prettyPrintBinderAtomprettyPrintBinder'matchConsBinderprettyPrintObjectPropertyBinderprettyPrintObjectProperty solveTypes starIfUnknowninfer freshKindVarinfer'$fUnifiableCheckKind $fPartialKindbuildTypeSubstitutionsaturateTypeSynonymreplaceAllTypeSynonyms'toBindingGroupcollapseBindingGroupsForValue usedIdentsusedImmediateIdentsusedProperNamesgetIdent getProperNametoDataBindingGroup isTypeSynonym fromValueDeclisLeft desugarAbs inSameGrouptoDecls isVarBindertoTuplemakeCaseDeclarationDesugar MemberMap desugarModule desugarDeclmemberToNameAndTypetypeClassDictionaryDeclaration#typeClassMemberToDictionaryAccessor!typeInstanceDictionaryDeclarationfindQualModulesimportToCoreFnexternToCoreFnexportToCoreFnmkTypeClassConstructor properToIdentKey bindIdents foreignIdentdeclarationsByModule dependenciesisUsed' RenameState rsBoundNames rsUsedNames runRenamenewScope updateScope lookupIdentfindDeclIdents renameInDecl renameInValuerenameInLiteralrenameInCaseAlternativerenameInBinderRename initState desugarDoImportEnvironment importedTypesimportedDataConstructorsimportedTypeClassesimportedValuesExports exportedTypesexportedTypeClassesexportedValuesExportEnvironmentupdateExportedModuleaddEmptyModuleaddType addTypeClassaddValue addExportelaborateExportselaborateImportsrenameInModule findExports filterExports findImportsresolveImports resolveImportthrowConflictErrorChainrebracketModule removeParenscollectFixitiesensureNoDuplicatescustomOperatorTablematchOperatorstoAssocparseOp parseTicksmatchOpGHC.Num$fUnifiableCheckType $fPartialTypetypeHeadsAreEqualpairwise subsumes'isTyped overTypesreplaceTypeClassDictionaries checkTypeKindinstantiatePolyTypeWithUnknowns inferProperty inferBinder checkBinderscheckcheck'checkPropertiescheckFunctionApplicationcheckFunctionApplication'meetensureNoDuplicateProperties UntypedDataTypeDatatypeDictionaryForBindingGroupcheckTypedBindingGroupElementtypeForBindingGroupElementinferLetBindingcontainsTypeSynonymscheckTypeSynonyms typeCheckAll addDataTypeaddDataConstructoraddTypeSynonymvalueIsNotDefinedaddTypeClassDictionariescheckDuplicateTypeArgumentscheckTypeClassInstanceaddDefaultImport generateMaintraverseEitherreverseDependencies importPrim importPrelude