nL      !"#$%&'()*+,-./0123456789:;<=>?@ABC 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{|}~      !"#$%&'()*+ , -!.!/"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/000102030405060708090:0;0<0=0>0?0@0A0B0C0D0E0F0G0H1I1J1K1L1M1N1O1P1Q1R1S1T1U1V1W1X1Y1Z1[1\1]1^1_1`1a1b1c1d1e1f1g1h1i1j1k1l1m1n1o1p1q1r1s1t1u1v1w1x1y1z1{1|1}1~1111111111111111111111111111111111111111111111111112233444444444444444444444555555555555555555555555555555555555555555555555555555555555555 5 5 5 5 5555555555555555555 5!5"5#5$5%5&5'5(5)5*5+5,5-5.5/505152535455565758595:5;5<5=5>5?5@5A5B5C5D5E5F5G5H5I5J5K5L5M5N5O6P6Q6R6S6T6U6V6W6X6Y6Z6[6\6]6^7_8`9a9b:c:d:e:f:g:h:i:j:k:l:m:n:o:p:q:r:s:t:u:v:w;x;y;z;{;|;}<~<<<<<<<<<<<<<<<<<<<<=>>>>>>>>????@@@@@@@@@@@@@@@@@@@@@@@@@@@@AAAAABBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBCCCCCCCCCCCCCCCCCCCCCCCCC C C C C CCCCCCCCCCCCCCCCCCC C!C"C#C$C%C&C'C(C)C*C+C,C-C.C/C0C1C2C3C4C5C6C7C8C9C:C;C<C=C>C?C@CACBCCCDCECFCGDHDIDJDKDLDMDNDODPDQDRDSDTDUDVDWDXDYDZD[D\D]D^D_D`DaDbDcDdDeDfDgDhDiDjDkElEmEnEoEpEqErEsEtEuEvEwExFyFzF{F|F}F~FFFFFFFFFFFFFFFFFFFFFGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH H H H H HHHHHHHHHHHHHHHHHHI I!I"I#I$I%I&I'I(I)I*I+I,I-I.I/I0I1I2I3I4I5I6I7I8I9I:I;I<I=I>I?I@IAIBICIDIEIFIGIHIIIJIKINJ(c) 2014-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportable TrustworthyLMNLMNLMN(c) 2014-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe4:Apply a function to all elements of a container. Returns O if nothing changed, and Just container otherwise.5Apply functions to both elements of a pair. Returns O if neither changed, and  Just pair otherwise.KSafe PQRSTUVWXYZ[VWXYZ[ PQRSTUVWXYZ[(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe+\]^_`a\]^_`a(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafeGbThe preprocessor for bcThe preprocessor for cdef ghibc  def ghibc(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafeKMaps string names to values, allowing for partial key matches and querying.)Insert a value into the Trie. Will call * if a value already exists with that key.)Return all matches with the given prefix.^Given a key, return either an exact match for that key, or all matches with the given prefix.%Return all of the values from a Trie.(c) 2014-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafevThis is the widest word we can have before gmp will fail to allocate and bring down the whole program. According to  ?https://gmplib.org/list-archives/gmp-bugs/2009-July/001538.html the sizes are 2^32-1 for 32-bit, and 2^37 for 64-bit, however experiments show that it's somewhere under 2^37 at least on 64-bit Mac OS X.(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe0 (Natural numbers with an infinity element&Some algebraic properties of interest: W1 * x = x x * (y * z) = (x * y) * z 0 * x = 0 x * y = y * x x * (a + b) = x * a + x * b &Some algebraic properties of interest: gx ^ 0 = 1 x ^ (n + 1) = x * (x ^ n) x ^ (m + n) = (x ^ m) * (x ^ n) x ^ (m * n) = (x ^ m) ^ n#nSub x y = Just z iff z is the unique value such that Add y z = Just x. $ Rounds down. <y * q + r = x x / y = q with remainder r 0 <= r && r < yWe don't allow H in the first argument for two reasons: 1. It matches the behavior of %I, 2. The well-formedness constraints can be expressed as a conjunction.& Rounds up.  lg2 x = y, iff y" is the smallest number such that  x <= 2 ^ y'nWidth nL is number of bits needed to represent all numbers from 0 to n, inclusive. nWidth x = nLg2 (x + 1).(length ([ x, y .. ] : [_][w])0 We don't check that the second element fits in wY many bits as the second element may not be part of the list. For example, the length of [ 0 .. ] : [_][0] is nLenFromThen 0 1 0, which should evaluate to 1. ) length [ x, y .. z ]*Compute the logarithm of a number in the given base, rounded down to the closest integer. The boolean indicates if we the result is exact (i.e., True means no rounding happened, False means we rounded down). The logarithm base is the second argument.+CCompute the number of bits required to represent the given integer.,gCompute the exact root of a natural number. The second argument specifies which root we are computing.-Compute the the n-th root of a natural number, rounded down to the closest natural number. The boolean indicates if the result is exact (i.e., True means no rounding was done, False means rounded down). The second argument specifies which root we are computing.  !"#$%&'()*+,-. !"#$%&'()*+,-. !"#$%&'()*+,- !"#$%&'()*+,-.(c) 2015-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe0/Identifiers, along with a flag that indicates whether or not they're infix operators. The boolean is present just as cached information from the lexer, and never used during comparisons.1Module names are just text./0123456789:;<=>?@AB/0123456789:;<=>1234/0BA@?56789:;<=>/0123456789:;<=>?@AB (c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe0GC3Information about an infix expression of some sort.EoperatorF left argumentGright argumrntHoperator precedenceIoperator associativityJ Information about associativity.OPrint a name in prefix: f a b or (+) a b)P#Print a name as an infix operator: a + bY*How to display names, inspired by the GHC  Outputable module. Getting a value of OE from the NameDisp function indicates that the name is not in scope.\%Never qualify names from this module.`MCompose two naming environments, preferring names from the left environment.a Get the format for a name. When O2 is returned, the name is not currently in scope.b1Produce a document in the context of the current Y.c5Fix the way that names are displayed inside of a doc.j.Pretty print an infix expression of some sort.k2Display a numeric values as an ordinar (e.g., 2nd)l9The suffix to use when displaying a number as an oridinalNCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghij1Non-infix leaves are printed with this precedence+pattern to check if sub-thing is also infix"Pretty print this infix expressionklmnopqrstuvwxyz{|}~DCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~NYZ[UVWX\]^_`abcSTdeQRNOPfghJKLMCDEFGHIijklmnopqrstuvwxyz{|}~<CDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~qrs (c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe0An empty range.[Caution: using this on the LHS of a use of rComb will cause the empty source to propegate.&&L(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe0Gvalue, base, number of digitscharacter literal(qualified) identifierstring literalkeywordoperatorsymbolvirtual token (for layout)white space token error tokenj>The named operators are a special case for parsing types, and k8 is used for all other cases that lexed as an operator..Virtual tokens, inserted by layout processing.lVirtual layout blockm7An explicit layout block, expecting this ending token.File that we are working onSettings for layout processingPreprocessor settingsImplicit includes^When we do layout processing should we add a vCurly (i.e., are we parsing a list of things).n=Split out the prefix and name part of an identifier/operator.o'Drop white-space tokens from the input.peCollapse characters into a single Word8, identifying ASCII, and classes of unicode. This came from: Jhttps://github.com/glguy/config-value/blob/master/src/Config/LexerUtils.hsWhich adapted: >https://github.com/ghc/ghc/blob/master/compiler/parser/Lexer.xjqrstuvwxyz{k     |lm}~nopjqrstuvwxyz{k     |lm}~nop2 j qrstuvwxyz{k      |lm}~nop (c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportable Trustworthy<Returns the tokens in the last position of the input that we processed. White space is removed, and layout processing is done as requested. This stream is fed to the parser.oReturns the tokens and the last position of the input that we processed. The tokens include whte space tokens.o               i     i     d                (c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableNone (c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe345zThis packages together a type with some names to be used to display the variables. It is used for pretty printing types. *Compute the n-th variant of a name (e.g., a5).  Compute all variants of a name: a, a1, a2, a3, ...%@Expand a list of base names into an infinite list of variations.  !"#$  %&MCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ !"#$%&  !"#&%$  !"#$  %&(c) 2015-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportable Trustworthy0357C'EA mapping from an identifier defined in some module to its real name.-)A monad for easing the use of the supply. INVARIANT: this field uniquely identifies a name for one session with the Cryptol library. Names are unique to their binding site. *Information about the origin of this name. The name of the identifier Where this name was defined1/Information about the binding site of the name.22This name refers to a declaration from this module3+This name is a parameter (function or type)4Compare two names lexically.55Compare two names by the way they would be displayed. Figure out how the name should be displayed, by referencing the display function in the environment. NOTE: this function doesn't take into account the need for parenthesis.69Pretty-print a name with its source location information.>)Retrieve the next unique from the supply.?This should only be used once at library initialization, and threaded through the rest of the session. The supply is started at 0x1000 to leave us plenty of room for names that the compiler needs to know about (wired-in constants).A"Make a new name for a declaration.BMake a new parameter name.CvIt's assumed that we're looking things up that we know already exist, so this will panic if it doesn't find the name.DvIt's assumed that we're looking things up that we know already exist, so this will panic if it doesn't find the name.@'()*+ , -  ./0    12345 6789:;<=>?@ABCD ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8'()*+,-./0123456789:;<=>?@ABCD0123789:;456AB./>-<,=+?@'()*CD1'()*+ , -  ./0    12345 6789:;<=>?@ABCD ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8(c) 2015-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe0E%Passes that can generate fresh names.H#Names that originate in the parser.IUnqualified names like x, Foo, or +.JQualified names like Foo::bar or  module::!.K Fresh names generated by a pass.EFGHIJKLMNOPQRS EFGHIJKLMNOHIJKEFGSRLMNOQP EFGHIJKLMNOPQRS(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe0 TBuilt-in types.U  : Num -> Num -> NumV  : Num -> Num -> NumW  : Num -> Num -> NumX  : Num -> Num -> NumY  : Num -> Num -> NumZ  : Num -> Num -> Num[  : Num -> Num\  : Num -> Num -> Num]  : Num -> Num -> Num^ : Num -> Num -> Num -> Num Example: ([ 1, 5 .. ] :: [lengthFromThen 1 5 b][b]_ : Num -> Num -> Num -> Num Example: ,[ 1, 5 .. 9 ] :: [lengthFromThenTo 1 5 9][b]TUVWXYZ[\]^_`a 9 :TUVWXYZ[\]^_`aTUVWXYZ[\]^_`aT UVWXYZ[\]^_`a 9 :(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe-./0GZe  fin xf  x == 10g  x >= 10h  Arith ai  Cmp ajLocation informationk After parsingm  [8] -> [8]n [8] ao Bitp 10q ar infsA type variable or synonymt 2 + xu { x : [8], y : [32] }v  ([8], [32])w_, just some type.xLocation informationy  (ty)z  ty + ty  x  _  (x,y,z)  { x = (a,b,c), y = z }  [ x, y, z ]  x : [8]  (x # y)Location informationp <- eSelectors are used for projecting from various components. Each selector has an option spec to specify the shape of the thing that is being selected. Currently, there is no surface syntax for list selectors, but they are used during the desugaring of patterns.UZero-based tuple selection. Optionally specifies the shape of the tuple (one-based).@Record selection. Optionally specifies the shape of the record.=List selection. Optionally specifies the length of the list.  x  0x10  (1,2,3)  { x = 1, y = 2 }  e.l  [1,2,3] [1, 5 .. 117 ]  [1, 3 ...]  [ 1 | x <- xs ]  f x  f `{x = 8}, f`{8}  if ok then e1 else e2  1 + x where { x = 2 }  1 : [8] `(x + 1), x is a type  \x y -> xposition annotation (e)  (Removed by Fixity) a + b  (Removed by Fixity) Literals.0x10 (HexLit 2) "hello";Infromation about the representation of a numeric constant.n-digit binary literaln-digit octal literaloverloaded decimal literaln-digit hex literalcharacter literalpolynomial literal%Export information for a declaration.:Input at the REPL, which can either be an expression or a let statement. Type name Type params ConstructorBindings. Notes:The parser does not associate type signatures and pragmas with their bindings: this is done in a separate pass, after de-sugaring pattern bindings. In this way we can associate pragmas and type signatures with the variables defined by pattern bindings as well.Currently, there is no surface syntax for defining monomorphic bindings (i.e., bindings that will not be automatically generalized by the type checker. However, they are useful when de-sugaring patterns. Defined thing Parameters DefinitionOptional type sigInfix operator?Optional fixity infoOptional pragmasIs this a monomorphic bindingOptional doc string&The list of names following an import.INVARIANT: All of the Name@ entries in the list are expected to be unqualified names; the QName or K% constructors should not be present.An import declaration.#A string with location information.(An identifier with location information.!A name with location information. &The fixity used when none is provided. @Add a binding name to the export list, if it should be exported. &Check to see if a binding is exported. EAdd a type synonym name to the export list, if it should be exported.+Check to see if a type synonym is exported.3Display the thing selected by the selector, nicely.Conversational3 printing of kinds (e.g., to use in error messages)bcdefghijklmnopqrstuvwxyz{|}~      ; < = > ? @ 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 { | } ~  /189:;<JKLMEFGHIJKLMNObcdefghijklmnopqrstuvwxyz{|}~     /89:;<1HIJKNOLMEFGJKLM{|}~lmnopqrstuvwxyzdefghijk     bcbcdefghijklmnopqrstuvwxyz{|}~       ; < = > ? @ 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 { | } ~  (c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe0345GC Mutually recursive declarations!Non-recursive declaration#Hdo we need this type? it seems like it can be computed from the expr&"List value (with type of elements)' Tuple value( Record value)Elimination for tuplerecordlist* If-then-else+?List comprehensions The type caches the type of the expr.,Use of a bound variable-Function Value.Type application/Function application0Function value1Proof abstraction. Because we don't keep proofs around we don't need to name the assumption, but we still need to record the assumption. The assumption is the P0 term, which should be of kind n.2RIf `e : p => t`, then `EProofApp e : t`, as long as we can prove p.We don't record the actual proofs, as they are not used for anything. It may be nice to keep them around for sanity checking.3if e : t1, then cast e : t2 as long as we can prove that 't1 = t2'. We could express this in terms of a built-in constant. `cast :: {a,b} (a =*= b) => a -> b`4Using the constant is a bit verbose though, because we end up with both the source and target type. So, instead we use this language construct, which only stores the target type, and the source type can be reconstructed from the expression.jAnother way to think of this is simply as an expression with an explicit type annotation.71-1 constants.8Numbers9Inf:Bit; [_] _< _ -> _=  (_, _, _)>user-defined, T?Built-in type constants.Predicate symbols.@ _ == _A _ /= _B _ >= _C fin _DHas sel type field does not appear in schemasE Arith _F Cmp _GType constants.KType variables.LAUnique, kind, ids of bound type variables that are in scope The S. is a description of how this type came to be.N;The type is "simple" (i.e., it contains no type functions).O#The type is supposed to be of kind nPLThe internal representation of types. These are assumed to be kind correct.QType constant with argsRType variable (free or bound)SThis is just a type annotation, for a type that was written as a type synonym. It is useful so that we can use it to report nicer errors. Example: `TUser T ts t` is really just the type t7 that was written as `T ts` by the user. T Record typeUType parameters.WParameter identifierXKind of parameterYName from source, if any.Z Named records` Type synonym.bNamec ParametersdEnsure body is OKe Definitionf The types of polymorphic values.kKinds, classify types.pA Cryptol module.ESplit up repeated occurances of the given binary type-level function.Make a function type."Eliminate outermost type synonyms.Equality for numeric types.+Make a greater-than-or-equal-to constraint.A Has1 constraint, used for tuple and record selection.Make multiplication type.Make addition type.Make a min type.NConstruct a primitive, given a map to the unique names of the Cryptol module.Make an expression that is  % pre-applied to a type and a message. !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~'()*0TUVWXYZ[\]^_  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~pqrstuvwklmnofghij`abcdeZ[\]^_UVWXYxPQRSTONKLMGHIJ?@ABCDEF789:;<=>56%&'()*+,-./01234"#$ !yz{|}~0TUVWXYZ[\]^_ '()* !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~o(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe+Panic from an Eval context.3A sequencing operation has gotten an invalid index. For things like `(inf) or `(0-1)For division by 0.For when we know that a word is too wide and will exceed gmp's limits (though words approaching this size will probably cause the system to crash anyway due to lack of memory)For    (c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe-0357GNOTE this assumes that the sequence of bits is big-endian and finite, so the first element of the list will be the most significant bit.NOTE this produces a list of bits that represent a big-endian word, so the most significant bit is the first element of the list.`An evaluated type. These types do not contain type variables, type synonyms, or type functions.8Generic value type, parameterized by bit and word types.Jwidth, value Invariant: The value must be within the range 0 .. 2^width-1&Smart constructor for !s that checks for the width limit-Create a packed word of n bits./A type lambda that expects a Type.0Generate a stream.2This is strict!3Construct either a finite sequence, or a stream. In the finite case, record whether or not the elements were bits, to aid pretty-printing.4Construct one of: * a word, when the sequence is finite and the elements are bits * a sequence, when the sequence is finite but the elements aren't bits * a stream, when the sequence is not finitehNOTE: do not use this constructor in the case where the thing may be a finite, but recursive, sequence.5Extract a bit value.6Extract a sequence.8Extract a packed word.:3Turn a value into an integer represented by w bits.; Extract a function from a value.<,Extract a polymorphic function from a value.=Extract a tuple from a value.>Extract a record from a value.?Lookup a field in a record.@dGiven an expected type, returns an expression that evaluates to this value, if we can determine it.AXXX: View patterns would probably clean up this definition a lot.C      !"#$%&'()*+, Bit-widthValue Masked result-./0123456789:;<=>?@ABCDEF=      !"#$%&'()*+,-./0123456789:;<=>?@C !"#$%F&EDC     '()*B+,A-./0123456789:;<=>?@1      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEF(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableNone357C GHIJKLMNOPQR , !"#$%./013568;<=>?GHIJKLMNOPQR,IHKJLMNOG#$% !"./0135;<=>?68RPQ GHIJKLMNOPQR (c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe0GbHThe resulting interface generated by a module that has been typechecked.i,Generate an Iface from a typechecked module.j$Produce a PrimMap from an interface.NOTE: the map will expose both public and private names.STUVWXYZ[\]^_`abcdefghij STUVWXYZ[\]^_`abcdefghijbcdef]^_`a\g[STUVWXYZhijSTUVWXYZ[\]^_`abcdefghij (c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe035q.Bind a variable in the evaluation environment.r%Lookup a variable in the environment.sBind a type variable of kind *.tLookup a type variable. klmnopqrstuvw klmnopqrst oklmnwvupqrst klmnopqrstuvw(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafeGxEvaluation for types.y@Reduce type functions, rising an exception for undefined values. @Reduce type functions, rising an exception for undefined values.xy xyxyxy (c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe-3579z{|}~ z{|}~z{|}~z{|}~ (c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe3457GtNote that this assumes that this pass will be run only once for each module, otherwise we will get name collisions. Produce a fresh top-level name. mNot really any distinction between global and local, all names get the module prefix added, and a unique id.     (c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe345GMakes a substitution out of a list. WARNING: We do not validate the list in any way, so the caller should ensure that we end up with a valid (e.g., idempotent) substitution.Apply a substitution. Returns O if nothing changed.3Pick types for unconstrained unification variables.1Apply the substitution to the keys of a type map.3WARNING: This instance assumes that the quantified variables in the types in the substitution will not get captured by the quantified variables. This is reasonable because there should be no shadowing of quantified variables but, just in case, we make a sanity check and panic if somehow capture did occur. %replaces free vars% (c) 2015-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe expected, actualexpected a mono type, got this $Validate a type, returning its kind. 8Check that the type is valid, and it has the given kind. "Check that this is a valid schema. zCheck that the expression is well-formed, and compute its type. Reports an error if the expression is not of a mono type. ACheck that the expression is well-formed, and compute its schema. 2Check if the one type is convertible to the other. KCheck a declaration. The boolean indicates if we should check the sigantureC   %      (c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe -GXThe most general unifier is a substitution and a set of constraints on bound variables. (c) 2014-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe07>Replaces occurances of the name with the expression. Returns O) if there were no occurances of the name.2Expressions, representing Cryptol's numeric types.KPropopsitions, representing Cryptol's numeric constraints (and a bit more).  The constant 0.  The constant 1.  The constant 2. The constant infinity.+Make a conjucntion of the given properties.+Make a disjunction of the given properties.&Compute all expressions in a property.7Compute the immediate sub-expressions of an expression.Rebuild an expression, using the top-level strucutre of the first expression, but the second list of expressions as sub-expressions.,Compute the free variables in an expression.,Compute the free variables in a proposition.Pretty print a name. /An infinite list of names, for pretty prinitng."Pretty print a top-level property.<Pretty print a proposition, in the given precedence context.,Pretty print an expression at the top level.<Pretty print an expression, in the given precedence context.$Pretty print an experssion with ifs.$Pretty print an experssion with ifs. EThis is used in the simplification to "apply" substitutions to Props.A       =     =     #         (c) 2015-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe#$Simplify an expression, if possible.$4Perform simplification from the leaves up. Returns O if there were no changes.*CMake a simplification step, assuming the expression is well-formed.  !"#$%&'()*  !"#$%&'()* #$ !"%&'()*  !"#$%&'()* (c) 2015-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe35G  Apply a substituition to an atom False True Negation And Or 'If-then-else with non-atom at decision. Atoms to propositions. Implementation of  Implementation of  Implementation `e1 > e2`. Implementation of  Implementation of `e == inf`  Eliminate , except at the top level. + ,       +,+,  + ,       !(c) 2014-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe-BA condition ensure that the given *basic* proposition makes sense..Generate a property ensuring that the expression is well-defined. This might be a bit too strict. For example, we reject things like max inf (0 - 1)*, which one might think would simplify to inf.-.-.-.-."(c) 2014-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe35G/!Simplify a property, if possible.0!Simplify a property, if possible. A single simplification step. ZRebalance parens, and arrange conjucts so that we can transfer information left-to-right. [Rebalance parens, and arrange disjuncts so that we can transfer information left-to-right. 6Identify propositions that are suiatable for inlining. 7Rearrange proposition for conjuctions and disjunctions.Vinformation left-to-right, so we put proposition with information content on the left. Simplification of '. Assumes arranged conjucntions. See  . Simplification of '. Assumes arranged disjunctions. See  <Propagate the fact that the variable is known to be finite ( ) or not-finite ( 8). Note that this may introduce new expression redexes.  Negation. Simplificaiton for :== Simplificatoin for :> Attempt to simplify a fin& constraint. Assumes a defined input. Constant > expression Expression > constant1'Simplify only the Expr parts of a Prop.21Simplify only the Expr parts of a Prop. Returns O if there were no changes. Our goal is to bubble inf terms to the top of Return. VMake an expression that should work ONLY on natural nubers. Eliminates occurances of inf{. Assumes that the two input expressions are well-formed and finite. The expression is constructed by the given function. /0             12  /012/012 /0             12  #(c) 2014-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe !,Substitution does not affect the expression. "8The expression was updated and, maybe, it became linear.4,Factor-out non-linear terms, by naming them.5BApply a substituin to the non-linear expression database. Returns O, if nothing was affected. Otherwise returns  #C, and a substitution for non-linear expressions that became linear.The definitions of NL terms do not contain other named NL terms, so it does not matter if the substitution contains bindings like _a = e.nThere should be no bindings that mention NL term names in the definitions of the substition (i.e, things like x = _a are NOT ok).7Get the known non-linear terms.80The initial state for the linearization process. $:Apply the substituint to all non-linear bindings. Returns O, if nothing was affected. Otherwise returns  #O, and a substituion mapping names that used to be non-linear but became linear.~Note that we may return `Just empty`, indicating that some non-linear expressions were updated, but they remained non-linear. %+Is the top-level operator a non-linear one.3 & ' ( ) * + , ! " - . / 0 1456 278 $ 3 % 4 5 6 7 83456784378563 & ' ( ) * + , ! " - . / 0 1456 278 $ 3 % 4 5 6 7 8$(c) 2014-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe9:;<=>?@9:;<=>?@9:;<=>?@9:;<=>?@%(c) 2015-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafeG Clower bound (inclusive)DQupper bound (inclusive) If there is no upper bound, than all *natural* numbers.I!Only meaningful for numeric typesL1What we learn about variables from a single prop.QReturns  , when the intervals definitely overlap, and   otherwise.RIntersect two intervals, yielding a new one that describes the space where they overlap. If the two intervals are disjoint, the result will be O.S Any valueTAny finite valueUExactly this value ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_` ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_` IEFGHJKLABCDMNOPQRSTUVWXYZ[\]^_`ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`&(c) 2014-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe GaGiven a typing environment and an expression, compute the type of the expression as quickly as possible, assuming that the expression is well formed with correct type annotations. 9BYields the return type of the selector on the given argument type.ab 9ababab 9'(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafec6All ways to split a type in the form: `a + t1`, where a is a variable.d5Check if we can express a type in the form: `a + t1`.e<Check if we can express a type in the form: `k + t1`, where kw is a constant > 0. This assumes that the type has been simplified already, so that constants are floated to the left. f<Check if we can express a type in the form: `k * t1`, where kv is a constant > 1 This assumes that the type has been simplified already, so that constants are floated to the left. cdefcdefcdefcdef((c) 2014-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe :8Assumes simplified, linear, finite, defined expressions.g$Assumes simplified, linear, defined.i.The name of a variable in the SMT translation.j5The name of a boolean variable, representing `fin x`.kGet the value for the given name. * Assumes that we are in a SAT state (i.e., there is a model) * Assumes that the name is in the model l#Get the values for the given names. ;uConvert a bunch of improving equations into an idempotent substitution. Assumes that the equations don't have loops.mwGiven a model, compute an improving substitution, implied by the model. The entries in the substitution look like this:x = A variable x must equal constant Ax = y variable x must equal variable y x = A * y + B, (coming soon) variable x is a linear function of y, A and B are natural numbers.We are mostly interested in improving unification variables. However, it is also useful to improve skolem variables, as this could turn non-linear constraints into linear ones. For example, if we have a constraint  x * y = z, and we can figure out that x4 must be 5, then we end up with a linear constraint  5 * y = z. <"Try to prove the given expression. =Try to prove the given expression. If we fail, we try to give a counter example. If the answer is unknown, then we return an empty counter example. >lIs this the only possible value for the constant, under the current assumptions. Assumes that we are in a Sat state. Returns O~ if the variables must always match the given value. Otherwise, we return a counter-example (which may be empty, if uniknown) ?mDo these two variables need to always be the same, under the current assumptions. Assumes that we are in a Sat state. @Try to find a linear relation between the two variables, based on two observed data points. NOTE: The variable being defined is the SECOND name. AZCompute a linear relation through two concrete points. Try to find a relation of the form  y = a * x + b. Depending on the signs of a and b+, we need additional checks, to ensure tha  a * x + b is valid.9y1 = A * x1 + B y2 = A * x2 + B (y2 - y1) = A * (x2 - x1))A = (y2 - y1) / (x2 - x1) B = y1 - A * x1 :gh B Cijkl ;m < = > ? @&Definition in terms of this variable. Define this variable. Values in one model (x,y) Values in another model (x,y) aEither nothing, or an improving expression, and any additional obligations A First point  Second point (A,B) ghijklmgijhmkl :gh B Cijkl ;m < = > ? @ A)(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafeq#The property as entered by the userw#The property as entered by the user~@A test result is either a pass, a failure due to evaluating to False;, or a failure due to an exception raised during evaluationpApply a testable value to some arguments. Note that this function assumes that the values come from a call to P (i.e., things are type-correct). We run in the IO monad in order to catch any  EvalErrors.Given a (function) type, compute all possible inputs for it. We also return the total number of test (i.e., the length of the outer list. QGiven a fully-evaluated type, try to compute the number of values in it. Returns O for infinite types, user-defined types, polymorhic types, and, currently, function spaces. Of course, we can easily compute the sizes of function spaces, but we can't easily enumerate their inhabitants. TReturns all the values in a type. Returns an empty list of values, for types where  returned O. nopqrstuvwxyz{|}~nopqrstuvwxyz{|}~~tuvwxyz{|}nopqrs nopqrst uvwxyz{|}~*(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe JApply a testable value to some randomly-generated arguments. Returns O if the function returned  /, or `Just counterexample` if it returned  .oPlease note that this function assumes that the generators match the supplied value, otherwise we'll panic.Given a (function) type, compute generators for the function's arguments. Currently we do not support polymorphic functions. In principle, we could apply these to random types, and test the results. {A generator for values of the given type. This fails if we are given a type that lacks a suitable random value generator. Generate a random bit value.BGenerate a random word of the given length (i.e., a value of type [w]m) The size parameter is assumed to vary between 1 and 100, and we use it to generate smaller numbers first.(Generate a random infinite stream value.Generate a random sequence. Generally, this should be used for sequences other than bits. For sequences of bits use "randomWord". The difference is mostly about how the results will be displayed. Generate a random tuple value.Generate a random record value. Function under testArgument generatorsSize   +(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportable Trustworthy FGIN Make a numeric constant.Create a packed word KTurn a normal binop on Integers into one that can also deal with a bitsize.%Lexicographic ordering on two values.;Process two elements based on their lexicographic ordering.4Join a sequence of sequences into a single sequence.Split implementation.!Split into infinitely many chunksSplit into finitely many chunksBMerge two values given a binop. This is used for and, or and xor.,Indexing operations that return one element..Indexing operations that return many elements.Produce a random value with the given seed. If we do not support making values of the given type, return zero of that type. TODO: do better than returning zero7bit size of the resulting wordbaseexponentbase exponent maskmodulusfThe function may assume its arguments are masked. It is responsible for masking its result if needed.777,(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafeG DEvaluation environments for list comprehensions: Each variable name is bound to a list of values, one for each element in the list comprehension. EA variation of the ZipList type from Control.Applicative, with a separate constructor for pure values. This datatype is used to represent the list of values that each variable takes on within a list comprehension. The Ziph constructor is for bindings that take different values at different positions in the list, while the Pure{ constructor is for bindings originating outside the list comprehension, which have the same value for all list positions. F1Introduce the constructor function for a newtype. GTake parallel slices of the list environment. If some names are bound to longer lists of values (e.g. if they come from a different parallel branch of a comprehension) then the last elements will be dropped as the lists are zipped together. HEvaluate a comprehension. IUTurn a list of matches into the final environments for each iteration of the branch. J9Turn a match into the list of environments it represents. D K L M E N O P F Q R S T U G V H I J W X Y kp kp D K L M E N O P F Q R S T U G V H I J W X Y-(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableNone 4G 3An easy-to-use alternative representation for type .XMake a numeric constant. { val, bits } (fin val, fin bits, bits >= width val) => [bits]7Models functions of type `{a} (Arith a) => a -> a -> a`2Models functions of type `{a} (Arith a) => a -> a`Ceiling (log_2 x)4Join a sequence of sequences into a single sequence.Split implementation.!Split into infinitely many chunksSplit into finitely many chunksBMerge two values given a binop. This is used for and, or and xor.Add two polynomials4number of elementstype of elementelement44..(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafeThe names defined by a newtype.IThe names defined and used by a group of mutually recursive declarations.4The names defined and used by a single declarations.The names defined and used by a single declarations in such a way that they cannot be duplicated in a file. For example, it is fine to use xH on the RHS of two bindings, but not on the LHS of two type signatures./The names defined and used by a single binding. The names used by an expression. )The names defined by a group of patterns. HThe names defined by a pattern. These will always be unqualified names. &The names defined and used by a match. <The names defined and used by an arm of alist comprehension. ;Remove some defined variables from a set of free variables.]Given the set of type variables that are in scope, compute the type synonyms used by a type.NThe type names defined and used by a group of mutually recursive declarations.8The type names defined and used by a single declaration.(The type names used by a single binding.%The type names used by an expression.!The type names used by a pattern.The type names used by a match.%The type names used by a type schema.The type names used by a prop.8Compute the type synonyms/type variables used by a type.                    /(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe035G "$Eliminate all patterns in a program. ZGiven a pattern, transform it into a simple pattern and a set of bindings. Simple patterns may only contain variables and type annotations. [/Add annotations to exported declaration groups.XXX: This isn't quite right: if a signature and binding have different export specifications, this will favor the specification of the binding. This is most likely the intended behavior, so it's probably fine, but it does smell a bit. \GAdd annotations, keeping track of which annotation are not yet used up. ]Add annotations, keeping track of which annotation are not yet used up. The exception indicates which declarations are no longer needed. ^.Add pragma/signature annotations to a binding. _Check for multiple signatures. `.Does this declaration provide some signatures? a.Does this declaration provide some signatures? b1Does this declaration provide fixity information? c?Does this top-level declaration provide a documentation string? d5Pick a new name, to be used when desugaring patterns. eRecord an error.8 f g h i j k l m!" n o Z 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 Z p q r s t u v w x y z [ \ ] ^ _ { | ` a b c d e } ~  0(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe -./0345G%"Things that define exported names.+Expr renaming environment,Type renaming environment-#Expression-level fixity environment.iMerge two name maps, collapsing cases where the entries are the same, and producing conflicts otherwise./Generate a mapping from / to 0 for a given naming environment.08Generate a display format based on a naming environment.19Produce sets of visible names for types and declarations.rNOTE: if entries in the NamingEnv would have produced a name clash, they will be omitted from the resulting sets.2Qualify all symbols in a ) with the given prefix.4$Singleton type renaming environment.5*Singleton expression renaming environment.69Like mappend, but when merging, prefer values on the lhs.8 Generate a ) using an explicit supply.9jInterpret an import in the context of an interface, to produce a name environment for the renamer, and a Y for pretty-printing.:cGenerate a naming environment from a declaration interface, where none of the names are qualified.;0The naming environment for a single declaration.>The naming environment for a single module. This is the mapping from unqualified names to fully qualified names with uniques.?5Generate the naming environment for a type parameter.@Introduce the name A|Produce a naming environment from an interface file, that contains a mapping only from unqualified names to qualified ones.BXGenerate a type renaming environment from the parameters that are bound by this schema.%#$%&'()*+,-./0123456789:;<=>?@ABCDEFG#$%&'()*+,-./0123456789:%)*+,-GF./01234567'(8%&EDCB9:#$A@?>=<;#$%&'()*+,-./0123456789:;<=>?@ABCDEFG1(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe 0345-KGInformation about how a constraint came to be, used in error reporting.L%Computing shape of list comprehensionMUse of a split patternN+A type signature in a pattern or expressionO Instantiation of this expressionS#Just defaulting on the command lineTUse of a partial type function.V?Various errors that might happen during type checking/inferenceW Just say thisXExpected kind, inferred kindYLNumber of extra parameters, kind of resut (which should not be of the form _ -> _)Z$Type-synonym, number of extra params[&Type-synonym, number of missing params\2Type parameters with the same name (in definition)]&Multiple definitions for the same name^+The type synonym declarations are recursive_*Use of a type synonym that was not defined`&Use of a variable that was not defineda7Attempt to explicitly instantiate a non-existent param.b0Multiple definitions for the same type parametercExpected type, inferred typed'Unification results in a recursive typeekA constraint that we could not solve The boolean indicates if we know that this constraint is impossible.f3A constraint (with context) that we could not solvegVType wild cards are not allowed in this context (e.g., definitions of type synonyms).hLUnification variable depends on quantified variables that are not in scope.ihQuantified type variables (of kind *) needs to match the given type, so it does not work for all types.jRThe given constraints causes the signature of the function to be not-satisfiable.kFToo many positional type arguments, in an explicit type instantiationsSolved, assuming the sub-goals.tWe could not solved the goal.uThe goal can never be solvedvGDelayed implication constraints, arising from user-specified type sigs.x+Signature that gave rise to this constraint,Something that we need to find evidence for.With it is about$Part of source code that caused goalWhat needs to be proved*The types of variables in the environment. Known typePart of current SCCThe SMT solver to invoke*Additional arguments to pass to the solver$How verbose to be when type-checkingFor use in error messagesiHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~NHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~i|}~vwxyz{rstunopqVWXYZ[\]^_`abcdefghijklmKLMNOPQRSTUHIJ-HIJK LMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~2(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafeG1Solve class constraints. If not, then we return O. If solved, ther we return  # a list of sub-goals. 6Solve an original goal in terms of the give sub-goals. 3Solve an Arith constraint by instance, if possible. eSolve an Arith constraint for a sequence. The type passed here is the element type of the sequence. Solve Cmp constraints.vAdd propositions that are implied by the given one. The result contains the orignal proposition, and maybe some more.  3(c) 2015-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafeG4(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe34G% OVariables declared in this scope (not counting the ones from previous scopes). These are the non-linear terms mentioned in the assertions that are currently asserted (including ones from previous scopes). Either a type variable that makes the asserted properties unsatisfiable (due to a broken interval), or the current set of intervals for type variables. If a variable is not in the interval map, its value can be anything.1This includes all intervals from previous scopes. MThis is the set of currently-asserted cryptol properties only in this scope.6This includes all asserted props from previous scopes. 7Keeps track of declared variables and non-linear terms.6An SMT solver, and some info about declared variables. The actual solver ?Information about declared variables, and assumptions in scope. For debugging and A should be logically equivalent, to each other, and to whatever a represents (usually a is a ).;Optional data to associate with prop. Often, the original # from which the prop was extracted.Fully simplified: may mention ORs, and named non-linear terms. These are what we send to the prover, and we don't attempt to convert them back into Cryptol types. A version of the proposition where just the expression terms have been simplified. These should not contain ORs or named non-linear terms because we want to import them back into Crytpol types. *We use this to remember what we simplified:Class goals go on the left, numeric goals go on the right.Simplify a bunch of well-defined properties. * Eliminates properties that are implied by the rest. * Does not modify the set of assumptions. Simplify easy less-than-or-equal-to and equal-to goals. Those are common with long lists of literals, so we have special handling for them. In particular:Reduce goals of the form  (a >= k1, a >= k2, a >= k3, ...) to a >= max (k1, k2, k3, ...) , when all the k's are constant.Eliminate goals of the form ki >= k2, when k2 is leq than k1.Eliminate goals of the form a >= 0.4NOTE: This assumes that the goals are well-defined.Add the given constraints as assumptions. * We assume that the constraints are well-defined. * Modifies the set of assumptions.Given a list of propositions that together lead to a contradiction, find a sub-set that still leads to a contradiction (but is smaller).ZAttempt to find a substituion that, when applied, makes all of the given properties hold. \Given a *simplified* prop, separate linear and non-linear parts and return the linear ones.  No scopes. %Check if a name is any of the scopes. Add a name to a scope. ?Add an assertion to the current scope. Returns the linear part. Enter a scope.  Exit a scope. lAll declared names, that have not been "marked". These are the variables whose values we are interested in. All known non-linear terms.3Execute a computation with a fresh solver instance.,Execute a computation in a new solver scope. Declare a variable. MAdd an assertion to the current context. INVARIANT: Assertion is simplified. MAdd an assertion to the current context. INVARIANT: Assertion is simplified. (Try to prove a property. The result is  0 when we are sure that the property holds, and  % otherwise. In other words, getting  5 *does not* mean that the proposition does not hold.Check if the current set of assumptions is satisfiable, and find some facts that must hold in any models of the current assumptions.Returns OE if the currently asserted constraints are known to be unsatisfiable.JReturns `Just (su, sub-goals)` is the current set is satisfiable. * The sum is a substitution that may be applied to the current constraint set without loosing generality. * The  `sub-goals`Z are additional constraints that must hold if the constraint set is to be satisfiable. Assuming that we are in a satisfiable state, try to compute an improving substitution. We also return additional constraints that must hold for the currently asserted propositions to hold.I          4              5(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe0DWFThis is what's returned when we lookup variables during kind checking.Locally bound variable.An outer binding.kinds of (known) vars.lazy map, with tyvars.are type-wild cards allowed?"Read-write component of the monad.Collected errorsCollected warningsAccumulated substitution|These keeps track of what existential type variables are available. When we start checking a function, we push a new scope for its arguments, and we pop it when we are done checking the function body. The front element of the list is the current scope, which is the only thing that will be modified, as follows. When we encounter a existential type variable: 1. we look in all scopes to see if it is already defined. 2. if it was not defined, we create a fresh type variable, and we add it to the current scope. 3. it is an error if we encounter an existential variable but we have no current scope.FSelector constraints that have been solved (ref. iSolvedSelectorsLazy)Ordinary constraints*Tuple/record projection constraints. The  Z is the "name" of the constraint, used so that we can name it solution properly. !Read-only component of the monad.Source code being analysed"Type of variable that are in scopeType variable that are in scopeType synonyms that are in scopeNewtype declarations in scope3NOTE: type synonyms take precedence over newtype. The reason is that we can define local type synonyms, but not local newtypes. So, either a type-synonym shadows a newtype, or it was declared at the top-level, but then there can't be a newtype with the same name (this should be caught by the renamer).KNOTE: This field is lazy in an important way! It is the final version of  in , and the two are tied together through recursion. The field is here so that we can look thing up before they are defined, which is OK because we don't need to know the results until everything is done.When this flag is set to true, bindings that lack signatures in where-blocks will never be generalized. Bindings with type signatures, and all bindings at top level are unaffected.The results of type inference.We found some errorsType inference was successful.*This is used for generating various names.&Information needed for type inference.Location of program sourceVariables that are in scopeType synonyms that are in scopeNewtypes in scopePrivate state of type-checker=Should local bindings without signatures be monomorphized?!Options for the constraint solverThe mapping from Ident to 05, for names that the typechecker needs to refer to.$The supply for fresh name generation6The initial seeds, used when checking a fresh program.eThe monadic computation is about the given range of source code. This is useful for error reporting. 1This is the current range that we are working on. Report an error. IRetrieve the mapping between identifiers and declarations in the prelude.eRecord some constraints that need to be solved. The string explains where the constraints came from.^The constraints are removed, and returned to the caller. The substitution IS applied to them. 'Add a bunch of goals that need solving.UCollect the goals emitted by the given sub-computation. Does not emit any new goals.;Record a constraint that when we select from the first type, we should get a value of the second type. The returned function should be used to wrap the expression from which we are selecting (i.e., the record or tuple). Plese note that the resulting expression should not be forced before the constraint is solved.)Add a previously generate has constrainedGet the HasJ constraints. Each of this should either be solved, or added back using .@Specify the solution (`Expr -> Expr`) for the given constraint ( ).Generate a new name for a goal."Generate a new free type variable.TGenerate a new free type variable that depends on these additional type parameters."Generate a new free type variable.KGenerate an unknown type. The doc is a note about what is this type about.8Record that the two types should be syntactically equal.IApply the accumulated substitution to something with free type variables.5Get the substitution that we have accumulated so far. $Add to the accumulated substitution.!TVariables that are either mentioned in the environment or in a selector constraint."Lookup the type of a variable.# Lookup a type variable. Return O_ if there is no such variable in scope, in which case we must be dealing with a type constant.$(Lookup the definition of a type synonym.%"Lookup the definition of a newtype&Check if we already have a name for this existential type variable and, if so, return the definition. If not, try to create a new definition, if this is allowed. If not, returns nothing.'6Returns the type synonyms that are currently in scope.(3Returns the newtype declarations that are in scope.)6Get the set of bound type variables that are in scope.*9Return the keys of the bound variables that are in scope.+Retrieve the value of the  `mono-binds` option.,We disallow shadowing between type synonyms and type variables because it is confusing. As a bonus, in the implementation we don't need to worry about where we lookup things (i.e., in the variable or type synonym environment. -HThe sub-computation is performed with the given type parameter in scope./FThe sub-computation is performed with the given type-synonym in scope.1BThe sub-computation is performed with the given variable in scope.4CThe sub-computation is performed with the given variables in scope.5CThe sub-computation is performed with the given variables in scope.6VThe sub-computation is performed with the given type synonyms and variables in scope.7lPerform the given computation in a new scope (i.e., the subcomputation may use existential type variables).8.The arguments to this function are as follows:H(type param. name, kind signature (opt.), a type representing the param)The type representing the parameter is just a thunk that we should not force. The reason is that the type depnds on the kind of parameter, that we are in the process of computing.fAs a result we return the value of the sub-computation and the computed kinds of the type parameters. 9*Check if a name refers to a type variable.:'Are type wild-cards OK in this context?;Reports an error.=8Generate a fresh unification variable of the given kind.>(Lookup the definition of a type synonym.?#Lookup the definition of a newtype.A6Replace the given bound variables with concrete types.BRecord the kind for a local type variable. This assumes that we already checked that there was no other valid kind for the variable (if there was one, it gets over-written). C@The sub-computation is about the given range of the source code.      !"#$%&'()*+,-./012345678 See comment9:;<=>?@ABCDEFGHIJKLMNHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDENMLKJI      !"#$%&'()*+,-./01234567HGF89:;<=>?@ABCDEV         !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMN6(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe35V_Check for duplicate and recursive type synonyms. Returns the type-synonyms in dependecy order.WIAssociate type signatures with bindings and order bindings by dependency.XGiven a list of declarations, annoted with (i) the names that they define, and (ii) the names that they use, we compute a list of strongly connected components of the declarations. The SCCs are in dependency order. YgCombine a bunch of definitions into a single map. Here we check that each name is defined only onces. ZgCombine a bunch of definitions into a single map. Here we check that each name is defined only onces. [*Identify multiple occurances of something.OPQRSTUVWXYZ[\] OPQRSTUVWXYZ[STUVWOPQR]\XYZ[ OPQRSTUVWXYZ[\]7(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe Instantiate an expression of the given polymorphic type. The arguments that are provided will be instantiated as requested, the rest will be instantiated with fresh type variables.Note that we assume that type parameters are not normalized. Generally, the resulting expression will look something like this: ECast (EProofApp (ETApp e t)) t1awhere - There will be one `ETApp t` for each insantiated type parameter; - there will be one 26 for each constraint on the schema; - there will be 33 if we had equality constraints from normalization.^ ^^^ 8(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafeG Compute the type of a field based on the selector. The given type should be "zonked" (i.e., substitution was applied to it), and (outermost) type synonyms have been expanded._Solve has-constraints. ___ _9(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe`a`aa``aM(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe0G WWARNING: This is a bit of a hack. It is used to represent anonymous type applications. Generate a signature and a primitive binding. The reason for generating both instead of just adding the signature at this point is that it means the primitive declarations don't need to be treated differently in the noPat pass. This is also the reason we add the doc to the TopLevel constructor, instead of just place it on the binding directly. A better solution might be to just have a different constructor for primitives. Fix-up the documentation strings by removing the comment delimiters on each end, and stripping out common prefixes on all the remaining lines.5 bcd e 0 bcd e 0  bcd  e :(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportable Trustworthy! *+-./0345679:;<=>@CDEGHIKLN                           ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~                            ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~                            ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~  fg hijklmnopqrstuv % bcdefghijklmnopqrstuv%ijhlknmporqtsvufgbcde                                ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~                            ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~                            ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~  fg hijklmnopqrstuv   ;(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe0 Files that have been loaded &The path that includes are relative to GGet the absolute directory name of a file that contains cryptol source. Run a   action with a different include path. The argument is expected to be the path of a file that contains cryptol source, and will be adjusted with getIncPath. 6Adjust an included file with the current include path.  Raise an x error. Push a path on the stack of included files, and run an action. If the path is already on the stack, an include cycle has happened, and an error is raised. NLift an IO operation, with a way to handle the exception that it might throw. Like  B, but tries to collect as many errors as possible before failing. Remove includes from a module. Remove includes from a program. SSubstitute top-level includes with the declarations from the files they reference. PResolve the file referenced by a include into a list of top-level declarations. %Read a file referenced by an include. wxyz {| wxyz{|{wxyz|   wxyz {| <(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe 0345GV Check for overlap and shadowing Only check for overlap Don't check the environment+Multiple imported symbols contain this name.Expression name is not bound to any definition(Type name is not bound to any definition8An environment has produced multiple overlapping symbols[When a value is expected from the naming environment, but one or more types exist instead.eWhen a type is missing from the naming environment, but one or more values exist with the same name.)When the fixity of two operators conflict5When it's not possible to produce a Prop from a Type.3When a constraint appears within another constraint (Retrieve the name of the current module.;Shadow the current naming environment with some more names. Shadow the current naming environment with some more names. The boolean parameter indicates whether or not to check for shadowing. Generate warnings when the left environment shadows things defined in the right. Additionally, generate errors when two names overlap in the left environment. ?Check the RHS of a single name rewrite for conflicting sources.AThrow errors for any names that overlap in a rewrite environment. Produce a name if one exists. Note that this includes situations where overlap exists, as it's just a query about anything being in scope. In the event that overlap does exist, an error will be recorded. vAssuming an error has been recorded already, construct a fake name that's not expected to make it out of the renamer. XRename a schema, assuming that the type variables have already been brought into scope. UWhen possible, rewrite the type operator to a known constructor, otherwise return a  ; that reconstructs the original term, and a default fixity. 1The name environment generated by a single match. ERename patterns, and collect the new environment that they introduce. Rename a binding. /Resolve fixity, then rename the resulting type. PRename a schema, assuming that none of its type variables are already in scope.W }~        May contain infix expressionsThe operator to use"Will not contain infix expressions    %&'()68}~)6%&'(8}~? }~               =(c) 2015-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafeVoWhen given an equality constraint, attempt to rewrite it to the form `?x = ...`, by moving all occurrences of `?x` to the LHS, and any other variables to the RHS. This will only work when there's only one unification variable present in the prop. RRank a rewrite, favoring expressions that have fewer subtractions than additions. Rewrite an equation with respect to a unification variable ?x, into the form `?x = t`. There are two interesting cases to consider (four with symmetry):?x = tyexpr containing ?x = exprIn the first case, we just return the type variable and the type, but in the second we try to rewrite the equation until it's in the form of the first case.6Check that a type contains only finite type variables.*Rewrite an equality until the LHS is just uvar. Return the rewritten RHS.>There are a few interesting cases when rewriting the equality:A o B = R when uvar( is only present in A A o B = R when uvar is only present in B|In the first case, as we only consider addition and subtraction, the rewriting will continue on the left, after moving the BZ side to the RHS of the equation. In the second case, if the operation is addition, the A> side will be moved to the RHS, with rewriting continuing in B,. However, in the case of subtraction, the BG side is moved to the RHS, and rewriting continues on the RHS instead.In both cases, if the operation is addition, rewriting will only continue if the operand being moved to the RHS is known to be finite. If this check was not done, we would end up violating the well-definedness condition for subtraction (for a, b: well defined (a - b) iff fin b).    >(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafeGAdd additional constraints that ensure validity of type function. Note that these constraints do not introduce additional malformed types, so the well-formedness constraints are guaranteed to be well-formed. This assumes that the parameters are well-formed. >Add additional constraints that ensure the validity of a type.Import an improving substitutin (i.e., a bunch of equations) into a Cryptol substitution (which is idempotent). The substitution will contain only unification variables.  Improvements3 on skolem variables become additional constraints.Import an improving substitution into a Cryptol substitution. The substitution will contain both unification and skolem variables, so this should be used when processing *givens*.Try to pick a reasonable instantiation for an expression, with the given type. This is useful when we do evaluation at the REPL. The resulting types should satisfy the constraints of the schema.iAttempt to default the given constraints by asserting them in the SMT solver, and asking it for a model.Checking this function?These appear in the env., and we should not try to default theType parametersAssumed constraintCollected constraintsLeft: contradiciting goals, Right: goals that were not solved, or sub-goals for solved goals. Does not include "old"Consult these  Solve these ?(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafeD Check a type signature.!Check a type-synonym declaration.ACheck a newtype declaration. XXX: Do something with constraints.$Check someting with type parameters.When we check things with type parameters (i.e., type schemas, and type synonym declarations) we do kind inference based only on the immediately visible body. Type parameters that are not mentioned in the body are defaulted to kind mm. If this is not the desired behavior, programmers may add explicit kind annotations on the type parameters.+Here is an example of how this may show up: !f : {n}. [8] -> [8] f x = x + `n Note that nE does not appear in the body of the schema, so we will default it to mu, which is the correct thing in this case. To use such a function, we'd have to provide an explicit type application:  f `{n = 3}&There are two reasons for this choice: tIt makes it possible to figure if something is correct without having to look trough arbitrary amounts of code.It is a bit easier to implement, and it covers the large majority of use cases, with a very small inconvenience (an explicit kind annotation) in the rest.(Check an application of a type constant.@Check a use of a type-synonym, newtype, or scoped-type variable. Check a type-application.!Validate a parsed type."&Check a type-variable or type-synonym.#Validate a parsed proposition.$(Check that a type has the expected kind. Type constant being appliedType parameters Expected kindResulting type%Should we check for scoped type vars.Name of type sysnonymType synonym parameters Expected kindResulting type Parameters to type functionKind of type function$Validated parameters, resulting kind!Type that needs to be checkedExpected kind (if any) Checked type"!Name of thing that needs checking Expected kind##Proposition that need to be checkedChecked representation$Kind-checked typeExpected kind (if any) Inferred kind$A type consistent with expectations.  !"#$@(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe DG (Construct a primitive in the parsed AST.?Infer the type of an expression with an explicit instantiation.]We use this when we want to ensure that the expr has exactly (syntactically) the given type.SInfer the type of an expression, and translate it to a fully elaborated core term.$The type the is the smallest of all PInfer the type of a pattern. Assumes that the pattern will be just a variable. 4Infer the type of one match in a list comprehension.2Infer the type of one arm of a list comprehension.!inferBinds isTopLevel isRec binds; performs inference for a strongly-connected component of s. If  isTopLevel is true, any bindings without type signatures will be generalized. If it is false, and the mono-binds flag is enabled, no bindings without type signatures will be generalized, but bindings with signatures will be unaffected.Come up with a type for recursive calls to a function, and decide how we are going to be checking the binding. Returns: (Name, type or schema, computation to check binding)The exprMapd is a thunk where we can lookup the final expressions and we should be careful not to force it./Try to evaluate the inferred type in a binding._The inputs should be declarations with monomorphic types (i.e., of the form `Forall [] [] t`).A(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafeG6VWXYZ[\]^_`abcdefghijklmnopq6VWXYZ[\]^_`abcdefghijklmnopqB(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe0G Extra information we need to carry around to dynamically extend an environment outside the context of a single module. Particularly useful when dealing with interactive declarations as in :let or it..Invariant: All the dependencies of any module m must precede m in the list.Don't run core lint Run core lint7Try to focus a loaded module in the module environment.wGet a list of all the loaded modules. Each module in the resulting list depends only on other modules that precede it.bProduce an ifaceDecls that represents the focused environment of the module system, as well as a Y5 for pretty-printing names according to the imports.XXX This could really do with some better error handling, just returning mempty when one of the imports fails isn't really desirable.OThe unqualified declarations and name environment for the dynamic environment. Retrieve all ]e referenced by a module, as well as all of its public and private declarations, checking expressionsBuild ]D that correspond to all of the bindings in the dynamic environment.IXXX: if we ever add type synonyms or newtypes at the REPL, revisit this.0)0 C(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe04=Unable to find the module given, tried looking in these pathsUnable to open a file4Some other IO error occurred while reading this file=Generated this parse error when parsing the file for module m!Recursive module group discovered"Problems during the renaming phaseProblems during the NoPat phase#Problems during the NoInclude phaseProblems during type checking0Problems after type checking, eg. specializationModule loaded by 'import'$ statement has the wrong module nameATwo modules loaded from different files have the same module name#gPush an "interactive" context onto the loading stack. A bit of a hack, as it uses a faked module name%(Get the currently focused import source.-;Remove a module from the set of loaded module, by its path.4Run a  action in a context with a prepended search path. Useful for temporarily looking in other places while resolving imports, for example.W      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFK      !"#$%&'()*+,-./0123456789:W FED CB   A@?>=<; !"#$%&'()*+,-./0123456789:C       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFN(c) 2015-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableNone%[Write the contents of the Prelude to a temporary file so that Cryptol can load the module.&%%&%D(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableNone4Q7Rename a module in the context of its imported modules.RRun the noPat pass.TLoad a module by its path.U'Load the module specified by an import.V>Load dependencies, typecheck, and add to the eval environment.W0Rewrite an import declaration to be of the form: &import foo as foo [ [hiding] (a,b,c) ]XcFind the interface referenced by an import, and generate the naming environment that it describes.Y=Load a series of interfaces, merging their public interfaces.[Discover a module.\'Discover a file. This is distinct from [D in that we assume we've already been given a particular file name.]AAdd the prelude to the import list if it's not already mentioned.^7Load the dependencies of a module into the environment._Load the local environment, which consists of the environment for the currently opened module, shadowed by the dynamic environment.`uTypecheck a single expression, yielding a renamed parsed expression, typechecked core expression, and a type schema.a"Typecheck a group of declarations.LINVARIANT: This assumes that NoPat has already been run on the declarations.bGenerate the primitive map. If the prelude is currently being loaded, this should be generated directly from the naming environment given to the renamer instead.cTypecheck a module.h#Generate input for the typechecker.$GHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghij$GHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghij$PQRSTUVWXYZ[\]^_`abcLMNOdefGHIJKghijGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijE(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableNone4nFFind the file associated with a module name in the module search path.o,Load the module contained in the given file.pLoad the given parsed module.qnCheck the type of an expression. Give back the renamed expression, the core expression, and its type schema.rEvaluate an expression.s!Typecheck top-level declarations.t?Evaluate declarations and add them to the extended environment. klmnopqrstuvwDSTUVWXYZ\]^_`abcdefiklmnopqrstuvwDlknopqrstumvwbcdef]^_`ai\STUVWXYZ klmnopqrstuvwF(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableNoneyThe specializer monad.zsA Name should have an entry in the SpecCache iff it is specializable. Each Name starts out with an empty TypesMap.Add a `where` clause to the given expression containing type-specialized versions of all functions called (transitively) by the body of the expression.Add the declarations to the SpecCache, run the given monadic action, and then pull the specialized declarations back out of the SpecCache state. Return the result along with the declarations and a table of names of specialized bindings.<Compute the specialization of `EWhere e dgs`. A decl within dgse is replicated once for each monomorphic type instance at which it is used; decls not mentioned in e- (even monomorphic ones) are simply dropped.qTransform the given declaration groups into a set of monomorphic declarations. All of the original declarations with monomorphic types are kept; additionally the result set includes instantiated versions of polymorphic decls that are referenced by the monomorphic bindings. We also return a map relating generated names to the names from the original declarations.)Freshen a name by giving it a new unique.3Reduce `length ts` outermost type abstractions and n proof abstractions.xyz{|}~xyz{|}~zyx{|}~xyz{|}~G(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableNone4FGNA prover result is either an error message, an empty result (eg for the offline prover), a counterexample or a lazy list of satisfying assignments.The type of query to run+Which prover to use (one of the strings in )Verbosity flag passed to SBV?Extra declarations to bring into scope for symbolic simulation,Optionally output the SMTLIB query to a file&The typechecked expression to evaluateThe f of pcExpr.Bind a variable in the evaluation environment.%Lookup a variable in the environment.Bind a type variable of kind *.Lookup a type variable.Make a copy of the given value, building the spine based only on the type without forcing the value argument. This lets us avoid strictness problems when evaluating recursive definitions.Evaluate a comprehension.UTurn a list of matches into the final environments for each iteration of the branch.9Turn a match into the list of environments it represents.A@A*H(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableNone  +7>GLU':User modifiable environment, for things like numeric base.REPL exceptions.#REPL_ context with InputT handling.(REPL RW Environment.Focused module Focused file)Initial, empty environment.*!Build up the prompt for the REPL.+Run a REPL action with a fresh environment.Raise an exception.1Construct the prompt for the current environment.6Set the name of the currently focused file, edited by :e and loaded via :r.PRun a computation in batch mode, restoring the previous isBatch flag afterwards&Are let-bindings enabled in this REPL?Update the title<Set the function that will be called when updating the titleSet the REPL's string-printerGet the REPL's string-printer2Use the configured output action to print a string JUse the configured output action to print a string with a trailing newline KUse the configured output action to print something using its Show instanceGet visible variable names.!Get visible type signature names. Return a list of property names.wNOTE: we sort by displayed name here, but it would be just as easy to sort by the position in the file, using nameLoc.Given an existing qualified name, prefix it with a relatively-unique string. We make it unique by prefixing with a character #. that is not lexically valid in a module name.OGenerate a fresh name using the given index. The name will reside within the " interactive " namespace.+9Generate a UserEnv from a description of the options map.Set a user option.+Get a user option, using Maybe for failure.OGet a user option, when it's known to exist. Fail with panic when it doesn't.,Check the value to the base option.r-.'(/01234567)*89:     ;+<=>,?@ABCDEFGHIJKLMK     K     P-.' ( /01234567)*89:     ;+<=>,?@ABCDEFGHIJKLMI(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableNone4G+Command builder.0 Commands.1Successfully parsed command22Ambiguous command, list of conflicting commands3The unknown commandNREPL command parsing.ONotebook command parsing.P0A subset of commands safe for Notebook execution4Run a command.5wRandomly test a property, or exhaustively check it if the number of values in the type under test is smaller than the tests9 environment variable, or we specify exhaustive testing.QConsole-specific version of proveSat/. Prints output to the console, and binds the its variable to a record whose form depends on the expression given. See ticket #66 for a discussion of this design.R<Make a type/expression pair that is suitable for binding to it after running :sat or :prove?*Lift a parsing action into the REPL monad.S@Check declarations as though they were defined at the top-level.ThCreates a fresh binding of "it" to the expression given, and adds it to the current dynamic environmentUCreates a fresh binding of "it" to a finite sequence of expressions of the same type, and adds that sequence to the current dynamic environmentFStrip leading space.VStrip trailing space.G!Split at the first word boundary.WUncons a list.H$Lookup a string in the command list.IjLookup a string in the command list, returning an exact match even if it's the prefix of another command.J2Lookup a string in the notebook-safe command list.KParse a line as a command.XX !"#$%&'()*+,-./0123NOPYZ4[\567Q89]R^_`abc:;<defgh=ijk>l?m@AnBCDSoEpqrTUstFVuGWHIJKvwx- !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJK-0123+,-./"#$%&'()*K4GHIJ:<;=A@ED5 !6789>F?BCGX !"#$%&'()*+,-./0123NOPYZ4[\567Q89]R^_`abc:;<defgh=ijk>l?m@AnBCDSoEpqrTUstFVuGWHIJKvwxyOPKQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~~                          LLLL~LLLLLLLL L L L L LLLLLLLLLLLLLLLLLLL L!L"L#L$L%L&L'L(L)L*L+L,L-L.L/L0L1L2L3L4L5L6L7L8L9L:L;L<L=L>L?L@LALBLCLDLELFLGLHLILJLKLLLMLNLOLPLQLRLRLSLTLULULVLWLWLXLYLZL[L\L] ^ _ ` a b b c d e f g h ijjklmnopqrstuvwxyz{|}~      !!"#$%%&'()*+,-./01)2344567889:;<=>?@ABCDEFG))HIJKLMNOPQRSTUVWXYZ[[\]^_`abcdefghijkl\dmnopqlnrstuvw!!xyz{|}~44567      !"#$$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYYZ[\]^_`abbcdeffghijklmnnopqrstuvJwxyz{|}~sr      !"# $ %!&!'"(")"*"+#,#-#.#/#0#1$2$3$A$4$5$6$7$8%9%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)e)f)g)h)i)j)j)k)l)m)n)o)p)q)r)s))t)u)v)w)x)y)z){*|*w*x*}*~*****+++++++++++++++++++++++++++++++++++++++++++++++++++++++,,,----------------------------------------------------......x..................../////////00000000000 0 0 0 0 0000000000000000000 0!0"0#1$1%1&1'1(1)1*1+1,1-1.1/101111211314151617181911:1;11<1=1>1?1@1A1B1C1D1E1F1G1H1I1J1J1K1L1M1M1N1O1P1Q1R1R1S1T1U1U1V1W1X1Y1Y1Z1[1\1]1]1^1_1`1a1b1c1d1D1e1f1g111h111i1j1k1l1m1n1o1p1q1r1s1t1u1v1w1x1y1z1{1|1}2~23344444444444444444444455555555555555555555555555555555555555555555555555555555555555555555555555555555555555555t5555555555555555555555555555555555 5 5 5 5 5555556666666666666 6!6"7#8$9%9&M'M(M)M*:+:,:-:.:/:0:1:2:3:4:5:6:7:8:9:::;;<;=;>;?;@;A<B<C<D<E<F<G<H<I<J<K<L<M<N<O<P<Q<R<S<T<U<V=W>X>Y>Z>[>\>]>^>_?`?a?b?c@d@e@f@g@h@i@j@k@l@m@n@o@p@q@r@s@t@u@v@w@x@y@z@{@|@}@~@AAAAA*BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCDDDDDDDDDDCDTDD.DDDD D D D D DDDDDDDDDDDDDDDEEEE EEEEEEEEUEVFFFFF F!F"F#F$F%F&F'F(F)F*F+F,F-F.F/F0F1F2F3F4F5FG6G6GoGpG7G8G9G:G;G<G=G>G?G@GAGAGBGCGDGEGFGGGHGIGJGKGLGMGNGOGPGQGRGSGTGUGVGWGXGYGZG[G3G\G]G^G_G`GaGsGtGuGvGGyGbGGcGdGeGfGgGhGiGjHkHlHmHmHnHoHpHqHrHsHtHuHvHwHxH'HyHzH{H|HH}H~HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH0HHHHHHHIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIJJJKKKKKKKKKKKKLLLLLLLLLLLLLLLLLLLLLLLLLLLL L L L L LLLLLLLLLLLLLLLLLLLL L!L"L#L$L%L&L'L(L)L* + , + - . / . 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 { | } ~                        mnor                                  ! " # $ %c &` ' ( ) * + + , - . / 0 1 2 3 4 5 6 7 8 9 : ;t < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V S T W X  Y Z  [  \  ]  ^  _ ` a b c d e f g h" i" j" k" l" m" n" o" p S q r S q s" t" u" v"" w" x" y" z" {" |" }" ~#=#  # # #,# # # # # # #^# # # # # # # # # # # & ( ( ( ( ( ( ( ( ( ( , , , , ,g,h,i, , , , , , ,c,d,b, , , , , , // / / / / / / / / ///// C/ / / / / / / / / / / / / / / / / / / / / // /i/ / / /y/ / / / 2 2 2 2 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 44 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4  S q 7 7 7 8 8 8 8 8 M M M MMM M M M M M M M M M M M M M M !M "M #M $M %M &M 'M (M )M *M +M ,M -M .M /M 0M 1M 2M 3M 4M aM 5M 6M 7M 8M 9M :M ;M <M =: >: ?: @: @: A: B: C: D: D: E: F: G: H: I: J: K: L: M: N: O: P: Q: R: S: T: U: V: W: X: Y: Z: [: \: ]: ^: _: `: a: b: c: d: e: f: g: h: i: j: k: l: m: n: o: p: q: r: s: t: u: v: w: x: y: z: {: |: }: ~: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : !: ": #: $: %: &: ': (: ): *: +: ,: -: .: /: 0: 1: 2: 3: 4: 5: 6: 7: 8: 9: :: ;: <: =: >: ?: @: A: B: C: D: E: F: G: H: I: J: K: L: M: N: O: P: Q: R: S: T: U: V: W: X: Y: Z: [: \: ]: ^: _: `: a: b: c: d: e: f: g: h: i: j: k: l: m: n: o: p: q: r: s: t: u: v: w: x: y: z: {: |: }: ~: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : !: ": #: $: %: &: ': (: ): *: +: ,: -: .: /: 0: 1: 2: 3: 4: 5: 6: 7: 8: 9: :: ;: <: =: >: ?: @: A: B: C: D: E: F: G: H: I: J: K: L: M: N: O: P: Q: R: S: T: U: V: W: X: Y: Z: [: \: ]: ^: _: `: a: b: c: d: e: f: g: h: i: j: k: l: m: n: o: p: q: r: s: t: u: v: w: x: y: z: {: |: }: ~: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : ; ; ; ; ; ; ; ; ; ;  ; ; ; ; ; ;6;6; ; ; ; ; ; ; ; ; < < < < < < < < < < < < < < < < < < <D< < < < < <<< < < < !< "< #< $< %< &< '< (< )< *< +< ,< -< .< /< 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? [N \N ]H ^HH _H `H aH bH cH dHH eH fH gH hH iH jH kH lH mH nH oH H pH qH rH sH tH uH vH wH xH yH zH {H |H }H ~H H H 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 II I I I I I I I I I crypt_6cA8mFZQZlG58aocWbdYhGCryptol.Utils.MiscCryptol.VersionCryptol.Utils.PanicCryptol.Parser.UnlitCryptol.REPL.TrieCryptol.Eval.ArchCryptol.TypeCheck.Solver.InfNatCryptol.Utils.IdentCryptol.Utils.PPCryptol.Parser.PositionCryptol.Parser.LexerCryptol.Utils.DebugCryptol.TypeCheck.PPCryptol.ModuleSystem.NameCryptol.Parser.NameCryptol.Prims.SyntaxCryptol.Parser.ASTCryptol.TypeCheck.ASTCryptol.Eval.ErrorCryptol.Eval.ValueCryptol.Symbolic.ValueCryptol.ModuleSystem.InterfaceCryptol.Eval.EnvCryptol.Eval.TypeCryptol.TypeCheck.TypeMapCryptol.Transform.MonoValuesCryptol.TypeCheck.SubstCryptol.TypeCheck.SanityCryptol.TypeCheck.Unify$Cryptol.TypeCheck.Solver.Numeric.AST-Cryptol.TypeCheck.Solver.Numeric.SimplifyExpr*Cryptol.TypeCheck.Solver.Numeric.Simplify1(Cryptol.TypeCheck.Solver.Numeric.Defined)Cryptol.TypeCheck.Solver.Numeric.Simplify'Cryptol.TypeCheck.Solver.Numeric.NonLin-Cryptol.TypeCheck.Solver.Numeric.ImportExport)Cryptol.TypeCheck.Solver.Numeric.IntervalCryptol.TypeCheck.TypeOfCryptol.TypeCheck.Solver.Utils$Cryptol.TypeCheck.Solver.Numeric.SMTCryptol.Testing.ConcreteCryptol.Testing.RandomCryptol.Prims.Eval Cryptol.EvalCryptol.Symbolic.PrimsCryptol.Parser.NamesCryptol.Parser.NoPatCryptol.ModuleSystem.NamingEnvCryptol.TypeCheck.InferTypesCryptol.TypeCheck.Solver.Class$Cryptol.TypeCheck.Solver.Numeric.FinCryptol.TypeCheck.Solver.CrySATCryptol.TypeCheck.MonadCryptol.TypeCheck.DependsCryptol.TypeCheck.Instantiate!Cryptol.TypeCheck.Solver.SelectorCryptol.Parser.UtilsCryptol.ParserCryptol.Parser.NoIncludeCryptol.ModuleSystem.Renamer!Cryptol.TypeCheck.Solver.SimplifyCryptol.TypeCheck.SolveCryptol.TypeCheck.KindCryptol.TypeCheck.InferCryptol.TypeCheckCryptol.ModuleSystem.EnvCryptol.ModuleSystem.MonadCryptol.ModuleSystem.BaseCryptol.ModuleSystemCryptol.Transform.SpecializeCryptol.SymbolicCryptol.REPL.MonadCryptol.REPL.CommandGitRev Paths_cryptolCryptol.Parser.LexerUtilsCryptol.Parser.ParserUtilsCryptol.PreludeanyJustanyJust2version commitHashcommitShortHash commitBranch commitDirtypanicPreProcNoneMarkdownLaTeX knownExts guessPreProcunLitTrieNode emptyTrie insertTrie lookupTrielookupTrieExactleavesmaxBigIntWidthNat'NatInffromNatnEqnGtnFinnAddnMulnExpnMinnMaxnSubnDivnModnLg2nWidth nLenFromThennLenFromThenTogenLog widthInteger rootExactgenRoot $fTrieKeyNat'IdentModName unpackModName packModNamemodSep packIdent packInfix unpackIdentmkIdentmkInfix isInfixIdent nullIdent identText preludeNameinteractiveName $fNFDataIdent$fIsStringIdent $fOrdIdent $fEqIdentInfixieOpieLeftieRightiePrecieAssocAssoc LeftAssoc RightAssocNonAssocPPName ppPrefixName ppInfixNamePPppPrecDoc NameFormat UnQualified Qualified NotInScopeNameDisp EmptyNameDispneverQualifyMod alwaysQualify neverQualify fmtModNameextend getNameFormat withNameDisp fixNameDisprunDocrenderpppretty optParenscommaSepppInfixordinal ordSuffixliftPJliftPJ1liftPJ2liftSep<><+>$$sepfsephsephcatvcathangnestparensbracesbracketsquotes punctuatetextcharintegerintcommaemptycolon $fPPIdent$fPPText $fNFDataAssoc $fIsStringDoc $fShowDoc $fNFDataDoc $fMonoidDoc$fMonoidNameDisp$fShowNameDisp$fNFDataNameDispAddLocaddLocdropLocHasLocgetLocRangefromtosourcePositionlinecolLocatedsrcRangething emptyRangestartmovemovesrCombrCombsat$fAddLocLocated $fHasLoc[] $fHasLoc(,)$fHasLocLocated $fHasLocRange$fPPNameLocated $fPPLocated $fPPRange $fPPPosition$fFunctorLocated $fNFDataRange$fNFDataPosition$fNFDataLocatedTokenTNumChrLitStrLitKWOpSymVirtWhiteErrEOFTokenErrUnterminatedCommentUnterminatedStringUnterminatedChar InvalidString InvalidChar LexicalErrorTokenSymBarArrLArrRFatArrRLambdaEqDefCommaSemiDotDotDot DotDotDotColonBackTickParenLParenRBracketLBracketRCurlyLCurlyRTriLTriR UnderscoreTokenKWKW_ArithKW_BitKW_CmpKW_elseKW_Eq KW_externKW_finKW_if KW_private KW_includeKW_infKW_lg2KW_lengthFromThenKW_lengthFromThenToKW_maxKW_min KW_module KW_newtype KW_pragma KW_propertyKW_thenKW_typeKW_whereKW_letKW_x KW_importKW_as KW_hiding KW_infixl KW_infixrKW_infix KW_primitiveTokenW BlockComment LineCommentSpaceDocStrTokenVVCurlyLVCurlyRVSemiToken tokenType tokenTextLayoutNoLayoutConfig cfgSource cfgLayout cfgPreProccfgAutoIncludecfgModuleScope defaultConfiglexer primLexertraceppTrace WithNamesNameMap emptyNameMapppWithNamesPrec ppWithNamesdumpnameList intToNamePrimMap primDecls primTypesSupplySupplyMSupplyTFreshM liftSupplyNameNameInfoDeclared ParametercmpNameLexicalcmpNameDisplay ppLocName nameUnique nameIdentnameInfonameLocasPrim runSupplyT runSupplyM nextUniqueM emptySupply nextUnique mkDeclared mkParameterlookupPrimDecllookupPrimTypePassNoPat MonoValuesPNameUnQualQualNewNamemkUnqualmkQual getModNamegetIdent $fPPNamePName $fPPPName $fNFDataPass $fNFDataPNameTFunTCAddTCSubTCMulTCDivTCModTCExpTCWidthTCMinTCMax TCLenFromThenTCLenFromThenTo tBinOpPrec tfunNamesNoPosnoPosPropCFinCEqualCGeqCArithCCmpCLocatedCTypeTypeTSeqTBitTNumTCharTInfTUserTAppTRecordTTupleTWildTLocatedTParensTInfixTParamtpNametpKindtpRangeKindKNumKTypeSchemaForallNamednamevaluePatternPVarPWildPTuplePRecordPListPTypedPSplitPLocatedMatchMatchLetSelectorTupleSel RecordSelListSelTypeInst NamedInstPosInstExprEVarELitETupleERecordESelEListEFromToEInfFromECompEAppEAppTEIfEWhereETypedETypeValEFunELocatedEParensEInfixLiteralECNumECStringNumInfoBinLitOctLitDecLitHexLitCharLitPolyLit ExportSpeceTypeseBindsTopLeveltlExporttlDoctlValue ExportTypePublicPrivate ReplInput ExprInputLetInputNewtypenNamenParamsnBodyPragma PragmaNotePragmaProperty FixityCmpFCErrorFCLeftFCRightFixityfAssocfLevelBindDefDPrimDExprLBindDefBindbNamebParamsbDef bSignaturebInfixbFixitybPragmasbMonobDocTySyn ImportSpecHidingOnlyImportiModuleiAsiSpecDecl DSignatureDFixityDPragmaDBindDPatBindDTypeDLocatedTopDecl TDNewtypeIncludeModulemNamemImportsmDeclsProgramLStringLIdentLPNamemodRange compareFixity defaultFixity exportBindisExportedBind exportTypeisExportedType ppSelectorcppKindHasKindkindOfDeclDefdName dSignature dDefinitiondPragmasdInfixdFixitydDoc DeclGroup Recursive NonRecursiveFromLetERecETAbsETAppEAbs EProofAbs EProofAppECastUserTCTCTCNumTCInfTCBitTCSeqTCFunTCTuple TCNewtypePCPEqualPNeqPGeqPFinPHasPArithPCmpTConTFTVarTVFreeTVBoundSTypeTRectpUniquentNamentParams ntConstraintsntFieldstsNametsParams tsConstraintstsDefsVarssPropssTypeKProp:->mExportsmTySyns mNewtypestpVar groupDeclsisFreeTV isBoundTVtIsNat'tIsNumtIsInftIsVartIsFuntIsSeqtIsBittIsTuple tIsBinFun tSplitFunpIsFinpIsGeqpIsEqpIsArithpIsCmp pIsNumerictNumtZerotOnetTwotInftNat'tBittWordtSeqtChartStringtRectTupletFuntNoUsertWidth tLenFromThentLenFromThenTotMax=#==/=pArithpCmp>==pHaspFin.*..+..-..^.tDivtModtMin newtypeTyConnewtypeConTypeePrimeErroreStringeChar quickApply addTNamesppNewtypeShortppLam splitWhilesplitAbs splitTAbs splitProofAbs $fPPWithNames $fPPModule$fPPDecl$fPPWithNames0$fPPWithNames1 $fPPDeclGroup$fPPWithNames2 $fPPMatch$fPPWithNames3$fPPExpr$fPPWithNames4 $fPPUserTC$fPPTC$fPPPC$fPPTCon$fPPType$fPPWithNames5 $fPPTySyn$fPPWithNames6 $fPPSchema$fPPWithNames7$fPPWithNames8 $fPPTParam$fPPTVar$fPPWithNames9$fPPKind$fHasKindTParam$fHasKindNewtype$fHasKindTySyn $fHasKindType $fHasKindTFun $fHasKindPC $fHasKindTC$fHasKindUserTC $fHasKindTCon $fHasKindTVar$fNFDataDeclDef $fNFDataDecl$fNFDataDeclGroup $fNFDataMatch $fNFDataExpr $fOrdTVar$fEqTVar $fOrdUserTC $fEqUserTC$fNFDataUserTC $fNFDataTC $fNFDataPC $fNFDataTCon $fNFDataTVar $fNFDataType $fOrdTParam $fEqTParam$fNFDataTParam$fNFDataNewtype $fNFDataTySyn$fNFDataSchema $fNFDataKind$fNFDataModule EvalError InvalidIndexTypeCannotBeDemoted DivideByZero WordTooWide UserError evalPanic invalidIndextypeCannotBeDemoted divideByZero wordTooWide cryUserError$fExceptionEvalError $fPPEvalErrorBitWordpackWord unpackWordWithBasePPOptsuseAsciiuseBase useInfLengthTValuetValTyValueGenValueVRecordVTupleVBitVSeqVWordVStreamVFunVPolyBVisTBitisTSeqisTFunisTTupleisTRectvSeq numTValue toNumTValue finTValuemkBv defaultPPOptsppValue asciiMode integerToCharppWordmaskwordlamtlamtoStreamtoFinSeq boolToWordtoSeq toPackedSeqfromVBitfromSeqfromStr fromVWordvWordLenfromWordfromVFun fromVPoly fromVTuple fromVRecord lookupRecordtoExpr$fBitWordBoolBV $fPPWithBase $fShowTValue$fNFDataTValue$fNFDataGenValue $fNFDataBVSWordSBool fromBitsLE literalSWord forallBV_ existsBV_ forallSBool_ existsSBool_iteValue mergeValue IfaceDecl ifDeclName ifDeclSig ifDeclPragmas ifDeclInfix ifDeclFixity ifDeclDoc IfaceNewtype IfaceTySyn IfaceDeclsifTySyns ifNewtypesifDeclsIface ifModNameifPublic ifPrivate ifTySynName mkIfaceDeclgenIface ifacePrimMapEvalEnvenvVarsenvTypesReadEnvemptyEnvbindVar lookupVarbindType lookupType$fMonoidEvalEnv$fNFDataEvalEnvevalTypeevalTFTypeMapTMtvartcontrecTypesMapListLnilconsTrieMapemptyTMnullTMlookupTMalterTMunionTMtoListTMmapMaybeWithKeyTM membersTMinsertTM insertWithTMmapTM mapWithKeyTM mapMaybeTM rewModuleTVarsapSubstFVSfvsSubstSsuMap suDefaulting emptySubst singleSubst@@defaultingSubst listSubst isEmptySubst substToList apSubstMaybedefaultFreeVarapSubstTypeMapKeys $fTVarsModule$fTVarsDeclDef $fTVarsDecl$fTVarsDeclGroup $fTVarsMatch $fTVarsExpr $fTVarsSchema$fTVarsTypeMap $fTVarsList $fTVarsType $fTVars(,) $fTVars[] $fTVarsMaybe $fFVSSchema$fFVS(,)$fFVS[] $fFVSType $fPPSubstError TypeMismatch ExpectedMonoTupleSelectorOutOfRange MissingFieldUnexpectedTupleShapeUnexpectedRecordShapeUnexpectedSequenceShape BadSelectorBadInstantiationCaptured BadProofNoAbsBadProofTyVars KindMismatchNotEnoughArgumentsInKindBadApplicationFreeTypeVariableBadTypeApplicationRepeatedVariableInForallBadMatchEmptyArmUndefinedTypeVaraibleUndefinedVariableProofObligationsametcExprtcDeclstcModuleUnificationErrorUniTypeMismatchUniKindMismatchUniTypeLenMismatch UniRecursiveUniNonPolyDepends UniNonPolyResultOKMGUuniErroremptyMGUmgumguMany $fMonadResult$fApplicativeResultHasVarsIfExprIfExpr'IfReturn ImpossibleKVar:+:-:*DivMod:^^MinMaxWidth LenFromThen LenFromThenToFin:==:>=:>:==::>::&&:||NotPFalsePTrueUserNameSysNamezeroonetwoinfcryAndscryOrs cryPropExprs cryExprExprscryRebuildExpr cryExprFVS cryPropFVS composeSubstcryLet doAppSubstppNameppProp ppPropPrecppExpr ppExprPrecppIfExprppIfSignPosNeg crySimpExprcrySimpExprMaybe otherSignsignedsplitSumnormSumcrySimpExprStepcrySimpExprStep1 propToProp'ppProp'cryDefinedProp cryDefined crySimplifycrySimplifyMaybecrySimpPropExprcrySimpPropExprMaybeNonLinS nonLinProp apSubstNLlookupNL nonLinSubstinitialNonLinSExportM exportProp runExportM exportPropM exportTypeM importProp importTypeIntervaliLoweriUpperIntervalUpdateNoChangeInvalidInterval NewIntervals typeIntervalupdateIntervalcomputePropIntervals propInterval ppIntervals ppIntervaliIsExactiIsFin iDisjoint iIntersectiAnyiAnyFiniConstiAddiMuliExpiMiniMaxiSubiDiviModiWidth iLenFromTheniLenFromThenTo fastTypeOf fastSchemaOfsplitVarSummandssplitVarSummandsplitConstSummandsplitConstFactor desugarPropifPropToSmtLibsmtName smtFinNamegetValgetValscryImproveModel TestReport reportResult reportPropreportTestsRunreportTestsPossibleTestSpectestFntestProp testTotal testPossibletestRptProgresstestClrProgresstestRptFailuretestRptSuccess TestResult FailFalse FailErrorisPass runOneTest testableTypetypeSize typeValuesrunTestsGen randomValue randomBit randomWord randomStreamrandomSequence randomTuple randomRecordBinArithUnaryGenUnaryBinary GenBinaryevalPrim primTable ecDemoteV divModPolymodExp doubleAndAddbinaryunary liftBinArith arithBinary arithUnarylg2divWrapmodWrap lexCompare zipLexComparecmpOrder withOrdermaxVminVfunCmpzeroVjoinVsplitAtVecSplitV infChunksOf finChunksOfccatV logicBinary logicUnary logicShiftshiftLWshiftLSshiftRWshiftRSrotateLWrotateLSrotateRWrotateRS indexPrimOne indexFront indexBack indexPrimManyindexFrontRangeindexBackRange fromThenVfromToV fromThenToVrandomVtlamN moduleEnvevalExpr evalDeclsTypeValTVBitTVSeqTVStreamTVTupleTVRecordTVFun traverseSndselectVatV replicateVnthnthVmapVcatVdropVtakeV toTypeValsExpsLg2cmpValuecmpEqcmpNotEqcmpLtcmpGtcmpLtEqcmpGtEq cmpBinaryerrorVaddPolyitesdegreemdpidxdivx modExportstnamesNTnamesDsnamesD allNamesDnamesBnamesDefnamesEnamesPsnamesPnamesMnamesArm boundNamesnamesTtnamesDstnamesDtnamesB tnamesDeftnamesEtnamesTItnamesPtnamesMtnamesStnamesCtnamesTMultipleSignaturesSignatureNoBind PragmaNoBindMultipleFixities FixityNoBind MultipleDocsRemovePatternsremovePatterns ImportIface BindsNames namingEnvInModule NamingEnvneExprsneTypesneFixitymerge toPrimMap toNameDisp visibleNamesqualify filterNames singletonT singletonE shadowing travNamingEnv namingEnv' interpImportunqualifiedEnv$fBindsNamesInModule$fBindsNamesInModule0$fBindsNamesInModule1$fBindsNamesModule$fBindsNamesTParam$fBindsNamesInModule2$fBindsNamesImportIface$fBindsNamesSchema$fBindsNames[]$fBindsNamesMaybe$fBindsNamesNamingEnv$fMonoidNamingEnv$fNFDataNamingEnv TyFunName UserTyFun BuiltInTyFunConstraintSourceCtComprehension CtSplitPat CtTypeSigCtInst CtSelector CtExactType CtEnumeration CtDefaultingCtPartialTypeFun CtImprovementErrorMsgTooManyTypeParamsTooManyTySynParamsTooFewTySynParamsRepeatedTyParamsRepeatedDefinitionsRecursiveTypeDeclsUndefinedTypeSynonymUndefinedTypeParamMultipleTypeParamDefs RecursiveType UnsolvedGoalUnsolvedDelcayedCtUnexpectedTypeWildCardTypeVariableEscaped NotForAllUnusableFunctionTooManyPositionalTypeParams%CannotMixPositionalAndNamedTypeParams AmbiguousTypeWarningDefaultingKindDefaultingWildType DefaultingToSolvedUnsolved Unsolvable DelayedCt dctSource dctForalldctAsmpsdctGoalsHasGoalhasNamehasGoalGoal goalSource goalRangegoalGoalsVarTypeExtVarCurSCC SolverConfig solverPath solverArgs solverVerbose emptyGoals nullGoals fromGoals insertGoal addTVarsDescsppUse $fPPSolved$fPPConstraintSource $fPPError $fPPWarning$fTVarsDelayedCt$fTVarsHasGoal $fTVarsGoal $fTVarsGoals$fFVSDelayedCt $fFVSGoal $fFVSError $fTVarsError $fFVSWarning$fTVarsWarning$fTVarsConstraintSource $fPPTyFunName$fNFDataTyFunName$fNFDataConstraintSource $fNFDataError$fNFDataWarning$fNFDataDelayedCt $fNFDataGoal$fNFDataSolverConfig classStep expandPropcryIsFin cryIsFinTypeDebugLogdebugLog debugLogListSolverlogger DefinedPropdpData dpSimpPropdpSimpExprProp knownDefined numericRight simplifyProps assumePropsminimizeContradictionSimpDefgetModel getIntervals withSolver withScopecheck debugBlockLkpTyVar TLocalVar TOuterVarKRW typeParamsKRO lazyTVars allowWildKindMKMunKMRWiErrors iWarningsiSubst iExistTVars iSolvedHas iNameSeedsiCtsiHasCtsROiRangeiVarsiTVarsiTSyns iNewtypesiSolvedHasLazy iMonoBindsiSolver iPrimNamesDefLocIsLocal IsExternalInferMIMunIM InferOutput InferFailedInferOK NameSeedsseedTVarseedGoal InferInputinpRangeinpVarsinpTSyns inpNewtypes inpNameSeeds inpMonoBindsinpSolverConfig inpPrimNames inpSupply nameSeeds runInferMioinRange inRangeMbcurRange recordError recordWarning getSolver getPrimMapnewGoalnewGoalsgetGoalsaddGoals collectGoals newHasGoal addHasGoal getHasGoals solveHasGoalnewName newGoalNamenewTVarnewTVar' newTParamnewTypeunify applySubstgetSubst extendSubst varsWithAsmps lookupTVar lookupTSyn lookupNewtypeexistVargetTSyns getNewtypesgetTVarsgetBoundInScope getMonoBindscheckTShadowing withTParam withTParams withTySyn withNewtype withVarType withVarTypeswithVar withMonoType withMonoTypes withDecls inNewScoperunKindM kLookupTyVarkWildOK kRecordErrorkRecordWarningkNewType kLookupTSynkLookupNewtype kExistTVar kInstantiateTkSetKindkInRange kNewGoals kInInferM $fMonadKindM$fApplicativeKindM$fFunctorKindM$fFreshMInferM$fMonadFixInferM $fMonadInferM$fApplicativeInferM$fFunctorInferM$fNFDataNameSeedsFromDecltoBindtoTyDecl isTopDeclTyDeclTSNT orderTyDecls orderBindsmkScc combineMapscombine duplicates$fFromDeclDecl$fFromDeclTopDeclinstantiateWith tryHasGoal widthIdenttranslateExprToNumT ParseError HappyError HappyErrorMsgppError parseModName parseHelpNameparseProgramWith parseModule parseProgram parseExprWith parseExpr parseDeclWith parseDeclparseDeclsWith parseDeclsparseLetDeclWith parseLetDecl parseReplWith parseReplparseSchemaWith parseSchema IncludeError IncludeFailedIncludeParseError IncludeCycleremoveIncludesModuleppIncludeErrorRenamerenameRenameMRenamerWarningSymbolShadowed RenamerError MultipleSyms UnboundExpr UnboundTypeOverlappingSyms ExpectedValue ExpectedType FixityErrorInvalidConstraintMalformedConstraint runRenamer shadowNamescheckNamingEnv renameModule renameVar renameTypetryRewritePropAsSubstwfTypeFunctionwfTypesimplifyAllConstraintsproveImplicationimproveByDefaultingWithdefaultReplExprsimpType simpTypeMaybe checkSchema checkTySyn checkNewtype checkType inferModulemkPrimdesugarLiteralappTys inferTyParamcheckTypeOfKindinferEcheckE expectSeq expectTuple expectRec expectFin expectFun checkHasTypecheckFunsmallestcheckPinferP inferMatch inferCArm inferBinds guessTypesimpBind generalize checkMonoB checkSigBinferDstcPanic ppWarning DynamicEnvDEnvdeNamesdeDeclsdeEnv LoadedModulelmName lmFilePath lmInterfacelmModule LoadedModulesgetLoadedModulesCoreLint NoCoreLint ModuleEnvmeLoadedModules meNameSeeds meEvalEnvmeFocusedModule meSearchPathmeDynEnv meMonoBindsmeSolverConfig meCoreLintmeSupplyresetModuleEnvinitialModuleEnv focusModule loadedModules focusedEnv dynamicEnv qualifiedEnvisLoaded lookupModuleaddLoadedModuleremoveLoadedModule deIfaceDecls$fMonoidDynamicEnv$fNFDataDynamicEnv$fNFDataLoadedModule$fMonoidLoadedModules$fNFDataLoadedModules$fNFDataCoreLint$fNFDataModuleEnvModuleMModuleT unModuleT roLoading ModuleWarningTypeCheckWarningsRenamerWarnings ModuleErrorModuleNotFound CantFindFile OtherIOErrorModuleParseErrorRecursiveModules RenamerErrors NoPatErrorsNoIncludeErrorsTypeCheckingFailed OtherFailureModuleNameMismatchDuplicateModuleName ImportSource FromModule FromImportimportedModulemoduleNotFound cantFindFile otherIOErrormoduleParseErrorrecursiveModules renamerErrors noPatErrorsnoIncludeErrorstypeCheckingFailedmoduleNameMismatchduplicateModuleNamewarntypeCheckWarningsrenamerWarningsemptyRO runModuleT runModuleM getModuleEnv setModuleEnvmodifyModuleEnv loadingImport loadingModule interactiveloadinggetImportSourcegetIface getNameSeeds getSupply setMonoBinds setNameSeeds setSupply unloadModule loadedModule modifyEvalEnv getEvalEnvgetFocusedModulesetFocusedModule getSearchPathwithPrependedSearchPath getFocusedEnvgetQualifiedEnv getDynEnv setDynEnv setSolvergetSolverConfig$fFreshMModuleT$fMonadTModuleT$fMonadModuleT$fApplicativeModuleT$fFunctorModuleT$fPPModuleWarning$fNFDataModuleWarning$fPPModuleError$fNFDataModuleError$fPPImportSource$fEqImportSource$fNFDataImportSourceTCActiontcActiontcLintertcPrimsTCLinter lintCheck lintModulenoPatloadModuleByPath loadImport loadModulefullyQualified importIface importIfaces moduleFile findModulefindFile addPreludeloadDeps getLocalEnv checkExpr checkDecls checkModule exprLinter declsLinter moduleLinter typecheck genInferInput ModuleRes ModuleCmdSpecMSpecT SpecCacherunSpecT liftSpecT getSpecCache setSpecCachemodifySpecCachemodify specializespecializeExprspecializeMatchwithDeclGroupsspecializeEWherespecializeDeclGroupsspecializeConstdestEProofApps destETApps destEProofAbs destETAbs freshNameinstantiateSchemainstantiateExpr allDeclGroupsallLoadedModulesallPublicNamesEnvFinTypeFTBitFTSeqFTTupleFTRecord ProverResult AllSatResult ThmResult EmptyResult ProverError ProverCommand pcQueryType pcProverName pcVerbose pcExtraDecls pcSmtFilepcExprpcSchema QueryTypeSatQuery ProveQuerySatNumAllSatSomeSat SatResult proverConfigs proverNames lookupProver satSMTResultsallSatSMTResults thmSMTResults proverErrorsatProvesatProveOffline protectStack parseValues parseValuenumTypefinType unFinType predArgTypes forallFinType existsFinTypeevalSel evalDeclGroupevalDecl copyBySchema copyByTypeevalComp branchEnvs evalMatch $fMonoidEnvSmoke Z3NotFound OptionDescroptName optDefaultoptCheckoptHelpoptEffEnvVal EnvStringEnvProgEnvNumEnvBool REPLException FileNotFoundDirectoryNotFound NoPatErrorNoIncludeErrorModuleSystemError EvalPolyErrorTypeNotTestableREPLunREPLlNamelPathrunREPLraisecatchrethrowEvalError getPrompt setLoadedMod getLoadedMod setSearchPathprependSearchPathshouldContinuestop unlessBatchasBatch disableLet enableLet getLetEnabledupdateREPLTitlesetUpdateREPLTitle setPutStr getPutStrrPutStr rPutStrLnrPrintgetVars getExprNames getTypeNamesgetPropertyNamesuniqifysetUser tryGetUsergetUser userOptions getUserSatNum whenDebug smokeTestQCModeQCRandom QCExhaust CommandBodyExprArg FileExprArgDeclsArg ExprTypeArg FilenameArg OptionArgShellArgNoArg CommandDescrcNamescBodycHelpCommand AmbiguousUnknown runCommandqcCmdsatCmdproveCmdonlineProveSatofflineProveSat moduleCmd loadPreludeloadCmd setOptionCmd handleCtrlC replParse replParseExprinteractiveConfig liftModuleCmdmoduleCmdResult replCheckExpr replEvalExprsanitize splitCommand findCommandfindCommandExact findNbCommand parseCommandhashbranchdirtybaseGHC.BaseNothingcatchIObindirlibdirdatadir libexecdir sysconfdir getBinDir getLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName CryptolPanicpanicLocpanicMsg$fExceptionCryptolPanic$fShowCryptolPanicmarkdownlatexBlockCodeCommentpreProc toCryptolmkTokenOpOtherVirtualExplicit splitQual dropWhite byteForCharPlusMinusMulExpEqualLEQGEQ ComplementHash AlexInputInpalexPosalexInputPrevCharinputLexSNormal InCommentInStringInCharAction startComment endComent addToCommentstartEndComment startString endString addToString startCharendChar addToChar mkQualIdentmkQualOpemitemitSnumToken fromDecDigit fromHexDigit alexGetByte isExplicit startsLayoutlayoutvirt $fPPToken$fNFDataTokenT$fNFDataTokenErr$fNFDataTokenSym$fNFDataTokenOp$fNFDataTokenKW$fNFDataTokenW$fNFDataTokenV $fNFDataTokenAlexAcc AlexAccNone AlexAccSkip AlexLastAccAlexNone AlexLastSkip AlexReturnAlexEOF AlexErrorAlexSkip AlexTokenAlexAddrAlexA# alex_base alex_table alex_check alex_deflt alex_accept stateToIntcommentstring alex_action_0 alex_action_1 alex_action_2 alex_action_3 alex_action_4 alex_action_5 alex_action_6 alex_action_7 alex_action_8 alex_action_9alex_action_10alex_action_11alex_action_12alex_action_13alex_action_14alex_action_15alex_action_16alex_action_17alex_action_18alex_action_19alex_action_20alex_action_21alex_action_22alex_action_23alex_action_24alex_action_25alex_action_26alex_action_27alex_action_28alex_action_29alex_action_30alex_action_31alex_action_32alex_action_33alex_action_34alex_action_35alex_action_36alex_action_37alex_action_38alex_action_39alex_action_40alex_action_41alex_action_42alex_action_43alex_action_44alex_action_45alex_action_46alex_action_47alex_action_48alex_action_49alex_action_50alex_action_51alex_action_52alex_action_53alex_action_54alex_action_55alex_action_56alex_action_57alex_action_58alex_action_59alex_action_60alex_action_61alex_action_62alex_action_63alex_action_64alex_action_65alex_action_66alex_action_67alex_action_68alex_action_69alex_action_70alex_action_71alex_action_72alex_action_73alex_action_74alex_action_75alex_action_76alexIndexInt16OffAddralexIndexInt32OffAddr quickIndexalexScan alexScanUser alex_scan_tkniUnbox$fFunctorAlexLastAcc nameVariant nameVariantsnUniquenInfonIdentnLocunSupply$fNFDataPrimMap$fNFDataSupply$fMonoidSupplyM$fBaseMSupplyMSupplyM$fRunMSupplyMa(->)$fMonadFixSupplyT$fRunMSupplyTa(->)$fBaseMSupplyTn$fMonadTSupplyT$fMonadSupplyT$fApplicativeSupplyT$fFunctorSupplyT$fFreshMSupplyT$fFreshMSupplyM$fFreshMStateT$fFreshMReaderT$fFreshMWriterT$fFreshMExceptionT $fPPNameName$fPPName $fNFDataName$fNFDataNameInfo $fOrdName$fEqName$fPPTFun $fNFDataTFunppLppNamedppFixityppPragmappNumLitwrapisEAppasEApps $fNoPosProp $fNoPosType $fNoPosTParam $fNoPosSchema$fNoPosPattern $fNoPosMatch$fNoPosTypeInst $fNoPosExpr $fNoPosTySyn $fNoPosPragma $fNoPosBind$fNoPosNewtype $fNoPosDecl$fNoPosTopLevel$fNoPosTopDecl $fNoPosModule$fNoPosProgram $fNoPosMaybe $fNoPos[] $fNoPosNamed$fNoPosLocated$fPPProp $fPPPattern $fPPSelector $fPPTypeInst $fPPLiteral $fPPBindDef$fPPBind $fPPPragma $fPPTopLevel$fPPImportSpec $fPPImport $fPPNewtype $fPPTopDecl $fPPProgram$fHasLocNewtype$fHasLocModule$fHasLocTopDecl$fHasLocTopLevel $fAddLocDecl $fHasLocDecl$fAddLocSchema$fHasLocSchema $fHasLocNamed $fHasLocMatch $fHasLocBind$fHasLocPattern$fAddLocPattern $fAddLocProp $fHasLocProp $fAddLocType $fHasLocType$fAddLocTParam$fHasLocTParam $fHasLocExpr $fAddLocExpr $fNFDataProp $fNFDataNamed$fNFDataPattern$fNFDataSelector$fNFDataTypeInst$fNFDataLiteral$fNFDataNumInfo$fMonoidExportSpec$fNFDataExportSpec$fNFDataTopLevel$fNFDataExportType$fNFDataPragma$fNFDataFixity$fNFDataBindDef $fNFDataBind$fNFDataImportSpec$fNFDataImport$fNFDataTopDeclGHC.Errerror$fBitWordSValSValifaceDeclsPrimMap$fNFDataIfaceDecl$fMonoidIfaceDecls$fNFDataIfaceDecls $fNFDataIfaceevalTF'cvtupdSub $fShowTypeMap$fTrieMapTypeMapType $fTrieMapMapa$fTrieMapList[]inLocalMRewMapRewMap'RMnewTopOrLocalNamerewErewMrewDrewDef rewDeclGroup splitTParams splitTAppnotFun$fTrieMapRewMap'(,,) checkTypeIsexprType exprSchema convertible checkDeclTcMwoProofObligationsroTVarsroAsmpsroVarsSametMonoisMonocheckDeclGroup checkMatchcheckArmrunTcM reportErrorwithTVarwithAsmpwithVarsproofObligation $fMonadTcM$fApplicativeTcM $fFunctorTcM $fSameTParam $fSameSchema $fSameType$fSame[]names $fHasVarsBool $fHasVarsProp $fHasVarsExpr$fApplicativeIfExpr'$fFunctorIfExpr'$fMonadIfExpr' apSubstAtompFalsepTruepNotpAndpOrpIfpAtompEqghc-prim GHC.Classes==pGeq>=pGtpInfeNoInfIAtomAFinAGtAEqppAtommkIfpIsNat _pIsGtThanNat _pNatIsGtThan pKnownFin pKnownInf balanceEq$fHasVarsIfExpr' crySimpStepcryRearrangeAndcryRearrangeOr cryIsDefn cryRearrangecryAndcryOr cryKnownFin GHC.TypesTrueFalsecryNotcryIsEqcryIsGtcryNatGtcryGtNatcryNoInfcryNatOp PropOrderingcmpAndcmpOrcryIsNatUpdatedJust mApSubstNL isNonLinOpnextName nonLinExprsnlKnownnlTodoNonLinM SubstOneRes trie_empty trie_insert trie_delete trie_lookuprunNL mApSubstOneNL nlImplied nonLinPropM nonLinExprMnameExpr finishTodos typeSelect desugarExprtoSubst checkUnsatgetCounterExample cryMustEqualK cryMustEqualVcryCheckLinRellinRel propToSmtLib exprToSmtLibListEnvZList evalNewtype zipListEnvleVarsleTypesPureZip evalNewtypesgetZList toListEnv bindVarList$fMonoidListEnv$fApplicativeZList$fFunctorZList annotTopDsannotDsannotDannotB checkSigstoSigtoPragmatoFixitytoDocserrorsNoPatMunMAnnotMap simpleBindsel splitSimplePnoPatEnoPatFunnoPatArmnoPatMnoMatchBnoMatchDnoPatDs noPatTopDs noPatProg noPatModule checkFixs checkDocsgetRange runNoPatM $fMonadNoPatM$fApplicativeNoPatM$fFunctorNoPatM$fRemovePatterns[]$fRemovePatternsModule$fRemovePatternsExpr$fRemovePatternsProgramsolvedsolveArithInst solveArithSeq solveCmpInst scopeNames scopeNonLinSscopeIntervals scopeAssertedVarInfosolverdeclaredSimpPropeliminateSimpleGEQscopeAssertSimpPropviEmptyviElemviInsertviAssertSimpPropviPushviPopviUnmarkedNames getNLSubst declareVarassertassertSimpPropprove getImpSubstScopecurScope otherScopesHasPropgetProp unSimpPropsimpProp scopeEmpty scopeElem scopeInsertscopeAssertNew scopeAssertviAssertsolPushsolPop$fDebugLogProp$fDebugLogSubst$fDebugLogGoal$fDebugLogType $fDebugLogDoc$fDebugLogMaybe $fDebugLog[]$fDebugLogChar $fHasPropGoal $fHasPropTypeIntinstantiateWithNamesinstantiateWithPosdoInst solveSelector recordType tupleTypelistTypeimproveSelector anonRecord mkPrimDeclmkDocParseMPunP parseStringparselexerP happyError errorMessage customError mkModNamemkSchemagetNamegetNumgetStrnumLitintValmkFixity mkTupleSel fromStrLitvalidDemotedTypemkEAppunOpbinOpeFromTo exprToNumT exportDecl exportNewtype changeExport mkTypeInstmkTParammkTySynpolyTermmkPoly mkPropertymkProp arithIdentfinIdentcmpIdent$fApplicativeParseM$fFunctorParseM $fMonadParseM$fPPParseError$fNFDataParseError HappyAddrHappyA#HappyStk Happy_IntList HappyConsHappyAny HappyAbsSyn happyIn15 happyOut15 happyIn16 happyOut16 happyIn17 happyOut17 happyIn18 happyOut18 happyIn19 happyOut19 happyIn20 happyOut20 happyIn21 happyOut21 happyIn22 happyOut22 happyIn23 happyOut23 happyIn24 happyOut24 happyIn25 happyOut25 happyIn26 happyOut26 happyIn27 happyOut27 happyIn28 happyOut28 happyIn29 happyOut29 happyIn30 happyOut30 happyIn31 happyOut31 happyIn32 happyOut32 happyIn33 happyOut33 happyIn34 happyOut34 happyIn35 happyOut35 happyIn36 happyOut36 happyIn37 happyOut37 happyIn38 happyOut38 happyIn39 happyOut39 happyIn40 happyOut40 happyIn41 happyOut41 happyIn42 happyOut42 happyIn43 happyOut43 happyIn44 happyOut44 happyIn45 happyOut45 happyIn46 happyOut46 happyIn47 happyOut47 happyIn48 happyOut48 happyIn49 happyOut49 happyIn50 happyOut50 happyIn51 happyOut51 happyIn52 happyOut52 happyIn53 happyOut53 happyIn54 happyOut54 happyIn55 happyOut55 happyIn56 happyOut56 happyIn57 happyOut57 happyIn58 happyOut58 happyIn59 happyOut59 happyIn60 happyOut60 happyIn61 happyOut61 happyIn62 happyOut62 happyIn63 happyOut63 happyIn64 happyOut64 happyIn65 happyOut65 happyIn66 happyOut66 happyIn67 happyOut67 happyIn68 happyOut68 happyIn69 happyOut69 happyIn70 happyOut70 happyIn71 happyOut71 happyIn72 happyOut72 happyIn73 happyOut73 happyIn74 happyOut74 happyIn75 happyOut75 happyIn76 happyOut76 happyIn77 happyOut77 happyIn78 happyOut78 happyIn79 happyOut79 happyIn80 happyOut80 happyIn81 happyOut81 happyIn82 happyOut82 happyIn83 happyOut83 happyIn84 happyOut84 happyIn85 happyOut85 happyIn86 happyOut86 happyIn87 happyOut87 happyIn88 happyOut88 happyIn89 happyOut89 happyIn90 happyOut90 happyIn91 happyOut91 happyIn92 happyOut92 happyIn93 happyOut93 happyIn94 happyOut94 happyIn95 happyOut95 happyInTok happyOutTokhappyActOffsetshappyGotoOffsetshappyDefActions happyCheck happyTablehappyReduceArr happy_n_termshappy_n_nontermshappyReduce_12happyReduction_12happyReduce_13happyReduction_13happyReduce_14happyReduction_14happyReduce_15happyReduction_15happyReduce_16happyReduction_16happyReduce_17happyReduction_17happyReduce_18happyReduction_18happyReduce_19happyReduction_19happyReduce_20happyReduction_20happyReduce_21happyReduction_21happyReduce_22happyReduction_22happyReduce_23happyReduction_23happyReduce_24happyReduction_24happyReduce_25happyReduction_25happyReduce_26happyReduction_26happyReduce_27happyReduction_27happyReduce_28happyReduction_28happyReduce_29happyReduction_29happyReduce_30happyReduction_30happyReduce_31happyReduction_31happyReduce_32happyReduction_32happyReduce_33happyReduction_33happyReduce_34happyReduction_34happyReduce_35happyReduction_35happyReduce_36happyReduction_36happyReduce_37happyReduction_37happyReduce_38happyReduction_38happyReduce_39happyReduction_39happyReduce_40happyReduction_40happyReduce_41happyReduction_41happyReduce_42happyReduction_42happyReduce_43happyReduction_43happyReduce_44happyReduction_44happyReduce_45happyReduction_45happyReduce_46happyReduction_46happyReduce_47happyReduction_47happyReduce_48happyReduction_48happyReduce_49happyReduction_49happyReduce_50happyReduction_50happyReduce_51happyReduction_51happyReduce_52happyReduction_52happyReduce_53happyReduction_53happyReduce_54happyReduction_54happyReduce_55happyReduction_55happyReduce_56happyReduction_56happyReduce_57happyReduction_57happyReduce_58happyReduction_58happyReduce_59happyReduction_59happyReduce_60happyReduction_60happyReduce_61happyReduction_61happyReduce_62happyReduction_62happyReduce_63happyReduction_63happyReduce_64happyReduction_64happyReduce_65happyReduction_65happyReduce_66happyReduction_66happyReduce_67happyReduction_67happyReduce_68happyReduction_68happyReduce_69happyReduction_69happyReduce_70happyReduction_70happyReduce_71happyReduction_71happyReduce_72happyReduction_72happyReduce_73happyReduction_73happyReduce_74happyReduction_74happyReduce_75happyReduction_75happyReduce_76happyReduction_76happyReduce_77happyReduction_77happyReduce_78happyReduction_78happyReduce_79happyReduction_79happyReduce_80happyReduction_80happyReduce_81happyReduction_81happyReduce_82happyReduction_82happyReduce_83happyReduction_83happyReduce_84happyReduction_84happyReduce_85happyReduction_85happyReduce_86happyReduction_86happyReduce_87happyReduction_87happyReduce_88happyReduction_88happyReduce_89happyReduction_89happyReduce_90happyReduction_90happyReduce_91happyReduction_91happyReduce_92happyReduction_92happyReduce_93happyReduction_93happyReduce_94happyReduction_94happyReduce_95happyReduction_95happyReduce_96happyReduction_96happyReduce_97happyReduction_97happyReduce_98happyReduction_98happyReduce_99happyReduction_99happyReduce_100happyReduction_100happyReduce_101happyReduction_101happyReduce_102happyReduction_102happyReduce_103happyReduction_103happyReduce_104happyReduction_104happyReduce_105happyReduction_105happyReduce_106happyReduction_106happyReduce_107happyReduction_107happyReduce_108happyReduction_108happyReduce_109happyReduction_109happyReduce_110happyReduction_110happyReduce_111happyReduction_111happyReduce_112happyReduction_112happyReduce_113happyReduction_113happyReduce_114happyReduction_114happyReduce_115happyReduction_115happyReduce_116happyReduction_116happyReduce_117happyReduction_117happyReduce_118happyReduction_118happyReduce_119happyReduction_119happyReduce_120happyReduction_120happyReduce_121happyReduction_121happyReduce_122happyReduction_122happyReduce_123happyReduction_123happyReduce_124happyReduction_124happyReduce_125happyReduction_125happyReduce_126happyReduction_126happyReduce_127happyReduction_127happyReduce_128happyReduction_128happyReduce_129happyReduction_129happyReduce_130happyReduction_130happyReduce_131happyReduction_131happyReduce_132happyReduction_132happyReduce_133happyReduction_133happyReduce_134happyReduction_134happyReduce_135happyReduction_135happyReduce_136happyReduction_136happyReduce_137happyReduction_137happyReduce_138happyReduction_138happyReduce_139happyReduction_139happyReduce_140happyReduction_140happyReduce_141happyReduction_141happyReduce_142happyReduction_142happyReduce_143happyReduction_143happyReduce_144happyReduction_144happyReduce_145happyReduction_145happyReduce_146happyReduction_146happyReduce_147happyReduction_147happyReduce_148happyReduction_148happyReduce_149happyReduction_149happyReduce_150happyReduction_150happyReduce_151happyReduction_151happyReduce_152happyReduction_152happyReduce_153happyReduction_153happyReduce_154happyReduction_154happyReduce_155happyReduction_155happyReduce_156happyReduction_156happyReduce_157happyReduction_157happyReduce_158happyReduction_158happyReduce_159happyReduction_159happyReduce_160happyReduction_160happyReduce_161happyReduction_161happyReduce_162happyReduction_162happyReduce_163happyReduction_163happyReduce_164happyReduction_164happyReduce_165happyReduction_165happyReduce_166happyReduction_166happyReduce_167happyReduction_167happyReduce_168happyReduction_168happyReduce_169happyReduction_169happyReduce_170happyReduction_170happyReduce_171happyReduction_171happyReduce_172happyReduction_172happyReduce_173happyReduction_173happyReduce_174happyReduction_174happyReduce_175happyReduction_175happyReduce_176happyReduction_176happyReduce_177happyReduction_177happyReduce_178happyReduction_178happyReduce_179happyReduction_179happyReduce_180happyReduction_180happyReduce_181happyReduction_181happyReduce_182happyReduction_182happyReduce_183happyReduction_183happyReduce_184happyReduction_184happyReduce_185happyReduction_185happyReduce_186happyReduction_186happyReduce_187happyReduction_187happyReduce_188happyReduction_188happyReduce_189happyReduction_189happyReduce_190happyReduction_190happyReduce_191happyReduction_191happyReduce_192happyReduction_192happyReduce_193happyReduction_193happyReduce_194happyReduction_194happyReduce_195happyReduction_195happyReduce_196happyReduction_196happyReduce_197happyReduction_197happyReduce_198happyReduction_198happyReduce_199happyReduction_199happyReduce_200happyReduction_200happyReduce_201happyReduction_201happyReduce_202happyReduction_202happyReduce_203happyReduction_203happyReduce_204happyReduction_204happyReduce_205happyReduction_205happyReduce_206happyReduction_206happyReduce_207happyReduction_207happyReduce_208happyReduction_208happyReduce_209happyReduction_209happyReduce_210happyReduction_210happyReduce_211happyReduction_211happyReduce_212happyReduction_212happyReduce_213happyReduction_213happyReduce_214happyReduction_214happyReduce_215happyReduction_215happyReduce_216happyReduction_216happyReduce_217happyReduction_217happyReduce_218happyReduction_218happyReduce_219happyReduction_219happyReduce_220happyReduction_220happyReduce_221happyReduction_221happyReduce_222happyReduction_222happyReduce_223happyReduction_223happyReduce_224happyReduction_224happyReduce_225happyReduction_225happyReduce_226happyReduction_226happyReduce_227happyReduction_227happyReduce_228happyReduction_228happyReduce_229happyReduction_229happyReduce_230happyReduction_230happyReduce_231happyReduction_231happyReduce_232happyReduction_232happyReduce_233happyReduction_233happyReduce_234happyReduction_234happyReduce_235happyReduction_235happyReduce_236happyReduction_236happyReduce_237happyReduction_237happyReduce_238happyReduction_238happyReduce_239happyReduction_239happyReduce_240happyReduction_240happyReduce_241happyReduction_241happyReduce_242happyReduction_242happyReduce_243happyReduction_243happyReduce_244happyReduction_244happyReduce_245happyReduction_245happyReduce_246happyReduction_246 happyNewToken happyError_ happyThen happyReturn happyThen1 happyReturn1 happyError'vmoduleprogram programLayoutexprdecldecls declsLayoutletDeclreplschemamodNamehelpNamehappySeqaddImplicitIncludes happyParse happyAccept happyDoActionindexShortOffAddr happyShifthappySpecReduce_0happySpecReduce_1happySpecReduce_2happySpecReduce_3 happyReducehappyMonadReducehappyMonad2Reduce happyDrop happyDropStk happyGoto happyFail notHappyAtAll happyTcHack happyDoSeq happyDontSeqenvSeen envIncPath getIncPath withIncPathNoIncM fromIncPath includeFailedpushPath failsWith collectErrorsData.TraversablemapMnoIncludeModulenoIncludeProgram noIncTopDeclresolveInclude readInclude makeAbsolute runNoIncM tryNoIncM $fMonadNoIncM$fApplicativeNoIncM$fFunctorNoIncM$fNFDataIncludeErrorCheckAll CheckOverlap CheckNonegetNS shadowNames'checkEnvcontainsOverlap typeExists mkFakeName renameSchema lookupFixityTOp renameMatch renamePats $fRenameBind $fRenameType$fRenameSchemaEnvCheck unRenameMOut oWarningsoErrorsroLocroModroNamesroDisprecordcurLoclocatedwithLoc shadowNamesNSsupply rnLocated translatePropresolveTypeFixity infixPropsmkTInfixmkEInfixrenameOp renameArm patternEnvrnNamed $fRenameTySyn $fRenameMatch$fRenameTypeInst $fRenameExpr$fRenamePattern$fRenameBindDef $fRenameProp$fRenameTParam$fRenameNewtype $fRenameDecl$fRenameTopDecl$fMonadRenameM$fApplicativeRenameM$fFunctorRenameM$fMonoidRenameM $fMonoidOut$fPPRenamerWarning$fNFDataRenamerWarning$fPPRenamerError$fNFDataRenamerErrorrank tryRewriteEqallFin rewriteLHSimportSplitImps importImps tryGetModelproveImplicationIO simpGoals'simplifyConstraintTermssolveConstraints solveNumericscomputeImprovements improveByDefnimportSideConds_testSimpGoalstySynappTy doCheckType checkTyThing checkProp checkKindwritePreludeContentspreludeContentsUserEnv defaultRWmkPrompt mkUserEnv checkBase SmokeTest OptionMap eLoadedMod eContinueeIsBatch eModuleEnveUserEnvePutStr eLetEnabled eUpdateTitlegetRWmodifyRW modifyRW_ splitOptArgs mkOptionMap simpleOptcheckInfLength checkProverproverListString checkSatNumz3exists $fPPSmoke$fPPREPLException$fExceptionREPLException $fFreshMREPL$fMonadBaseControlIOREPL$fMonadBaseIOREPL $fMonadIOREPL $fMonadREPL$fApplicativeREPL $fFunctorREPLcommands nbCommands nbCommandList cmdProveSatmkSolverResultreplCheckDeclsbindItVariablebindItVariables sanitizeEnduncons CommandMap commandListgenHelp getPPValOptsevalCmdrIdent specializeCmd typeOfCmd readFileCmd writeFileCmd reloadCmdeditCmdquitCmd browseCmd browseTSynsbrowseNewtypes browseVarshelpCmd runShellCmdcdCmd isNamePrefixreplParseInput replSpecExpritIdent replWriteFile replReadFile replEvalDeclreplEdittrim$fOrdCommandDescr$fEqCommandDescr$fShowCommandDescr