!  9      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~             !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                             !!""""""#############################################$$$$$$$$$ $ $ $ $ $$$$$$$$$$$$$$$$$$$ $!$"$#$$$%$&$'$($)$*$+$,$-$.$/$0$1$2$3$4$5$6$7$8%9%:%;%<%=%>%?%@%A%B%C%D%E%F%G%H%I%J%K%L%M%N%O%P%Q%R%S%T%U%V%W%X%Y%Z%[%\%]%^%_%`%a%b%c%d%e%f%g%h%i%j%k%l%m%n%o%p%q&r&s&t&u&v&w&x&y&z&{&|&}&~&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&'''''''''''''''''''''((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ((((((((((((((((((( (!("(#($(%(&('((()(*(+(,(-(.(/(0(1(2(3)4)5)6)7)8)9):);)<)=)>)?)@)A)B)C)D)E)F)G)H)I)J)K)L)M*N*O*P*Q*R*S*T*U*V*W*X*Y*Z*[*\*]*^*_*`*a*b+c+d+e+f+g+h+i+j+k+l+m+n+o+p+q,r,s,t,u,v,w-x-y-z-{-|-}-~--------------------....................................////////////////////000011111111222222222222233333333333333333333333333333333333333 3 3 3 3 3333333333333333333 3!3"3#3$3%3&3'3(3)3*3+3,3-3.3/303132333435363738393:3;3<3=3>3?3@3A3B4C4D4E4F4G4H4I4J4K4L4M4N4O4P4Q4R4S4T4U4V4W4X4Y4Z4[4\4]4^4_4`4a4b4c4d4e4f4g4h4i4j4k5l5m5n6o6p7q7r7s7t7u7v7w7x7y7z7{7|7}7~7777777777777777888888888888888899:::::::::::::::::::;;;;<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< < < < < < < < < < < < < < = = = = = = = = = = = = = = = = = = = = != "= #= $> %> &> '> (> )> *> +> ,> -> .> /> 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? {? |? }? ~? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? @ A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A B C C C C C C C C C !C "C #C $C %C &C 'C (C )C *C +C ,D -D .D /E 0E 1E 2E 3E 4E 5E 6E 7F 8F 9F :F ;F <F =F >G ?G @G AG BH CI DI EI FI GI HI IJ JJ KJ LJ MJ NJ OJ PJ QJ RJ SJ TJ UJ VJ WJ XJ YJ ZJ [J \J ]J ^J _J `J aJ bJ cJ dJ eJ fJ gJ hJ iJ jJ kJ lJ mJ nJ oJ pJ qJ rJ sJ tJ uJ vJ wJ xJ yJ zJ {J |J }J ~J J J J J J K K K K K " " " " " " " " " " " " " " " " " L L L L L L L L L L L L 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 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 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 M M M M M M M M M M M M M M M M M M M M N N N N N N N N N N N N N N N N !N "N #N $N %N &N 'N (N )N *N +N ,N -N .N /N 0N 1N 2N 3N 4N 5N 6N 7O 8O 9O :O ;O <O =O >O ?O @O AO BO CO DP EP FP GP HP IP JP KP LP MP NP OP PP QP RP SP TP UP VP WP XP YP ZP [P \P ]P ^P _Q `Q aQ bQ cQ dQ eQ fQ gQ hQ iQ jQ kQ lQ mQ nQ oQ pQ qQ rQ sQ tQ uQ vQ wQ xQ yQ zQ {Q |Q }Q ~Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R S S S S S S S S S S S S S T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T !T "T #T $T %T &T 'T (T )T *T +T ,T -T .T /T 0T 1T 2T 3T 4T 5T 6T 7T 8TY(c) 2014-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe}cryptolvThis 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.U(c) 2015-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafev 9cryptol[Write the contents of the Prelude to a temporary file so that Cryptol can load the module. 9 :(c) 2015-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe6cryptolIdentifiers, 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.cryptolModule names are just text. cryptolConvert a parameterized module's name to the name of the module containing the same definitions but with explicit parameters on each definition.   SafeY $cryptol:A logger provides simple abstraction for sending messages.%cryptol!Send the given string to the log.&cryptol0Send the given string with a newline at the end.'cryptolSend the given value using its  ;& instance. Adds a newline at the end.(cryptol#A logger that ignores all messages.)cryptolLog to the given handle.*cryptolLog to stdout.+cryptolLog to stderr.,cryptol#Just use this function for logging. $%&'()*+, $*+)(,%&'(c) 2014-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe<.cryptol:Apply a function to all elements of a container. Returns  < if nothing changed, and Just container otherwise./cryptol5Apply functions to both elements of a pair. Returns  < if neither changed, and  Just pair otherwise.././(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe68ҁ0cryptol3Information about an infix expression of some sort.2cryptoloperator3cryptol left argument4cryptolright argumrnt5cryptoloperator precedence6cryptoloperator associativity7cryptol Information about associativity.<cryptol&Fixity information for infix operators=cryptolPrint a name in prefix: f a b or (+) a b)>cryptol#Print a name as an infix operator: a + bGcryptol*How to display names, inspired by the GHC  Outputable module. Getting a value of  < from the NameDisp function indicates that the display has no opinion on how this name should be displayed, and some other display should be tried out. Jcryptol%Never qualify names from this module.NcryptolMCompose two naming environments, preferring names from the left environment.Ocryptol Get the format for a name. When  <2 is returned, the name is not currently in scope.Pcryptol1Produce a document in the context of the current G.Qcryptol5Fix the way that names are displayed inside of a doc.Xcryptol.Pretty print an infix expression of some sort.Ycryptol2Display a numeric values as an ordinar (e.g., 2nd)Zcryptol9The suffix to use when displaying a number as an oridinalXcryptol1Non-infix leaves are printed with this precedencecryptol+pattern to check if sub-thing is also infixcryptol"Pretty print this infix expressionE01654327:98;>=<?@ABCFEDGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstEGHICFEDJKLMNOPQABRS?@;>=<TUV7:980165432WXYZ[\]^_`abcdefghijklmnopqrst_6`6a5(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableNone)(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe;<=ܣcryptolzThis packages together a type with some names to be used to display the variables. It is used for pretty printing types. =cryptol*Compute the n-th variant of a name (e.g., a5). >cryptol Compute all variants of a name: a, a1, a2, a3, ...cryptol@Expand a list of base names into an infinite list of variations.M0123456789:;<=>?@ABCDEFGIHJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrst (c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe688cryptolSelectors 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.cryptolUZero-based tuple selection. Optionally specifies the shape of the tuple (one-based).cryptol@Record selection. Optionally specifies the shape of the record.cryptol=List selection. Optionally specifies the length of the list.cryptol3Display the thing selected by the selector, nicely. (c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe"#68cryptolAn empty range.[Caution: using this on the LHS of a use of rComb will cause the empty source to propagate. (c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe68~cryptol&The fixity used when none is provided. (c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportable TrustworthyA (c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe68Ucryptol(Natural numbers with an infinity elementcryptol&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 * bcryptol&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) ^ ncryptolnSub x y = Just z iff z is the unique value such that Add y z = Just x. cryptol 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.cryptolnCeilDiv msgLen blockSize computes the least n such that msgLen <= blockSize * n. It is undefined when  blockSize = 0\. It is also undefined when either input is infinite; perhaps this could be relaxed later.cryptolnCeilMod msgLen blockSize computes the least k such that  blockSize divides  msgLen + k. It is undefined when  blockSize = 0\. It is also undefined when either input is infinite; perhaps this could be relaxed later.cryptol Rounds up.  lg2 x = y, iff y" is the smallest number such that  x <= 2 ^ ycryptolnWidth nL is number of bits needed to represent all numbers from 0 to n, inclusive. nWidth x = nLg2 (x + 1).cryptollength ([ 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. cryptol length [ x, y .. z ]cryptolCompute 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.cryptolCCompute the number of bits required to represent the given integer.cryptolgCompute the exact root of a natural number. The second argument specifies which root we are computing.cryptolCompute 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) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe;cryptolKMaps string names to values, allowing for partial key matches and querying.cryptol)Insert a value into the Trie. Will call * if a value already exists with that key.cryptol)Return all matches with the given prefix.cryptol^Given a key, return either an exact match for that key, or all matches with the given prefix.cryptol%Return all of the values from a Trie.(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe  ?cryptolThe preprocessor for  ? @cryptolThe preprocessor for  @      (c) 2015-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe6& cryptol%Passes that can generate fresh names.cryptol#Names that originate in the parser.cryptolUnqualified names like x, Foo, or +.cryptolQualified names like Foo::bar or  module::!.cryptol Fresh names generated by a pass.      V(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe689%cryptolvalue, base, number of digits&cryptolcharacter literal'cryptol(qualified) identifier(cryptolstring literal)cryptolkeyword*cryptoloperator+cryptolsymbol,cryptolvirtual token (for layout)-cryptolwhite space token.cryptol error token Acryptol>The named operators are a special case for parsing types, and  B8 is used for all other cases that lexed as an operator.rcryptol.Virtual tokens, inserted by layout processing. CcryptolVirtual layout block Dcryptol7An explicit layout block, expecting this ending token.cryptolFile that we are working oncryptolSettings for layout processingcryptolPreprocessor settingscryptolImplicit includescryptol^When we do layout processing should we add a vCurly (i.e., are we parsing a list of things). Ecryptol=Split out the prefix and name part of an identifier/operator. Fcryptol'Drop white-space tokens from the input. GcryptoleCollapse 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.x$,+)&(-*./'%06321547MLKDCBA@?=<;:98>HGJIFE A H I J K L M N O B P Q RNljihgfedcb`_^]\ZYXWVUTRQPO[kSamonqprustvwyx S D Cz|{ T U V W X Y Z [ \ ] ^}~ _ ` a b c d e f g h i j k l m E n o p F q r s t G(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportable TrustworthyDBTcryptolReturns 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.cryptoloReturns the tokens and the last position of the input that we processed. The tokens include whte space tokens.g$%'/.*-(&)+,04512367EFIJGH>89:;<=?@ABCDKLMNaSk[OPQRTUVWXYZ\]^_`bcdefghijlmpqnortsuvwxyz{|}~gz{|vwxy$%'/.*-(&)+,rtsuNaSk[OPQRTUVWXYZ\]^_`bcdefghijl04512367EFIJGH>89:;<=?@ABCDKLMmpqno}~(c) 2015-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportable Trustworthy "#68;=>?Ka(cryptolEA mapping from an identifier defined in some module to its real name.cryptol)A monad for easing the use of the supply. ucryptolINVARIANT: this field uniquely identifies a name for one session with the Cryptol library. Names are unique to their binding site. vcryptol*Information about the origin of this name. wcryptolThe name of the identifier xcryptol?The associativity and precedence level of infix operators.  <* indicates an ordinary prefix operator. ycryptolWhere this name was definedcryptol/Information about the binding site of the name.cryptol2This name refers to a declaration from this modulecryptol+This name is a parameter (function or type)cryptolCompare two names lexically.cryptol5Compare two names by the way they would be displayed. zcryptolFigure 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.cryptol9Pretty-print a name with its source location information.cryptol)Retrieve the next unique from the supply.cryptolThis 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).cryptol"Make a new name for a declaration.cryptolMake a new parameter name.cryptolvIt's assumed that we're looking things up that we know already exist, so this will panic if it doesn't find the name.cryptolvIt's assumed that we're looking things up that we know already exist, so this will panic if it doesn't find the name.##Safe68~i3cryptolZBuilt-in type functions. If you add additional user-visible constructors, please update primTys in Cryptol.Prims.Types.cryptol  : Num -> Num -> Numcryptol  : Num -> Num -> Numcryptol  : Num -> Num -> Numcryptol  : Num -> Num -> Numcryptol  : Num -> Num -> Numcryptol  : Num -> Num -> Numcryptol  : Num -> Numcryptol  : Num -> Num -> Numcryptol  : Num -> Num -> Numcryptol  : Num -> Num -> Numcryptol  : Num -> Num -> Numcryptol : Num -> Num -> Num -> Num Example: ([ 1, 5 .. ] :: [lengthFromThen 1 5 b][b]cryptol : Num -> Num -> Num -> Num Example: ,[ 1, 5 .. 9 ] :: [lengthFromThenTo 1 5 9][b]cryptolO1-1 constants. If you add additional user-visible constructors, please update primTys.cryptolNumberscryptolInfcryptolBitcryptolIntegercryptol Z _cryptol [_] _cryptol _ -> _cryptol  (_, _, _)cryptoluser-defined, TcryptolSPredicate symbols. If you add additional user-visible constructors, please update primTys.cryptol _ == _cryptol _ /= _cryptol _ >= _cryptol fin _cryptolHas sel type field does not appear in schemascryptol Zero _cryptol Logic _cryptol Arith _cryptol Cmp _cryptol  SignedCmp _cryptol  Literal _ _cryptol/This is useful when simplifying things in placecryptolDittocryptolType constants.cryptolKinds, classify types.cryptol/Information about a user visible built-in type.cryptolUse this ty-con (renamer)cryptolThis is what it's calledcryptol DocumentationcryptolPrecedence, for infix onescryptol9This list should contain all user-visible built-in types. cryptol/Construct an index for quick lookup of primtys. cryptol$Lookup a prim type by a parser name. cryptol"Lookup if a ty con is a primitive. cryptol Lookup a  prim type. cryptol Lookup a  prim type.C     C     5Safe"#68;<=(#Ecryptol;The type is "simple" (i.e., it contains no type functions).Fcryptol Named recordsMcryptol Type synonym.OcryptolNamePcryptol ParametersQcryptolEnsure body is OKRcryptol DefinitionScryptol DocumentationTcryptol#The type is supposed to be of kind VcryptolName of module parameterWcryptolA variable in a signaturefcryptolSource code that gave risegcryptol DescriptionhcryptolType variables.icryptolzUnique, kind, ids of bound type variables that are in scope The last field gives us some infor for nicer warnings/errors.kcryptolLThe internal representation of types. These are assumed to be kind correct.lcryptolType constant with argsmcryptolType variable (free or bound)ncryptolThis 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. ocryptol Record typescryptolType parameters.ucryptolParameter identifiervcryptolKind of parameterwcryptol#What sort of type parameter is thisxcryptol"A description for better messages.ycryptol The types of polymorphic values.cryptol7Get the names of something that is related to the tvar.cryptolESplit up repeated occurances of the given binary type-level function.cryptolMake a function type.cryptol"Eliminate outermost type synonyms.cryptolMake a malformed numeric type.cryptolEquality for numeric types.cryptol+Make a greater-than-or-equal-to constraint.cryptolA Has1 constraint, used for tuple and record selection.cryptolMake a malformed property.     CDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijkmlnopqrstuvwxyz{|}~ژCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijkmlnopqrstuvwxyz{|}~544(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe"#34568ޠmcryptol  fin xcryptol  x == 10cryptol  x != 10cryptol  x >= 10cryptol  Zero acryptol  Logic acryptol  Arith acryptol  Cmp a cryptol  SignedCmp a!cryptol  Literal val a"cryptolConstraint synonym#cryptolLocation information$cryptol After parsing&cryptol  [8] -> [8]'cryptol [8] a(cryptol Bit)cryptol 10*cryptol a+cryptolA type variable or synonym,cryptol2 + xD Note that the parser never produces these; instead it produces a TUser value. The TApp is introduced by the renamer when it spots built-in functions. XXX: We should just add primitive declarations for the built-in type functions, and simplify all this.-cryptol { x : [8], y : [32] }.cryptol  ([8], [32])/cryptol_, just some type.0cryptolLocation information1cryptol  (ty)2cryptol  ty + tyCcryptol  xDcryptol  _Ecryptol  (x,y,z)Fcryptol  { x = (a,b,c), y = z }Gcryptol  [ x, y, z ]Hcryptol  x : [8]Icryptol  (x # y)JcryptolLocation informationLcryptolp <- eRcryptol  xScryptol  0x10Tcryptol  -1Ucryptol  ~1Vcryptol  (1,2,3)Wcryptol  { x = 1, y = 2 }Xcryptol  e.lYcryptol  [1,2,3]Zcryptol [1, 5 .. 117 ][cryptol  [1, 3 ...]\cryptol  [ 1 | x <- xs ]]cryptol  f x^cryptol  f `{x = 8}, f`{8}_cryptol  if ok then e1 else e2`cryptol  1 + x where { x = 2 }acryptol  1 : [8]bcryptol `(x + 1), x is a typeccryptol  \x y -> xdcryptolposition annotationecryptol (e)  (Removed by Fixity)fcryptol a + b  (Removed by Fixity)gcryptol Literals.hcryptol0x10 (HexLit 2)icryptol "hello"jcryptol;Infromation about the representation of a numeric constant.kcryptoln-digit binary literallcryptoln-digit octal literalmcryptoloverloaded decimal literalncryptoln-digit hex literalocryptolcharacter literalpcryptolpolynomial literalqcryptolA top-level module declaration.vcryptol%Export information for a declaration.ycryptol:Input at the REPL, which can either be an expression or a let statement.~cryptol Type namecryptol Type paramscryptol ConstructorcryptolBindings. 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.cryptol Defined thingcryptol Parameterscryptol DefinitioncryptolOptional type sigcryptolInfix operator?cryptolOptional fixity infocryptolOptional pragmascryptolIs this a monomorphic bindingcryptolOptional doc stringcryptol&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 % constructors should not be present.cryptolAn import declaration.cryptolA value parametercryptolname of value parametercryptolschema for parametercryptoloptional documentationcryptolinfo for infix usecryptolA type parametercryptolname of type parametercryptolkind of parametercryptoloptional documentationcryptolinfo for infix usecryptolnumber of the parametercryptol@newtype T as = tcryptol  include Filecryptol parameter type T : #cryptol !parameter type constraint (fin T)cryptol parameter someVal : [256]cryptolA parsed module.cryptolName of the modulecryptol8Functor to instantiate (if this is a functor instnaces)cryptolImports for the modulecryptolDeclartions for the modulecryptol#A string with location information.cryptol(An identifier with location information.cryptol!A name with location information.cryptolConversational3 printing of kinds (e.g., to use in error messages)789:  $ !"#%&+'()*,-./012346578:9;<=>?A@BCDEFGHIJKLMNOPQ]RSTUVWXYZ[\^_`abcdefghijklmnopqrstuvxwyz{|}~>?A@  789:<=346578:9;%&+'()*,-./012$ !"#vxwqrstu|}~yz{Q]RSTUVWXYZ[\^_`abcdefghijklmnopKLMBCDEFGHIJNOP(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafecryptolThe names defined by a newtype.cryptolIThe names defined and used by a group of mutually recursive declarations.cryptol4The names defined and used by a single declarations.cryptolThe 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.cryptol/The names defined and used by a single binding.cryptol The names used by an expression.cryptol)The names defined by a group of patterns.cryptolHThe names defined by a pattern. These will always be unqualified names.cryptol&The names defined and used by a match.cryptol<The names defined and used by an arm of alist comprehension.cryptol;Remove some defined variables from a set of free variables.cryptol]Given the set of type variables that are in scope, compute the type synonyms used by a type.cryptolhGiven the set of type variables that are in scope, compute the type/constraint synonyms used by a prop.cryptolNThe type names defined and used by a group of mutually recursive declarations.cryptol8The type names defined and used by a single declaration.cryptol(The type names used by a single binding.cryptol%The type names used by an expression.cryptol!The type names used by a pattern.cryptolThe type names used by a match.cryptol%The type names used by a type schema.cryptolThe type names used by a prop.cryptol8Compute the type synonyms/type variables used by a type.(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe"#68;= cryptol$Eliminate all patterns in a program. {cryptolGiven a pattern, transform it into a simple pattern and a set of bindings. Simple patterns may only contain variables and type annotations. |cryptol/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. }cryptolGAdd annotations, keeping track of which annotation are not yet used up. ~cryptolAdd annotations, keeping track of which annotation are not yet used up. The exception indicates which declarations are no longer needed. cryptol.Add pragma/signature annotations to a binding. cryptolCheck for multiple signatures. cryptol.Does this declaration provide some signatures? cryptol.Does this declaration provide some signatures? cryptol1Does this declaration provide fixity information? cryptol?Does this top-level declaration provide a documentation string? cryptol5Pick a new name, to be used when desugaring patterns. cryptolRecord an error.  Safe6Ecryptol@Add a binding name to the export list, if it should be exported.cryptolEAdd a type synonym name to the export list, if it should be exported.cryptol&Check to see if a binding is exported.cryptol+Check to see if a type synonym is exported.  (c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe"#68;<=5cryptolMutually recursive declarationscryptolNon-recursive declarationcryptolLType arguments are the length and element type of the sequence expressioncryptol"List value (with type of elements)cryptol Tuple valuecryptol Record valuecryptolElimination for tuplerecordlistcryptol If-then-elsecryptolZList comprehensions The types cache the length of the sequence and its element type.cryptolUse of a bound variablecryptolFunction ValuecryptolType applicationcryptolFunction applicationcryptolFunction valuecryptolProof 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 k0 term, which should be of kind .cryptolRIf `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.cryptolA value parameter of a module.cryptolA type parameter of a module.cryptolThe number of the parameter in the module This is used when we move parameters from the module level to individual declarations (type synonyms in particular)cryptolA Cryptol module.cryptol7This is just the type-level type synonyms of a module.cryptolIs this a parameterized module? cryptolNConstruct a primitive, given a map to the unique names of the Cryptol module. cryptolMake an expression that is  % pre-applied to a type and a message.cryptolDeconstruct an expression, typically polymorphic, into the types and proofs to which it is applied. Since we don't store the proofs, we just return the number of proof applications. The first type is the one closest to the expr.C     CDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijkmlnopqrstuvwxyz{|}~vxw     y     vxw(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe3;=>?A>N89;:<=>?A@BCEFDGHIJKLMNO89;:<=BCEFDGHIKLJMNO>?A@(c) 2015-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafeIk Xcryptollower bound (inclusive)YcryptolQupper bound (inclusive) If there is no upper bound, than all *natural* numbers.^cryptol!Only meaningful for numeric typesbcryptol1What we learn about variables from a single prop.gcryptolFinite positive number.  [1 .. inf).hcryptolReturns  , when the intervals definitely overlap, and   otherwise.icryptolIntersect two intervals, yielding a new one that describes the space where they overlap. If the two intervals are disjoint, the result will be  <.jcryptol Any valuekcryptolAny finite valuelcryptolExactly this value"VWXYZ]\[^_`abcdefghijklmnopqrstuvw"^_Z]\[`abVWXYcdefghijklmnopqrstuvwSafeL|cryptolSolved, assuming the sub-goals.}cryptolWe could not solve the goal.~cryptolThe goal can never be solved. {~}| {~}|(c) 2015-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafeN(c) 2013-2017 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe"#68;<=O(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe;<=>?UcryptoltNote that this assumes that this pass will be run only once for each module, otherwise we will get name collisions. cryptolProduce a fresh top-level name. cryptolmNot really any distinction between global and local, all names get the module prefix added, and a unique id.SafeY cryptolKSet of top-level names which need to be instantiate, and module parameters. cryptolhAdjust uses of names to account for the new parameters. Assumes unique names---no capture or shadowing. cryptol0Extra parameters to dd when instantiating a type Safe_fcryptolUndefined value namescryptol#Undefined type names (from newtype)cryptol'Undefined type params (e.d. mod params)cryptol9Compute the transitive closure of the given dependencies.cryptolDependencies of top-level declarations in a module. These are dependencies on module parameters or things defined outside the module.  !(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafea W(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe68p cryptol=Keep track of the type parameters as they appear in the input cryptolWWARNING: This is a bit of a hack. It is used to represent anonymous type applications. cryptolGenerate 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. cryptolFix-up the documentation strings by removing the comment delimiters on each end, and stripping out common prefixes on all the remaining lines. cryptolMake an ordinary module cryptol'Make an unnamed module---gets the name Main. cryptol/Make a module which defines a functor instance.A   #(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe"#68{cryptol Name of thingcryptolTypecryptolPragmascryptolIs this an infix thingcryptolFixity informationcryptol DocumentationcryptolConstraints on param. typescryptolHThe resulting interface generated by a module that has been typechecked.cryptol Module namecryptolExported definitionscryptolPrivate defintiionscryptol+Uninterpreted constants (aka module params)cryptol,Generate an Iface from a typechecked module.cryptol$Produce a PrimMap from an interface.NOTE: the map will expose both public and private names.$(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe "#34568;<=cryptol"Things that define exported names. cryptolExpr renaming environment cryptolType renaming environment cryptol#Expression-level fixity environmentcryptolGReturn a list of value-level names to which this parsed name may refer.cryptolFReturn a list of type-level names to which this parsed name may refer.cryptoliMerge two name maps, collapsing cases where the entries are the same, and producing conflicts otherwise.cryptolGenerate a mapping from  to  for a given naming environment.cryptol8Generate a display format based on a naming environment.cryptol9Produce 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.cryptolQualify all symbols in a   with the given prefix.cryptol$Singleton type renaming environment.cryptol*Singleton expression renaming environment.cryptol9Like mappend, but when merging, prefer values on the lhs.cryptol Generate a   using an explicit supply.cryptoljInterpret an import in the context of an interface, to produce a name environment for the renamer, and a G for pretty-printing.cryptolcGenerate a naming environment from a declaration interface, where none of the names are qualified.cryptolUCompute an unqualified naming environment, containing the various module parameters.$cryptol0The naming environment for a single declaration.)cryptolThe naming environment for a single module. This is the mapping from unqualified names to fully qualified names with uniques.*cryptol5Generate the naming environment for a type parameter.+cryptolIntroduce the name,cryptolXGenerate a type renaming environment from the parameters that are bound by this schema.0cryptol|Produce a naming environment from an interface file, that contains a mapping only from unqualified names to qualified ones.            %(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe "#%68;<=^&$ cryptolCheck for overlap and shadowing cryptolOnly check for overlap cryptolDon't check the environment cryptol\How many times did we refer to each name. Used to generate warnings for unused definitions.@cryptol+Multiple imported symbols contain this nameAcryptol.Expression name is not bound to any definitionBcryptol(Type name is not bound to any definitionCcryptol8An environment has produced multiple overlapping symbolsDcryptol[When a value is expected from the naming environment, but one or more types exist instead.EcryptoleWhen a type is missing from the naming environment, but one or more values exist with the same name.Fcryptol)When the fixity of two operators conflictGcryptol5When it's not possible to produce a Prop from a Type.Hcryptol6When a builtin type/type-function is used incorrectly.Icryptol)When a builtin type is named in a binder. cryptol(Record an error. XXX: use a better name cryptolReport a warning. cryptol<Get the source range for wahtever we are currently renaming. cryptol*Annotate something with the current range. cryptol:Do the given computation using the source code range from loc if any. cryptol(Retrieve the name of the current module.Kcryptol;Shadow the current naming environment with some more names. cryptolShadow the current naming environment with some more names. The boolean parameter indicates whether or not to check for shadowing. cryptolGenerate warnings when the left environment shadows things defined in the right. Additionally, generate errors when two names overlap in the left environment. cryptol?Check the RHS of a single name rewrite for conflicting sources.LcryptolAThrow errors for any names that overlap in a rewrite environment. cryptolProduce 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. cryptolvAssuming an error has been recorded already, construct a fake name that's not expected to make it out of the renamer. cryptolXRename a schema, assuming that the type variables have already been brought into scope. cryptolACheck to see if this identifier is a reserved type/type-function. cryptolUWhen possible, rewrite the type operator to a known constructor, otherwise return a  ; that reconstructs the original term, and a default fixity. cryptoluCheck if we are resolving operators whose precedence will change in the future, and issue a warning in that event.(&&) is scheduled to have higher precedence than the comparisons and (^) (||) is scheduled to have higher precedence than the comparisonsSee /https://github.com/GaloisInc/cryptol/issues/241 cryptol1The name environment generated by a single match. cryptolERename patterns, and collect the new environment that they introduce._cryptolRename a binding.`cryptol/Resolve fixity, then rename the resulting type.ccryptolPRename a schema, assuming that none of its type variables are already in scope. cryptolMay contain infix expressionscryptolThe operator to usecryptol"Will not contain infix expressions 89:;<=>?@ABCDEFGHIJKLMNO LK89J:?@ABCDEFGHI;<=>NOM&(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe13V!qcryptol=Data type describing errors that can occur during evaluation.rcryptolOut-of-bounds indexscryptolNon-numeric type passed to number functiontcryptolDivision or modulus by 0ucryptol"Exponentiation by negative integervcryptolLogarithm of a negative integerwcryptolBitvector too largexcryptolCall to the Cryptol error primitiveycryptolDetectable nontermination cryptol"This thunk has not yet been forced cryptol'This thunk is currently being evaluated cryptol>This thunk has previously been forced, and has the given valuezcryptol!The monad for Cryptol evaluation.}cryptolSome options for evalutaioncryptol Where to print stuff (e.g., for trace)cryptolHow to pretty print things.cryptol*How to pretty print things when evaluatingcryptol6A computation that returns an already-evaluated value.cryptolAccess the evaluation options.cryptolDelay the given evaluation computation, returning a thunk which will run the computation when forced. Raise a loop error if the resulting thunk is forced during its own evaluation.cryptolrDelay the given evaluation computation, returning a thunk which will run the computation when forced. Run the retryV computation instead if the resulting thunk is forced during its own evaluation.cryptolProduce a thunk value which can be filled with its associated computation after the fact. A preallocated thunk is returned, along with an operation to fill the thunk with the associated computation. This is used to implement recursive declaration groups.cryptol$Execute the given evaluation action.cryptolLift an   computation into the z monad.cryptolPanic from an Eval context.cryptolFor things like `(inf) or `(0-1).cryptolFor division by 0.cryptol)For exponentiation by a negative integer.cryptol$For logarithm of a negative integer.cryptolFor 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).cryptolFor the Cryptol error function.cryptol*For cases where we can detect tight loops.cryptol3A sequencing operation has gotten an invalid index.cryptol,Optional name to print if a loop is detectedcryptolComputation to delaycryptolComputation to delaycryptol5Backup computation to run if a tight loop is detectedcryptol$A name to associate with this thunk.%qtxrsuvwyz|{}~%z|{}~qtxrsuvwy'(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe68cryptoljAn evaluated type of kind *. These types do not contain type variables, type synonyms, or type functions.cryptol  Bitcryptol  Integercryptol  Z ncryptol  [n]acryptol  [inf]tcryptol  (a, b, c )cryptol  { x : a, y : b, z : c }cryptol  a -> bcryptol-Convert a type value back into a regular typecryptolTrue if the evaluated value is BitcryptolProduce a sequence type valuecryptolLCoerce an extended natural into an integer, for values known to be finitecryptol#Evaluation for types (kind * or #).cryptol$Evaluation for value types (kind *).cryptol%Evaluation for number types (kind #).cryptolAReduce type functions, raising an exception for undefined values.((c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe %368;=>?ANV]/]cryptol]This class defines additional operations necessary to define generic evaluation functions.cryptolSEval prim binds primitive declarations to the primitive values that implement them.cryptolifthen#else operation. Choose either the 'then' value or the 'else'1 value depending on the value of the test bit.cryptolThis type class defines a collection of operations on bits and words that are necessary to define generic evaluator primitives that operate on both concrete and symbolic values uniformly.cryptolPretty-print an individual bitcryptolPretty-print a word valuecryptolPretty-print an integer valuecryptol>Attempt to render a word value as an ASCII character. Return  <B if the character value is unknown (e.g., for symbolic values).cryptol#The number of bits in a word value.cryptol-Construct a literal bit value from a boolean.cryptol=Construct a literal word value given a bit width and a value.cryptol9Construct a literal integer value from the given integer.cryptol'Extract the numbered bit from the word.|NOTE: this assumes that the sequence of bits is big-endian and finite, so the bit numbered 0 is the most significant bit.cryptol$Update the numbered bit in the word.|NOTE: this assumes that the sequence of bits is big-endian and finite, so the bit numbered 0 is the most significant bit.cryptolConstruct a word value from a finite sequence of bits. NOTE: 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.cryptolDeconstruct a packed word value in to a finite sequence of bits. 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.cryptolgConcatenate the two given word values. NOTE: the first argument represents the more-significant bitscryptolTake the most-significant bits, and return those bits and the remainder. The first element of the pair is the most significant bits. The two integer sizes must sum to the length of the given word value.cryptol8Extract a subsequence of bits from a packed word value. The first integer argument is the number of bits in the resulting word. The second integer argument is the number of less-significant digits to discard. Stated another way, the operation `extractWord n i w` is equivalent to first shifting w right by i! bits, and then truncating to n bits.cryptol2's complement addition of packed words. The arguments must have equal bit width, and the result is of the same width. Overflow is silently discarded.cryptol2's complement subtraction of packed words. The arguments must have equal bit width, and the result is of the same width. Overflow is silently discarded.cryptol2's complement multiplication of packed words. The arguments must have equal bit width, and the result is of the same width. The high bits of the multiplication are silently discarded.cryptol6Construct an integer value from the given packed word.cryptolAddition of unbounded integers.cryptol"Subtraction of unbounded integers.cryptol%Multiplication of unbounded integers.cryptolAAddition of integers modulo n, for a concrete positive integer n.cryptolDSubtraction of integers modulo n, for a concrete positive integer n.cryptolGMultiplication of integers modulo n, for a concrete positive integer n.cryptolEConstruct a packed word of the specified width from an integer value.cryptol8Generic value type, parameterized by bit and word types.FNOTE: we maintain an important invariant regarding sequence types. D must never be used for finite sequences of bits. Always use the H constructor instead! Infinite sequences of bits are handled by the & constructor, just as for other types.cryptol  { .. }cryptol  ( .. )cryptol  Bitcryptol Integer  or  Z n cryptol [n]a / Invariant: VSeq is never a sequence of bitscryptol  [n]Bitcryptol  [inf]acryptol functionscryptolpolymorphic values (kind *)cryptolpolymorphic values (kind #)cryptolXFor efficency reasons, we handle finite sequences of bits as special cases in the evaluator. In cases where we know it is safe to do so, we prefer to used a "packed word" representation of bit sequences. This allows us to rely directly on Integer types (in the concrete evalautor) and SBV's Word types (in the symbolic simulator).However, if we cannot be sure all the bits of the sequence will eventually be forced, we must instead rely on an explicit sequence of bits representation.cryptol-Packed word representation for bit sequences.cryptol%Sequence of thunks representing bits.cryptol0A large bitvector sequence, represented as a SeqMap of bits.cryptolA sequence map represents a mapping from nonnegative integer indices to values. These are used to represent both finite and infinite sequences.cryptoleConcrete bitvector values: width, value Invariant: The value must be within the range 0 .. 2^width-1cryptolsApply an integer function to the values of bitvectors. This function assumes both bitvectors are the same width.cryptolwApply an integer function to the values of a bitvector. This function assumes the function will not require masking.cryptolSmart constructor for !s that checks for the width limitcryptol4Generate a finite sequence map from a list of valuescryptol9Generate an infinite sequence map from a stream of valuescryptolCreate a finite list of length n? of the values from [0..n-1] in the given the sequence emap.cryptol=Create an infinite stream of all the values in a sequence mapcryptol*Reverse the order of a finite sequence mapcryptolConcatenate the first nS values of the first sequence map onto the beginning of the second sequence map.cryptolGiven a number n and a sequence map, return two new sequence maps: the first containing the values from `[0..n-1]` and the next containing the values from n onward.cryptolDrop the first n elements of the given SeqMap.cryptolbGiven a sequence map, return a new sequence map that is memoized using a finite map memo table.cryptolPApply the given evaluation function pointwise to the two given sequence maps.cryptol@Apply the given function to each value in the given sequence mapcryptolwAn arbitrarily-chosen number of elements where we switch from a dense sequence representation of bit-level words to SeqMap representation.cryptol(Force a word value into packed word formcryptol*Force a word value into a sequence of bitscryptolmTurn a word value into a sequence of bits, forcing each bit. The sequence is returned in big-endian order.cryptolTurn a word value into a sequence of bits, forcing each bit. The sequence is returned in reverse of the usual order, which is little-endian order.cryptol Compute the size of a word valuecryptol*Select an individual bit from a word valuecryptolProduce a new  WordValue$ from the one given by updating the i#th bit with the given bit value.cryptol$Force the evaluation of a word valuecryptolForce the evaluation of a value cryptolCreate a packed word of n bits.cryptol!Functions that assume word inputscryptolA type lambda that expects a Type.cryptolA type lambda that expects a Type of kind #.cryptolGenerate a stream.cryptolThis is strict!cryptolConstruct either a finite sequence, or a stream. In the finite case, record whether or not the elements were bits, to aid pretty-printing.cryptolConstruct either a finite sequence, or a stream. In the finite case, record whether or not the elements were bits, to aid pretty-printing.cryptolExtract a bit value.cryptolExtract an integer value.cryptol Extract a finite sequence value.cryptolExtract a sequence.cryptolExtract a packed word. cryptolIf the given list of values are all fully-evaluated thunks containing bits, return a packed word built from the same bits. However, if any value is not a fully-evaluated bit, return  <.!cryptol3Turn a value into an integer represented by w bits."cryptol Extract a function from a value.#cryptol,Extract a polymorphic function from a value.$cryptol,Extract a polymorphic function from a value.%cryptolExtract a tuple from a value.&cryptolExtract a record from a value.'cryptolLookup a field in a record.(cryptoldGiven 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.cryptolTest bitcryptol'then' valuecryptol'else' valuecryptolWidthcryptolValuecryptolValuecryptol left widthcryptol right widthcryptolNumber of bits to takecryptol starting bitcryptolSize of the sequence map cryptol Bit-widthcryptolValuecryptol Masked resultu      !"#$%&'(u      !"#$%&'()(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe"#6cryptol#The property as entered by the user<cryptol#The property as entered by the user>cryptolNothing indicates infinityCcryptol@A test result is either a pass, a failure due to evaluating to False;, or a failure due to an exception raised during evaluationHcryptolpApply a testable value to some arguments. Note that this function assumes that the values come from a call to IP (i.e., things are type-correct). We run in the IO monad in order to catch any  EvalErrors.IcryptolGiven a (function) type, compute all possible inputs for it. We also return the types of the arguments and the total number of test (i.e., the length of the outer list. JcryptolQGiven a fully-evaluated type, try to compute the number of values in it. Returns  < for infinite types, user-defined types, polymorphic types, and, currently, function spaces. Of course, we can easily compute the sizes of function spaces, but we can't easily enumerate their inhabitants. KcryptolTReturns all the values in a type. Returns an empty list of values, for types where J returned  <. 3487659:BA@?>=<;CFEDGHIJKLCFEDGHIJK9:BA@?>=<;348765L*(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableNone;=>?K/"#%&'MNOPQRSTUVWXYZ[\]^_`/PONRQSTUVWXM"#%&'`Y^[Z]_\+(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe68;=gcryptol'Evaluation environment with no bindingshcryptol.Bind a variable in the evaluation environment.icryptolVBind a variable to a value in the evaluation environment, without creating a thunk.jcryptol%Lookup a variable in the environment.kcryptolBind a type variable of kind *.lcryptolLookup a type variable. bcedfghijkl bcedfghijkl,(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe>?HV] cryptolEvaluation environments for list comprehensions: Each variable name is bound to a list of values, one for each element in the list comprehension. cryptol&Bindings whose values vary by position cryptol"Bindings whose values are constantrcryptolcExtend the given evaluation environment with all the declarations contained in the given module.scryptolUEvaluate a Cryptol expression to a value. This evaluator is parameterized by the y class, which defines the behavior of bits and words, in addition to providing implementations for all the primitives. cryptol1Introduce the constructor function for a newtype.tcryptoltExtend the given evaluation environment with the result of evaluating the given collection of declaration groups. cryptolbThis operation is used to complete the process of setting up recursive declaration groups. It  backfillsq previously-allocated thunk values with the actual evaluation procedure for the body of recursive definitions.|In order to faithfully evaluate the nonstrict semantics of Cryptol, we have to take some care in this process. In particular, we need to ensure that every recursive definition binding is indistinguishable from its eta-expanded form. The straightforward solution to this is to force an eta-expansion procedure on all recursive definitions. However, for the so-called - types we can instead optimistically use the U operation and only fall back on full eta expansion if the thunk is double-forced. cryptol types are non-polymorphic types recursive constructed from bits, finite sequences, tuples and records. Types of this form can be implemented rather more efficently than general types because we can rely on the h operation to build a thunk that falls back on performing eta-expansion rather than doing it eagerly. cryptolFEta-expand a word value. This forces an unpacked word representation. cryptolGiven a simulator value and its type, fully eta-expand the value. This is a type-directed pass that always produces a canonical value of the expected shape. Eta expansion of values is sometimes necessary to ensure the correct evaluation semantics of recursive definitions. Otherwise, expressions that should be expected to produce well-defined values in the denotational semantics will fail to terminate instead. cryptolEvaluate a declaration, extending the evaluation environment. Two input environments are given: the first is an environment to use when evaluating the body of the declaration; the second is the environment to extend. There are two environments to handle the subtle name-binding issues that arise from recursive definitions. The 'read only' environment is used to bring recursive names into scope while we are still defining them. cryptolApply the the given "selector" form to the given value. This function pushes tuple and record selections pointwise down into other value constructs (e.g., streams and functions). cryptoljEvaluate a list environment at a position. This choses a particular value for the varying locations. cryptolEvaluate a comprehension. cryptolUTurn a list of matches into the final environments for each iteration of the branch. cryptol9Turn a match into the list of environments it represents.rcryptol*Module containing declarations to evaluatecryptolEnvironment to extendscryptolEvaluation environmentcryptolExpression to evaluatetcryptolDeclaration groups to evaluatecryptolEnvironment to extend cryptol7A 'read only' environment for use in declaration bodiescryptol>An evaluation environment to extend with the given declarationcryptolThe declaration to evaluate cryptolStarting evaluation environmentcryptolLength of the comprehensioncryptol"Type of the comprehension elementscryptol$Head expression of the comprehensioncryptol'List of parallel comprehension branchesqtxrsuvwyz}~gqrstr}~zqgstqtxrsuvwy-Safe ;=>?AFQTV }cryptolQCheck that a value satisfies multiple patterns. For example, an "as" pattern is  (__ &&& p).~cryptol%Match a value, and modify the result.cryptol*Match a value, and return the given resultcryptol View pattern.cryptolVariable pattern.cryptolConstant pattern.cryptolPredicate patterncryptolCheck for exact value.cryptol3Match a pattern, using the given default if valure.cryptol2Match an irrefutable pattern. Crashes on faliure.wxyz{|}~z{y|}~wx.Safe7wxyz{|}~$/Safecryptol:Common checks: check for error, or simple full evaluation.0(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafecryptol6All ways to split a type in the form: `a + t1`, where a is a variable.cryptol5Check if we can express a type in the form: `a + t1`.cryptol<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. cryptol<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. 1(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe cryptol1Solve class constraints. If not, then we return  <. If solved, then we return   a list of sub-goals.cryptol1Solve a Zero constraint by instance, if possible.cryptol2Solve a Logic constraint by instance, if possible.cryptol3Solve an Arith constraint by instance, if possible. cryptoleSolve an Arith constraint for a sequence. The type passed here is the element type of the sequence.cryptolSolve Cmp constraints. cryptolhSolve a SignedCmp constraint for a sequence. The type passed here is the element type of the sequence.cryptolSolve SignedCmp constraints.cryptolSolve Literal constraints.cryptolvAdd propositions that are implied by the given one. The result contains the orignal proposition, and maybe some more.2(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe+ cryptolJApply a testable value to some randomly-generated arguments. Returns  < 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.cryptolGiven 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. cryptol{A generator for values of the given type. This fails if we are given a type that lacks a suitable random value generator. cryptolGenerate a random bit value.cryptolGenerate a random integer value. The size parameter is assumed to vary between 1 and 100, and we use it to generate smaller numbers first.cryptolBGenerate 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.cryptol(Generate a random infinite stream value.cryptolyGenerate a random sequence. This should be used for sequences other than bits. For sequences of bits use "randomWord". cryptolGenerate a random tuple value.cryptolGenerate a random record value.cryptolhow to evaluate thingscryptolFunction under testcryptolArgument generatorscryptolSize  3(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportable Trustworthy "#$%>?NQV]FIcryptol/Make a numeric literal value at the given type.cryptolMake a numeric constant.cryptol)Convert a word to a non-negative integer.cryptol3Convert an unbounded integer to a packed bitvector.cryptolCreate a packed wordcryptolTurn a normal binop on Integers into one that can also deal with a bitsize. However, if the bitvector size is 0, always return the 0 bitvector.cryptolTurn a normal binop on Integers into one that can also deal with a bitsize. Generate a thunk that throws a divide by 0 error when forced if the second argument is 0. However, if the bitvector size is 0, always return the 0 bitvector.cryptol;Process two elements based on their lexicographic ordering.cryptolTProcess two elements based on their lexicographic ordering, using signed comparisons cryptolXLifted operation on finite bitsequences. Used for signed comparisons and arithemtic.cryptolSigned carry bit.cryptolUnsigned carry bit.cryptol4Join a sequence of sequences into a single sequence.cryptolSplit implementation. cryptolBMerge two values given a binop. This is used for and, or and xor.0cryptolIndexing operations.?cryptolProduce 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 zerocryptolbit size of the resulting wordcryptolbasecryptolexponentcryptolbasecryptol exponent maskcryptolmodulus#cryptolfThe function may assume its arguments are masked. It is responsible for masking its result if needed.^      !"#$%&'()*+,-./0123456789:;<=>?@^      !"#$%&'()*+,-./0123456789:;<=>?@4(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableNone "#%;<>?QV]NDcryptolCBarrel-shifter algorithm. Takes a list of bits in big-endian order.VcryptolCeiling (log_2 x)WcryptolCeiling (log_2 x)FcryptolMux function on ascryptolSymbolic index valuecryptol)Function from concrete indices to answerscryptoloverall answer(BCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghi(BCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghi5Safe^dikcryptol Try to solve t1 = t2lcryptol Try to solve t1 /= t2mcryptol Try to solve t1 >= t2 cryptol%Try to solve something by evaluation. cryptol Try to solve K >= t cryptol Try to solve t >= K cryptolHTry to prove GEQ by considering the known intervals for the given types. cryptol3Cancel finite positive variables from both sides. 2(fin a, a >= 1) => a * t1 == a * t2 ~~~> t1 == t2 2(fin a, a >= 1) => a * t1 >= a * t2 ~~~> t1 >= t2 cryptol1K1 * t1 + K2 * t2 + ... = K3 * t3 + K4 * t4 + ... cryptol %(t1 + t2 = Inf, fin t1) ~~> t2 = Inf cryptol?Check for addition of constants to both sides of a relation. ((K1 + K2) + t1) R (K1 + t2) ~~> (K2 + t1) R t2OThis relies on the fact that constants are floated left during simplification. cryptolCheck for situations where a unification variable is involved in a sum of terms not containing additional unification variables, and replace it with a solution and an inequality. )s1 = ?a + s2 ~~> (?a = s1 - s2, s1 >= s2) cryptolMatch a sum of the form (s1 + ... + ?a + ... sn) where s1 through sn# do not contain any free variables..Note: a successful match should only occur if  s1 ... sn is not empty. cryptolIIs this a sum of products, where the products have constant coefficients?klmklm6 Trustworthydnono7(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe"#;<=urcryptolType r has an invariant on its  ' component: If there is a mapping from TVFree _ _ tps _ to a type t, then tM must not mention (directly or indirectly) any type parameter that is not in tps. In particular, if t contains a variable TVFree _ _ tps2 _, then tps2 must be a subset of tpsk. This ensures that applying the substitution will not permit any type parameter to escape from its scope. wcryptolMakes 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.{cryptolApply a substitution. Returns  < if nothing changed. cryptol3Pick types for unconstrained unification variables.}cryptol1Apply the substitution to the keys of a type map.cryptolZThis instance does not need to worry about bound variable capture, because we rely on the rO datatype invariant to ensure that variable scopes will be properly preserved. qcryptolreplaces free varsCDpqrstuvwxyz{|}rstuvwxCD{pq}y|z8(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe%3y*cryptolXThe most general unifier is a substitution and a set of constraints on bound variables.9(c) 2014-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe% cryptolGiven 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. cryptolGApply a substitution to a type *without* simplifying constraints like  Arith [n]a to Arith a. (This is in contrast to q4, which performs simplifications wherever possible.) cryptolBYields the return type of the selector on the given argument type.:Safe;=cryptolConvert a module instantiation into a partial module. The resulting module is incomplete because it is missing the definitions from the instantiation. cryptol+Generate a new instance of a declared name. cryptol]Compute renaming environment from a module instantiation. computeEnv :: ModInst -> InstM EnvcryptolParametrized module cryptolName of the new module cryptol Type params cryptolValue parameters cryptol2Instantiated constraints, fresh module, new supply cryptolFunctor being instantiated ;SafecryptolImprovements from a bunch of propositions. Invariant: the substitions should be already applied to the new sub-goals, if any.cryptoluImprovements from a proposition. Invariant: the substitions should be already applied to the new sub-goals, if any.cryptol|Improvements from equality constraints. Invariant: the substitions should be already applied to the new sub-goals, if any.<(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe%68;<=cryptolGInformation about how a constraint came to be, used in error reporting.cryptol%Computing shape of list comprehensioncryptolUse of a split patterncryptol+A type signature in a pattern or expressioncryptol Instantiation of this expressioncryptol#Just defaulting on the command linecryptolUse of a partial type function.cryptol/Constraints arising from type-checking patternscryptol#Instantiating a parametrized modulecryptolGDelayed implication constraints, arising from user-specified type sigs.cryptolKSignature that gave rise to this constraint Nothing means module top-levelcryptol,Something that we need to find evidence for.cryptolWhat it is aboutcryptol$Part of source code that caused goalcryptolWhat needs to be provedcryptolThis abuses the type  a bit. The Q field contains only the numeric part of the Literal constraint. For example, (a, Goal { goal = t }) representats the goal for  Literal t acryptol,A bunch of goals, not including the ones in .cryptol An entry (a,t) corresponds to  Literal t a.cryptol*The types of variables in the environment.cryptol Known typecryptolPart of current SCC. The expression will replace the variable, after we are done with the SCC. In this way a variable that gets generalized is replaced with an appropriate instantiation of itself. cryptolThe SMT solver to invokecryptol*Additional arguments to pass to the solvercryptol$How verbose to be when type-checkingcryptol/Look for the solver prelude in these locations.cryptolFor use in error messages88=(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe"#;<= cryptol1An SMT solver packed with a logger for debugging. cryptolThe actual solver cryptol For debugging cryptol3Execute a computation with a fresh solver instance. cryptol,Load the definitions used for type checking. cryptol"Returns goals that were not proved cryptol4Check if the given goals are known to be unsolvable. cryptol7Check if some numeric goals are known to be unsolvable. cryptol Split up the And in a goal cryptol Assumes no And cryptolSearch in this paths                >Safe68;=5 $cryptol?Various errors that might happen during type checking/inference %cryptol Just say this &cryptolExpected kind, inferred kind 'cryptolMNumber of extra parameters, kind of result (which should not be of the form _ -> _) (cryptol.A type variable was applied to some arguments. )cryptol$Type-synonym, number of extra params *cryptol&Type-synonym, number of missing params +cryptol+The type synonym declarations are recursive ,cryptolExpected type, inferred type -cryptol'Unification results in a recursive type .cryptolkA constraint that we could not solve The boolean indicates if we know that this constraint is impossible. /cryptol3A constraint (with context) that we could not solve 0cryptolVType wild cards are not allowed in this context (e.g., definitions of type synonyms). 1cryptolLUnification variable depends on quantified variables that are not in scope. 2cryptolgQuantified type variables (of kind *) need to match the given type, so it does not work for all types. 3cryptolRThe given constraints causes the signature of the function to be not-satisfiable. 4cryptolFToo many positional type arguments, in an explicit type instantiation >cryptol-Should the first error suppress the next one. $ 8 7 6 5 4 3 1 0 / . - , + * ) ( ' & % 2 9 < ; : = > = > 9 < ; : $ 8 7 6 5 4 3 1 0 / . - , + * ) ( ' & % 2?(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe"#68LPFg McryptolFThis is what's returned when we lookup variables during kind checking. NcryptolLocally bound variable. OcryptolAn outer binding. Rcryptolkinds of (known) vars. Tcryptol,Do we allow wild cards in the given context. Ycryptollazy map, with tparams. Zcryptolare type-wild cards allowed? ^cryptol"Read-write component of the monad. `cryptolCollected errors acryptolCollected warnings bcryptolAccumulated substitution ccryptol|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. dcryptolFSelector constraints that have been solved (ref. iSolvedSelectorsLazy) fcryptolOrdinary constraints gcryptol*Tuple/record projection constraints. The  Z is the "name" of the constraint, used so that we can name it solution properly. icryptol!Read-only component of the monad. kcryptolSource code being analysed lcryptol"Type of variable that are in scope mcryptolType variable that are in scope ncryptolType synonyms that are in scope ocryptolNewtype 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). pcryptolParameter types qcryptol"Constraints on the type parameters rcryptolParameter functions scryptolKNOTE: This field is lazy in an important way! It is the final version of  d 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. tcryptolWhen 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. ~cryptolThe results of type inference. cryptolWe found some errors cryptolType inference was successful. cryptol*This is used for generating various names. cryptol&Information needed for type inference. cryptolLocation of program source cryptolVariables that are in scope cryptolType synonyms that are in scope cryptolNewtypes in scope cryptolType parameters cryptolConstraints on parameters cryptolValue parameters cryptolPrivate state of type-checker cryptol=Should local bindings without signatures be monomorphized? cryptol!Options for the constraint solver cryptol&Where to look for Cryptol theory file. cryptolUThis is used when the type-checker needs to refer to a predefined identifier (e.g., number). cryptol$The supply for fresh name generation cryptolWThe initial seeds, used when checking a fresh program. XXX: why does this start at 10? cryptoleThe monadic computation is about the given range of source code. This is useful for error reporting. cryptol1This is the current range that we are working on. cryptolReport an error. cryptolIRetrieve the mapping between identifiers and declarations in the prelude. cryptoleRecord some constraints that need to be solved. The string explains where the constraints came from. cryptol^The constraints are removed, and returned to the caller. The substitution IS applied to them. cryptol'Add a bunch of goals that need solving. cryptolUCollect the goals emitted by the given sub-computation. Does not emit any new goals. cryptol;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. cryptol)Add a previously generate has constrained cryptolGet the HasJ constraints. Each of this should either be solved, or added back using  . cryptol@Specify the solution (`Expr -> Expr`) for the given constraint ( ). cryptol=Generate a fresh variable name to be used in a local binding. cryptolGenerate a new name for a goal. cryptol"Generate a new free type variable. cryptolTGenerate a new free type variable that depends on these additional type parameters. cryptol"Generate a new free type variable. cryptolKGenerate an unknown type. The doc is a note about what is this type about. cryptol8Record that the two types should be syntactically equal. cryptolIApply the accumulated substitution to something with free type variables. cryptol5Get the substitution that we have accumulated so far. cryptolOAdd to the accumulated substitution, checking that the datatype invariant for r is maintained. cryptolTVariables that are either mentioned in the environment or in a selector constraint. cryptolLookup the type of a variable. cryptol Lookup a type variable. Return  <_ if there is no such variable in scope, in which case we must be dealing with a type constant. cryptol(Lookup the definition of a type synonym. cryptol"Lookup the definition of a newtype cryptol#Lookup the kind of a parameter type cryptol+Lookup the schema for a parameter function. cryptolCheck 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. cryptol6Returns the type synonyms that are currently in scope. cryptol3Returns the newtype declarations that are in scope. cryptol,Returns the parameter functions declarations cryptol*Returns the abstract function declarations cryptol'Constraints on the module's parameters. cryptol6Get the set of bound type variables that are in scope. cryptol9Return the keys of the bound variables that are in scope. cryptolRetrieve the value of the  `mono-binds` option. cryptolWe 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. cryptolHThe sub-computation is performed with the given type parameter in scope. cryptolFThe sub-computation is performed with the given type-synonym in scope. cryptolBThe sub-computation is performed with the given variable in scope. cryptolKThe sub-computation is performed with the given abstract function in scope. cryptol)Add some assumptions for an entire module cryptolCThe sub-computation is performed with the given variables in scope. cryptolCThe sub-computation is performed with the given variables in scope. cryptolVThe sub-computation is performed with the given type synonyms and variables in scope. cryptollPerform the given computation in a new scope (i.e., the subcomputation may use existential type variables). cryptol.The arguments to this function are as follows:9(type param. name, kind signature (opt.), type parameter)The type parameter is just a thunk that we should not force. The reason is that the parameter depends on the kind 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. cryptol*Check if a name refers to a type variable. cryptol'Are type wild-cards OK in this context? cryptolReports an error. cryptolGenerate a fresh unification variable of the given kind. NOTE: We do not simplify these, because we end up with bottom. See XY* XXX: Perhaps we can avoid the recursion? cryptol(Lookup the definition of a type synonym. cryptol#Lookup the definition of a newtype. cryptol6Replace the given bound variables with concrete types. cryptolRecord 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). cryptol@The sub-computation is about the given range of the source code. cryptol See comment M N O P Q R S T U V W X Y Z [ \ ] ^ _ d b a ` f g e h c i j w k l m n o p r q s t u v x z y { | } ~  M N O P Q R S T U V W X Y Z [ \ ] ^ _ d b a ` f g e h c i j w k l m n o p r q s t u v x z y { | } ~  @(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe`0 cryptolCompute 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. cryptolSolve has-constraints. cryptol,Generator an appropriate selector, once the Has constraint has been discharged. The resulting selectors should always work on their corresponding types (i.e., tuple selectros only select from tuples). This function generates the code for lifting tuple/record selectors to sequences and functions.Assumes types are zonked.  cryptolchanges, solved  A(c) 2015-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafeje cryptolexpected, actual cryptolexpected a mono type, got this cryptol$Validate a type, returning its kind. cryptol8Check that the type is valid, and it has the given kind. cryptol"Check that this is a valid schema. cryptolzCheck that the expression is well-formed, and compute its type. Reports an error if the expression is not of a mono type. cryptolACheck that the expression is well-formed, and compute its schema. cryptol2Check if the one type is convertible to the other. cryptolKCheck a declaration. The boolean indicates if we should check the siganture                   B(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafeq cryptolInstantiate 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.EProofApp (ETApp e t)awhere - There will be one `ETApp t` for each insantiated type parameter; - there will be one # for each constraint on the schema;  C(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe;= cryptol Type synonym cryptolNewtype !cryptolParameter type "cryptolProperty synonym $cryptol`Check for duplicate and recursive type synonyms. Returns the type-synonyms in dependency order. %cryptolIAssociate type signatures with bindings and order bindings by dependency. &cryptolGiven 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. 'cryptolgCombine a bunch of definitions into a single map. Here we check that each name is defined only onces. (cryptolgCombine a bunch of definitions into a single map. Here we check that each name is defined only onces. )cryptol*Identify multiple occurances of something.        !  " # $ % & ' ( )  !  " # $ %       & ' ( )DSafe ,cryptol#We default constraints of the form  Literal t a to a := [width t] .cryptolTry 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. The parameters should be all of numeric kind, and the props should als be numeric  , - . , - .E(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe"# /cryptolAdd 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. 0cryptolAdd additional constraints that ensure validity of a type constructor application. Note that the constraints do not use any partial type functions, so the new constraints are guaranteed to be well-formed. This assumes that the parameters are well-formed. 1cryptol>Add additional constraints that ensure the validity of a type. cryptol Simplify Has! constraints as much as possible. 5cryptolTry to clean-up any left-over constraints after we've checked everything in a module. Typically these are either trivial things, or constraints on the module's type parameters. 6cryptol|Prove an implication, and return any improvements that we computed. Records errors, if any of the goals couldn't be solved. cryptolFacts we can knowcryptolNeed to solve thesecryptolDLeft: contradicting goals, Right: inferred types, unsolved goals. cryptolChecking this functioncryptol@These appear in the env., and we should not try to default themcryptolType parameterscryptolAssumed constraintcryptolCollected constraints / 0 1 2 3 4 5 6 4 6 5 1 / 0 3 2F(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafeL{ 7cryptolbCheck a type signature. Returns validated schema, and any implicit constraints that we inferred. 8cryptolmCheck a module parameter declarations. Nothing much to check, we just translate from one syntax to another. 9cryptol!Check a type-synonym declaration. :cryptol'Check a constraint-synonym declaration. ;cryptolACheck a newtype declaration. XXX: Do something with constraints. cryptol%Check something 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 m. 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 u, 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: uIt makes it possible to figure if something is correct without having to look through 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. cryptol(Check an application of a type constant. cryptolACheck a type application of a non built-in type or type variable. cryptolCheck a type-application. cryptolValidate a parsed type. cryptolValidate a parsed proposition. cryptol(Check that a type has the expected kind. cryptolDo we allow wild cards cryptolWhat sort of params are these? cryptol The params cryptoldo this using the params cryptolType constant being appliedcryptolType parameterscryptol Expected kindcryptolResulting type cryptol2The name that is being applied to some arguments. cryptolType synonym parameters cryptolExpected kind cryptolResulting type cryptolParameters to type functioncryptolKind of type functioncryptol$Validated parameters, resulting kind cryptolType that needs to be checkedcryptolExpected kind (if any)cryptol Checked type cryptol#Proposition that need to be checkedcryptolChecked representation cryptolKind-checked typecryptolExpected kind (if any)cryptol Inferred kindcryptol$A type consistent with expectations. 7 8 9 : ; < = < 7 ; 9 : 8 =G(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe"#%Lڵ !cryptol(Construct a primitive in the parsed AST. "cryptol(Construct a primitive in the parsed AST. #cryptol?Infer the type of an expression with an explicit instantiation. $cryptolSInfer the type of an expression, and translate it to a fully elaborated core term. %cryptol$The type the is the smallest of all &cryptolPInfer the type of a pattern. Assumes that the pattern will be just a variable. 'cryptol4Infer the type of one match in a list comprehension. (cryptol2Infer the type of one arm of a list comprehension. ?cryptol!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. )cryptolCome 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. *cryptol_The inputs should be declarations with monomorphic types (i.e., of the form `Forall [] [] t`). +cryptolCheck a monomorphic binding. > ? @ A @ > ? AHSafe Bcryptol8Check that the instance provides what the functor needs. ,cryptolQCheck that the type parameters of the functors all have appropriate definitions. -cryptolxGiven a parameter definition, compute an appropriate instantiation that will match the actual schema for the parameter. Bcryptoltype-checked functor cryptoltype-checked instance cryptolInstantiated module .cryptolParameterized module cryptolType instantiations cryptolInstantiation module cryptolDefinitions for the parameters -cryptolDefinition of parameter cryptol Schema for parameter definition cryptolSchema for parameter cryptol'Expression to use for param definition  B BI(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe DcryptolRCheck a module instantiation, assuming that the functor has already been checked. Dcryptolfunctor cryptol TC settings cryptolnew version of instance 9 $ 2 % & ' ( ) * + , - . / 0 1 3 4 5 6 7 8 9 : ; < ~  C D E F G H9 C D E F ~   $ 2 % & ' ( ) * + , - . / 0 1 3 4 5 6 7 8 9 : ; < G HJ(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe"#68 IcryptolExtra 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. Qcryptol=The file path used to load this module (may not be canonical) Rcryptol0The canonical version of the path of this module Wcryptol3Invariants: 1) All the dependencies of any module m must precede m= in the list. 2) Does not contain any parameterized modules. XcryptolLoaded parameterized modules. YcryptolShould we run the linter? ZcryptolDon't run core lint [cryptol Run core lint \cryptol-This is the current state of the interpreter. ^cryptol+Information about all loaded modules. See  N. Contains information such as the file where the module was loaded from, as well as the module's interface, used for type checking. _cryptol+A source of new names for the type checker. `cryptolAConfiguration settings for the SMT solver used for type-checking. acryptolbThe evaluation environment. Contains the values for all loaded modules, both public and private. bcryptol*Should we run the linter to ensure sanity. ccryptolnAre we assuming that local bindings are monomorphic. XXX: We should probably remove this flag, and set it to  . dcryptolFThe "current" module. Used to decide how to print names, for example. ecryptolWhere we look for things. fcryptolqThis contains additional definitions that were made at the command line, and so they don't reside in any module. gcryptolName source for the renamer jcryptol7Try to focus a loaded module in the module environment. kcryptolwGet a list of all the loaded modules. Each module in the resulting list depends only on other modules that precede it. lcryptolbProduce an ifaceDecls that represents the focused environment of the module system, as well as a G5 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.XXX: This is not quite right. For example, it does not take into account *how* things were imported in a module (e.g., qualified). It would be simpler to simply store the naming environment that was actually used when we renamed the module. mcryptolOThe unqualified declarations and name environment for the dynamic environment. ocryptol$Has this module been loaded already. pcryptol&Try to find a previously loaded module qcryptol\Add a freshly loaded module. If it was previously loaded, then the new version is ignored. rcryptol"Remove a previously loaded module. scryptolBuild 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.+ I J M L K N O R Q P S T U V X W Y Z [ \ ] g f e d c a ` _ ^ b h i j k l m n o p q r s+ \ ] g f e d c a ` _ ^ b Y Z [ h i j k l m U V X W n N O R Q P S T o p q r I J M L K sZ(c) 2014-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportable Trustworthy / 0 1[Safe 2 3 4 5 6 7 8K(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafeS  "(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportable Trustworthy;=Df' z{|}~ ' z{|}~  99  :9 L(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe"#681 ;cryptolFiles that have been loaded <cryptol&The path that includes are relative to =cryptolGGet the absolute directory name of a file that contains cryptol source. >cryptolRun 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. @cryptol6Adjust an included file with the current include path. Acryptol Raise an   error. BcryptolPush 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. CcryptolNLift an IO operation, with a way to handle the exception that it might throw. DcryptolLike  EB, but tries to collect as many errors as possible before failing. FcryptolRemove includes from a module. GcryptolRemove includes from a program. HcryptolSSubstitute top-level includes with the declarations from the files they reference. IcryptolPResolve the file referenced by a include into a list of top-level declarations. Jcryptol%Read a file referenced by an include.  M(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe68<J cryptol=Unable to find the module given, tried looking in these paths cryptolUnable to open a file cryptol4Some other IO error occurred while reading this file cryptol=Generated this parse error when parsing the file for module m cryptol!Recursive module group discovered cryptol"Problems during the renaming phase cryptolProblems during the NoPat phase cryptol#Problems during the NoInclude phase cryptolProblems during type checking cryptol0Problems after type checking, eg. specialization cryptolModule loaded by 'import'$ statement has the wrong module name cryptolATwo modules loaded from different files have the same module name cryptolBAttempt to import a parametrized module that was not instantiated. cryptolCFailed to add the module parameters to all definitions in a module. cryptolThis is just a tag on the error, indicating the file containing it. It is convenient when we had to look for the module, and we'd like to communicate the location of pthe problematic module to the handler. cryptolTRun the computation, and if it caused and error, tag the error with the given file. cryptolgPush an "interactive" context onto the loading stack. A bit of a hack, as it uses a faked module name cryptol(Get the currently focused import source. cryptolRun a   action in a context with a prepended search path. Useful for temporarily looking in other places while resolving imports, for example. cryptol#Usefule for logging. For example: withLogger logPutStrLn HelloY Y N(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe"#<i cryptol7Rename a module in the context of its imported modules. cryptolRun the noPat pass. cryptolLoad a module by its path. cryptol/Load a module, unless it was previously loaded. !cryptol>Load dependencies, typecheck, and add to the eval environment. "cryptol0Rewrite an import declaration to be of the form: &import foo as foo [ [hiding] (a,b,c) ] #cryptolcFind the interface referenced by an import, and generate the naming environment that it describes. $cryptol=Load a series of interfaces, merging their public interfaces. &cryptolDiscover a module. 'cryptol'Discover a file. This is distinct from  &D in that we assume we've already been given a particular file name. (cryptolAAdd the prelude to the import list if it's not already mentioned. )cryptol7Load the dependencies of a module into the environment. *cryptolLoad the local environment, which consists of the environment for the currently opened module, shadowed by the dynamic environment. +cryptoluTypecheck a single expression, yielding a renamed parsed expression, typechecked core expression, and a type schema. ,cryptol"Typecheck a group of declarations.LINVARIANT: This assumes that NoPat has already been run on the declarations. -cryptolGenerate the primitive map. If the prelude is currently being loaded, this should be generated directly from the naming environment given to the renamer instead. .cryptol@Load a module, be it a normal module or a functor instantiation. /cryptolTypecheck a single module. If the module is an instantiation of a functor, then this just type-checks the instantiating parameters. See  . 4cryptol#Generate input for the typechecker. /cryptol how to check cryptolwhy are we loading this cryptolmodule to check &                ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6&      ! " # $ % & ' ( ) * + , - . /     0 1 2       3 4 5 6O(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafe<sG :cryptolFFind the file associated with a module name in the module search path. ;cryptol,Load the module contained in the given file. <cryptolLoad the given parsed module. =cryptolnCheck the type of an expression. Give back the renamed expression, the core expression, and its type schema. >cryptolEvaluate an expression. ?cryptol!Typecheck top-level declarations. @cryptol?Evaluate declarations and add them to the extended environment.N I J K L M \ ] b ^ _ ` a c d e f g i l 7 8 9 : ; < = > ? @ A B CN \ ] b ^ _ ` a c d e f g i I J K L M 8 7 : ; < = > ? @ A l 9 B CP(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafea EcryptolThe specializer monad. FcryptolsA Name should have an entry in the SpecCache iff it is specializable. Each Name starts out with an empty TypesMap. McryptolAdd a `where` clause to the given expression containing type-specialized versions of all functions called (transitively) by the body of the expression. PcryptolAdd 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. Qcryptol<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. RcryptolqTransform 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. Xcryptol)Freshen a name by giving it a new unique. Zcryptol3Reduce `length ts` outermost type abstractions and n proof abstractions. D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ F E D G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^Q(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableNone"#%<NV fcryptolA prover result is either an error message, an empty result (eg for the offline prover), a counterexample or a lazy list of satisfying assignments. ncryptolThe type of query to run ocryptol+Which prover to use (one of the strings in  ~) pcryptolVerbosity flag passed to SBV qcryptolRecord timing information here rcryptol?Extra declarations to bring into scope for symbolic simulation scryptol,Optionally output the SMTLIB query to a file tcryptol&The typechecked expression to evaluate ucryptolThe y of pcExpr3 _ e d c b a ` f j i h g k l m u t s r q p o n v x w y { z | } ~  3 } ~  | y { z v x w l m u t s r q p o n k f j i h g _ e d c b a ` R(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableNone "#%1>?FT]* Kcryptol)Returns maybe an error, and some warnings Lcryptol:User modifiable environment, for things like numeric base. cryptolREPL exceptions. cryptol#REPL_ context with InputT handling. McryptolREPL RW Environment. Ncryptol]This is the name of the currently "focused" module. This is what we edit (:e) or reload (:r) Ocryptol<Should we keep going when we encounter an error, or give up. PcryptolAre we in batch mode. Qcryptol-The current environment of all things loaded. Rcryptol User settings Scryptol%Use this to send messages to the user TcryptolShould we allow `let` on the command line UcryptolnExecute this every time we load a module. This is used to change the title of terminal when loading a module. cryptol3This indicates what the user would like to work on. cryptolWorking on this module. cryptolWorking on this file. VcryptolInitial, empty environment. Wcryptol!Build up the prompt for the REPL. cryptol+Run a REPL action with a fresh environment. cryptolRaise an exception. cryptol1Construct the prompt for the current environment. cryptol6Set the name of the currently focused file, edited by :e and loaded via :r. cryptolPRun a computation in batch mode, restoring the previous isBatch flag afterwards cryptol&Are let-bindings enabled in this REPL? cryptolbIs evaluation enabled. If the currently focused module is parameterized, then we cannot evalute. cryptolUpdate the title cryptol<Set the function that will be called when updating the title cryptolSet the REPL's string-printer cryptolGet the REPL's string-printer cryptol2Use the configured output action to print a string cryptolJUse the configured output action to print a string with a trailing newline cryptolKUse the configured output action to print something using its Show instance cryptolGet visible variable names. cryptol!Get visible type signature names. cryptol@Return a list of property names, sorted by position in the file. cryptolGiven 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. cryptolOGenerate a fresh name using the given index. The name will reside within the " interactive " namespace. Xcryptol9Generate a UserEnv from a description of the options map. cryptolSet a user option. cryptol+Get a user option, using Maybe for failure. cryptolOGet a user option, when it's known to exist. Fail with panic when it doesn't. YcryptolCheck the value to the base option.S S SAThe reference implementation of the Cryptol evaluation semantics.(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableSafeޯ cryptol'Value type for the reference evaluator. cryptol Bit  booleans cryptol Integer  integers cryptol [n]a  finite or infinite lists cryptol ( .. )  tuples cryptol { .. }  records cryptol functions cryptolpolymorphic values (kind *) cryptolpolymorphic values (kind #) ZcryptolDestructor for VBit. [cryptolDestructor for VInteger. \cryptolDestructor for VList. ]cryptolDestructor for VTuple. ^cryptolDestructor for VRecord. _cryptolDestructor for VFun. `cryptolDestructor for VPoly. acryptolDestructor for VNumPoly. bcryptolLook up a field in a record. ccryptol>Polymorphic function values that expect a finite numeric type. dcryptol.Bind a variable in the evaluation environment. ecryptol$Bind a type variable of kind # or *. fcryptol>Convert a list of booleans in big-endian format to an integer. gcryptolEConvert a list of booleans in signed big-endian format to an integer. hcryptolEConvert an integer to big-endian binary value of the specified width. icryptolAConvert an integer to a big-endian format of the specified width. jcryptol;Process two elements based on their lexicographic ordering. kcryptol%Lexicographic ordering on two values. lcryptol,Lexicographic ordering on two signed values. mcryptolSplit a list into w pieces, each of length k. ncryptolTranspose a list of length-w lists into w lists. ocryptol,Indexing operations that return one element. pcryptolEvaluation environmentcryptolExpression to evaluate qcryptolStarting evaluation environmentcryptol$Head expression of the comprehensioncryptol'List of parallel comprehension branches T(c) 2013-2016 Galois, Inc.BSD3cryptol@galois.com provisionalportableNone"#< z cryptolCommand builder. cryptol Commands. cryptolSuccessfully parsed command cryptol2Ambiguous command, list of conflicting commands cryptolThe unknown command rcryptolREPL command parsing. scryptolNotebook command parsing. tcryptol0A subset of commands safe for Notebook execution cryptolRun a command. cryptolwRandomly 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. ucryptol~This function computes the expected coverage percentage and expected number of unique test vectors when using random testing.,The expected test coverage proportion is: 1 - ((n-1)/n)^k This formula takes into account the fact that test vectors are chosen uniformly at random _with replacement_, and thus the same vectors may be generated multiple times. If the test vectors were chosen randomly without replacement, the proportion would instead be k/n.We compute raising to the k^ power in the log domain to improve numerical precision. The equivalant comptutation is: -expm1( k * log1p (-1/n) )Where expm1(x) = exp(x) - 1 and log1p(x) = log(1 + x). However, if sz is large enough, even carefully preserving precision may not be enough to get sensible results. In such situations, we expect the naive approximation k/nu to be very close to accurate and the expected number of unique values is essentially equal to the number of tests. vcryptolConsole-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. wcryptol<Make a type/expression pair that is suitable for binding to it after running :sat or :prove 'cryptol*Lift a parsing action into the REPL monad. xcryptol@Check declarations as though they were defined at the top-level. ycryptolhCreates a fresh binding of "it" to the expression given, and adds it to the current dynamic environment zcryptolExtend the dynamic environment with a fresh binding for "it", as defined by the given value. If we cannot determine the definition of the value, then we don't bind it. {cryptolCreates a fresh binding of "it" to a finite sequence of expressions of the same type, and adds that sequence to the current dynamic environment .cryptolStrip leading space. |cryptolStrip trailing space. /cryptol!Split at the first word boundary. }cryptolUncons a list. 0cryptol$Lookup a string in the command list. 1cryptoljLookup a string in the command list, returning an exact match even if it's the prefix of another command. 2cryptol2Lookup a string in the notebook-safe command list. 3cryptolParse a line as a command.2                          ! " # $ % & ' ( ) * + , - . / 0 1 2 32                   3  / 0 1 2 " $ # % ) ( - ,       ! & . ' * + ~\]^_``abcdefghijklmnopqrstuvwxyz{|}~                                            ! " # $ % & ' ( ) * * + , - . / 0 1 2 3 45678 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 [\]^_`abcdefghijklmnopqrstuvwxyzV{V|V}VbV~VVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVV      !"#$%&'()*++,--./0123456789:;<=>?@ABCDEF.8GHIJXKLMNOOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~F      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuXLKvwwxyz{|}~Z$-853      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZlnop[\]^&JHI_0NOP`abcdefghijkXYZlUVWmnopqrQRSTstuvwxyz{|}~   #) . 247 ~ !"#$%&'()*+,-./01234567789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                             !!WWWWWW#############################################$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$ $ $ $ $ $%%%%%%%%%%%%%%%%%% %!%"%#%$%%%&%'%(%)%*%+%,%-%.%/%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&T&U&V&W&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))))))))**** *!*"*#*$*%*&*'*(*)***+*,*-*.*/*b*0+1+2+3+4+5+6+7+8+9+:+;+<+=+>+?,2,@,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.{.|.}.~..//////// / // /// / /////000011111111222222222222233333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333444444444444444 44 4 4 4 44444444444444444444 4!5"5#5$6%6&7'7(7)7*7+7,7-7.7/7071727374757#767778797:7;7<7=7>7?7@7A7B7C8D8E8F8G8H8I8J8K8L8M8N8O8P8Q878R9S9T: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<t<u<v<w<x<y<y<z<{<|<|<}<~<<<<<<<<<<<<<<<<<<<<<<<<<<<<<#<<<<<)<<<<<<<<<<<<<<<<<<<<<=======================>>>>>>>>>>>>>>>>>>>>>>>>>>>>#>>>>)>>>>>>>>>??????????????????????????? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? !? "? #? $? %? &? '? (? )? *? +? ,?a? -? .? /? 0? 1? 2? 3? 4? 5? 6? 7? 8? 9? :? ;? <? =? >? ?? @? A? B? C? D? E? F? G? H? I? J? K? L?9? 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? {? |? }? ~? ? ? ? ? ? ? @ AAA A A A A A A A A A A AA A A A A A A A A A A A A A A A A A A A A AB C C C C C C C C C C C C C C C C C C C C D D D E E E E E E E E F F F F F F F G G G G H I I I I I IJ J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J [ K K K K " " " " " " " " " " " " " " " " " !L "L #L $L %L &L 'L (L )L *L +L ,L -M .M /M /M 0M M M 1M 2M 3M 4M 5M 6M 7M 8M 9M :M ;M <M =M >M ?M @M AM BM CM DM EM FM GM HM IM JM KM LM MM NM OM PM QM RM SM TM UM VM WM XM YM ZM [M \M ]M ^M _M `MaM aM bM cM dM M eM fM gM hM iM jM kM lM mM nM ZM oM pM qM rM sM tM uM\M vM wM xM yM zM {M |M }M ~M M M M M M M M M M M M M M M M M M M N N N N N N N N N N NN$N N N N N N N N N N N N N N N N N 3N N N N N N N NANBO O O 3O O O O OAO OBO O%O&P P P P P P P P P P P P P P P P P P P P P P P P P P PQ Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q2Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q R R R R R R R R R R R R R R R RR R R R RHR R R R R R R R R R R R R R R R RaR R R R !R "R #R $R %R &R 'R (R )R *R +R ,R -R .R /R 0R 1R 2R 3R 4R zR 5R SR TR 6R 7R 8R 9R aR bR {R |R :R R ;R <R =R >R ?R @R AR BR CR DR ER FR GR HR IR JR KR LR MR NR OR PSSSS QSSSSSSS RS SS TT UT VT WT XT YT ZT [T \T ]T ^T _T `T aT bT cT dT eT fT fT gT hT iT jT jT kT lT mT nT oT pT qT rT sT tT uT vT wT xT yT zT {T |T }T ~T T T T T T T T T T T U U \  \      V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V VrV V V V V V V V V V V                  @ 0\    @    W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W % % % % % % % % % !% "% #% $% %% &% '% (% )% *% +% ,% -% .% /& 0& 1& 2  3, 4, 5, 6, 7, 8, 9, :, ;, <, =, >, ?, @, A\  B1 C1 D5 E5 F5 G5 H5 I5 J5 K5 L5 M5 N5 O7 P7 Q9 R9 S: T: U= V= W= X= Y= Z  [@ \@ ]A A ^A A _A `A aA bB cE dE eE fF ]FF gF hF iF jF kG lG mG nG oG pG qG rG sG tG uG vH wH xH yZ zZ {Z |[ }[ ~[ [ [ [ [ " " L L L L L L L L L L \ L L L L L R R RR R R R R R R R R R R R SSS SSSSSSS S7S:S S S S SSS S SS SAS ?T T T T T T T T T T T T $cryptol-2.6.0-24w5HMDd2znGLrodkM4xJMCryptol.Utils.PanicCryptol.Eval.ArchCryptol.Utils.IdentCryptol.Utils.LoggerCryptol.Utils.MiscCryptol.Utils.PPCryptol.Utils.DebugCryptol.TypeCheck.PPCryptol.Parser.SelectorCryptol.Parser.PositionCryptol.Parser.FixityCryptol.TypeCheck.Solver.InfNatCryptol.REPL.TrieCryptol.Parser.UnlitCryptol.Parser.NameCryptol.Parser.LexerCryptol.ModuleSystem.NameCryptol.Prims.SyntaxCryptol.TypeCheck.TypeCryptol.Parser.ASTCryptol.Parser.NamesCryptol.Parser.NoPatCryptol.ModuleSystem.ExportsCryptol.TypeCheck.ASTCryptol.TypeCheck.TypeMap)Cryptol.TypeCheck.Solver.Numeric.IntervalCryptol.TypeCheck.Solver.Types$Cryptol.TypeCheck.Solver.Numeric.FinCryptol.TypeCheck.ParseableCryptol.Transform.MonoValuesCryptol.Transform.AddModParamsCryptol.IR.FreeVarsCryptol.Parser.UtilsCryptol.ParserCryptol.ModuleSystem.InterfaceCryptol.ModuleSystem.NamingEnvCryptol.ModuleSystem.RenamerCryptol.Eval.MonadCryptol.Eval.TypeCryptol.Eval.ValueCryptol.Testing.ConcreteCryptol.Symbolic.ValueCryptol.Eval.Env Cryptol.EvalCryptol.Utils.PatternsCryptol.TypeCheck.TypePatCryptol.TypeCheck.SimpTypeCryptol.TypeCheck.Solver.UtilsCryptol.TypeCheck.Solver.ClassCryptol.Testing.RandomCryptol.Prims.EvalCryptol.Symbolic.Prims Cryptol.TypeCheck.Solver.NumericCryptol.TypeCheck.SimpleSolverCryptol.TypeCheck.SubstCryptol.TypeCheck.UnifyCryptol.TypeCheck.TypeOf&Cryptol.ModuleSystem.InstantiateModule Cryptol.TypeCheck.Solver.ImproveCryptol.TypeCheck.InferTypesCryptol.TypeCheck.Solver.SMTCryptol.TypeCheck.ErrorCryptol.TypeCheck.Monad!Cryptol.TypeCheck.Solver.SelectorCryptol.TypeCheck.SanityCryptol.TypeCheck.InstantiateCryptol.TypeCheck.DependsCryptol.TypeCheck.DefaultCryptol.TypeCheck.SolveCryptol.TypeCheck.KindCryptol.TypeCheck.Infer%Cryptol.TypeCheck.CheckModuleInstanceCryptol.TypeCheckCryptol.ModuleSystem.EnvCryptol.VersionCryptol.Parser.NoIncludeCryptol.ModuleSystem.MonadCryptol.ModuleSystem.BaseCryptol.ModuleSystemCryptol.Transform.SpecializeCryptol.SymbolicCryptol.REPL.MonadCryptol.Eval.ReferenceCryptol.REPL.CommandCryptol.PreludeCryptol.Parser.LexerUtilsCryptol.Parser.ParserUtilsKindhsGitRev Paths_cryptolbaseGHC.Stack.Types HasCallStack$panic-0.4.0.1-CSjYICB1d8uJcZajpDT9nAPanicmaxBigIntWidthIdentModName modNameToText textToModName modNameChunksisParamInstModNameparamInstModNamenotParamInstModName packModName preludeNameinteractiveName noModuleName exprModName packIdent packInfix unpackIdentmkIdentmkInfix isInfixIdent nullIdent identText modParamIdent$fNFDataModName $fNFDataIdent$fIsStringIdent $fOrdIdent $fEqIdent $fEqModName $fOrdModName $fShowModName$fGenericModName $fShowIdent$fGenericIdentLogger logPutStr logPutStrLnlogPrint quietLogger handleLogger stdoutLogger stderrLogger funLogger$fNFDataLoggeranyJustanyJust2InfixieOpieLeftieRightiePrecieAssocAssoc LeftAssoc RightAssocNonAssocPPName ppNameFixity ppPrefixName ppInfixNamePPppPrecDoc NameFormat UnQualified Qualified NotInScopeNameDisp EmptyNameDispneverQualifyMod alwaysQualify neverQualify fmtModNameextend getNameFormat withNameDisp fixNameDisprunDocrenderpppretty optParenscommaSepppInfixordinal ordSuffixliftPJliftPJ1liftPJ2liftSep<.><+>$$sepfsephsephcatvcathangnestparensbracesbracketsquotes punctuatetextcharintegerintcommaemptycolon$fMonoidNameDisp$fSemigroupNameDisp$fShowNameDisp $fIsStringDoc $fShowDoc $fMonoidDoc$fSemigroupDoc $fPPModName $fPPIdent$fPPText$fShowNameFormat$fGenericNameDisp$fNFDataNameDisp $fGenericDoc $fNFDataDoc $fShowAssoc $fEqAssoc$fGenericAssoc $fNFDataAssoctraceppTrace WithNamesNameMap emptyNameMapppWithNamesPrec ppWithNamesdumpnameListSelectorTupleSel RecordSelListSel ppSelector $fPPSelector $fEqSelector$fShowSelector $fOrdSelector$fGenericSelector$fNFDataSelectorAddLocaddLocdropLocHasLocgetLocRangefromtosourcePositionlinecolLocatedsrcRangething emptyRangestartmovemovesrCombrCombsatcombLoc $fPPPosition $fPPRange$fPPNameLocated $fPPLocated$fFunctorLocated $fHasLoc[] $fHasLoc(,)$fHasLocLocated $fHasLocRange$fAddLocLocated $fEqPosition $fOrdPosition$fShowPosition$fGenericPosition$fNFDataPosition $fEqRange $fShowRange$fGenericRange $fNFDataRange $fEqLocated $fShowLocated$fGenericLocated$fNFDataLocated FixityCmpFCErrorFCLeftFCRightFixityfAssocfLevel compareFixity defaultFixity $fEqFixity$fGenericFixity$fNFDataFixity $fShowFixity$fShowFixityCmp $fEqFixityCmp CryptolPanicCryptolpanic$fPanicComponentCryptolNat'NatInffromNatnAddnMulnExpnMinnMaxnSubnDivnModnCeilDivnCeilModnLg2nWidth nLenFromThennLenFromThenTogenLog widthInteger rootExactgenRoot $fShowNat'$fEqNat' $fOrdNat' $fGenericNat' $fNFDataNat'TrieNode emptyTrie insertTrie lookupTrielookupTrieExactleaves $fShowTriePreProcNoneMarkdownLaTeX knownExts guessPreProcunLitPassNoPat MonoValuesPNameUnQualQualNewNamemkUnqualmkQual getModNamegetIdentisGeneratedName $fNFDataPass $fPPNamePName $fPPPName $fNFDataPName$fEqPass $fOrdPass $fShowPass $fGenericPass $fEqPName $fOrdPName $fShowPName$fGenericPNameTokenTNumChrLitStrLitKWOpSymVirtWhiteErrEOFTokenErrUnterminatedCommentUnterminatedStringUnterminatedChar InvalidString InvalidChar LexicalErrorTokenSymBarArrLArrRFatArrRLambdaEqDefCommaSemiDotDotDot DotDotDotColonBackTickParenLParenRBracketLBracketRCurlyLCurlyRTriLTriR UnderscoreTokenKWKW_else 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_primitive KW_parameter KW_constraintTokenW BlockComment LineCommentSpaceDocStrTokenVVCurlyLVCurlyRVSemiToken tokenType tokenTextLayoutNoLayoutConfig cfgSource cfgLayout cfgPreProccfgAutoIncludecfgModuleScope defaultConfiglexer primLexerPrimMap primDecls primTypesSupplySupplyTFreshM liftSupply NameSource SystemNameUserNameNameNameInfoDeclared ParametercmpNameLexicalcmpNameDisplay ppLocName nameUnique nameIdentnameInfonameLoc nameFixityasPrimtoParamInstName asParamName runSupplyT nextUniqueM emptySupply nextUnique mkDeclared mkParameterparamModRecParamlookupPrimDecllookupPrimType $fPPNameName$fPPName $fOrdName$fEqName$fMonadFixSupplyT$fRunMSupplyTa(->)$fBaseMSupplyTn$fMonadTSupplyT$fMonadSupplyT$fApplicativeSupplyT$fFunctorSupplyT$fFreshMSupplyT$fFreshMStateT$fFreshMReaderT$fFreshMWriterT$fFreshMExceptionT$fGenericNameSource$fNFDataNameSource$fShowNameSource$fEqNameSource $fEqNameInfo$fShowNameInfo$fGenericNameInfo$fNFDataNameInfo $fGenericName $fNFDataName $fShowName $fShowSupply$fGenericSupply$fNFDataSupply $fShowPrimMap$fGenericPrimMap$fNFDataPrimMapTFunTCAddTCSubTCMulTCDivTCModTCExpTCWidthTCMinTCMax TCCeilDiv TCCeilMod TCLenFromThenTCLenFromThenToTCErrorMessagetcErrorMessageUserTCTCTCNumTCInfTCBit TCIntegerTCIntModTCSeqTCFunTCTuple TCNewtypePCPEqualPNeqPGeqPFinPHasPZeroPLogicPArithPCmp PSignedCmpPLiteralPAndPTrueTConTFTErrorHasKindkindOfKTypeKNumKProp:->PrimTy primTyCon primTyIdent primTyDoc primTyFixity primTyListprimTyIxprimTyFromPName primTyFromTC primTyFromTF primTyFromPC$fPPKind$fPPPC $fHasKindPC $fPPUserTC $fOrdUserTC $fEqUserTC$fHasKindUserTC$fPPTC $fHasKindTC$fPPTCErrorMessage$fPPTFun $fHasKindTFun $fPPNameTCon$fPPTCon $fHasKindTCon $fPPNameTFun $fOrdPrimTy $fEqPrimTy$fEqKind $fOrdKind $fShowKind $fGenericKind $fNFDataKind$fShowPC$fEqPC$fOrdPC $fGenericPC $fNFDataPC $fShowUserTC$fGenericUserTC$fNFDataUserTC$fShowTC$fEqTC$fOrdTC $fGenericTC $fNFDataTC$fShowTCErrorMessage$fEqTCErrorMessage$fOrdTCErrorMessage$fGenericTCErrorMessage$fNFDataTCErrorMessage $fShowTFun$fEqTFun $fOrdTFun $fBoundedTFun $fEnumTFun $fGenericTFun $fNFDataTFun $fShowTCon$fEqTCon $fOrdTCon $fGenericTCon $fNFDataTConFVSfvsSTypeNewtypentNamentParams ntConstraintsntFieldsntDocTySyntsNametsParams tsConstraintstsDeftsDocProp TVarSourceTVFromModParamTVFromSignature TypeWildCardTypeOfRecordFieldTypeOfTupleFieldTypeOfSeqElementLenOfSeqTypeParamInstNamedTypeParamInstPos DefinitionOf LenOfCompGen TypeOfArg TypeOfResTypeErrorPlaceHolderTVarInfo tvarSourcetvarDescTVarTVFreeTVBoundTypeTUserTRecTPFlavor TPModParamTPOtherTParamtpUniquetpKindtpFlavtpInfoSchemaForallsVarssPropssTypetMonoisMono schemaParam tySynParam propSynParam newtypeParam modTyParamtpfNametpNametvInfo tvSourceName quickApply kindResulttpVarnewtypeConTypeisFreeTV isBoundTVtIsErrortIsNat'tIsNumtIsInftIsVartIsFuntIsSeqtIsBit tIsInteger tIsIntModtIsTupletIsRec tIsBinFun tSplitFunpIsFinpIsGeqpIsEqpIsZeropIsLogicpIsArithpIsCmp pIsSignedCmp pIsLiteralpIsTruepIsWidthtNumtZerotOnetTwotInftNat'tBittIntegertIntModtWordtSeqtChartStringtRectTuple newtypeTyContFuntNoUser tBadNumbertf1tf2tf3tSubtMultDivtModtExptMintCeilDivtCeilMod tLenFromThentLenFromThenTo=#==/=pZeropLogicpArithpCmp pSignedCmppLiteral>==pHaspTruepAnd pSplitAndpFinpErrornoFreeVariables addTNamesppNewtypeShort pickTVarName$fPPTVarSource $fPPTVarInfo $fPPWithNames $fPPTParam $fOrdTParam $fEqTParam$fHasKindTParam$fPPTVar$fPPWithNames0 $fOrdTVar$fEqTVar $fHasKindTVar$fPPType$fPPWithNames1 $fOrdType$fEqType $fHasKindType$fPPWithNames2 $fPPSchema$fPPWithNames3 $fPPTySyn$fHasKindTySyn$fPPWithNames4 $fPPNewtype$fHasKindNewtype $fFVSSchema$fFVS(,)$fFVS[] $fFVSMaybe $fFVSType$fGenericTPFlavor$fNFDataTPFlavor$fShowTPFlavor$fShowTVarSource$fGenericTVarSource$fNFDataTVarSource$fShowTVarInfo$fGenericTVarInfo$fNFDataTVarInfo$fGenericTParam$fNFDataTParam $fShowTParam $fShowTVar $fGenericTVar $fNFDataTVar $fShowType $fGenericType $fNFDataType $fEqSchema $fShowSchema$fGenericSchema$fNFDataSchema $fShowTySyn$fGenericTySyn $fNFDataTySyn $fShowNewtype$fGenericNewtype$fNFDataNewtypeNoPosnoPosCFinCEqualCNeqCGeqCZeroCLogicCArithCCmp CSignedCmpCLiteralCUserCLocatedCTypeTSeqTBitTNumTCharTAppTRecordTTupleTWildTLocatedTParensTInfixtpRangeKFunNamednamevaluePatternPVarPWildPTuplePRecordPListPTypedPSplitPLocatedMatchMatchLetTypeInst NamedInstPosInstExprEVarELitENeg EComplementETupleERecordESelEListEFromToEInfFromECompEAppEAppTEIfEWhereETypedETypeValEFunELocatedEParensEInfixLiteralECNumECStringNumInfoBinLitOctLitDecLitHexLitCharLitPolyLitTopLeveltlExporttlDoctlValue ExportTypePublicPrivate ReplInput ExprInputLetInputnNamenParamsnBodyPragma PragmaNotePragmaPropertyBindDefDPrimDExprLBindDefBindbNamebParamsbDef bSignaturebInfixbFixitybPragmasbMonobDocPropSyn ImportSpecHidingOnlyImportiModuleiAsiSpec ParameterFunpfNamepfSchemapfDocpfFixity ParameterTypeptNameptKindptDocptFixityptNumberDecl DSignatureDFixityDPragmaDBindDPatBindDTypeDPropDLocatedTopDecl TDNewtypeIncludeDParameterTypeDParameterConstraint DParameterFunModulemName mInstancemImportsmDeclsProgramLStringLIdentLPNamemodRangecppKind$fPPImportSpec $fPPImport $fPPPragma $fPPTopLevel$fHasLocTopLevel $fPPLiteral $fHasLocNamed$fPPParameterType$fHasLocParameterType$fAddLocTParam$fHasLocTParam $fAddLocType $fHasLocType $fPPPattern$fHasLocPattern$fAddLocPattern $fPPTypeInst$fHasLocNewtype$fPPProp $fAddLocProp $fHasLocProp$fAddLocSchema$fHasLocSchema$fPPParameterFun$fHasLocParameterFun $fPPPropSyn $fPPMatch$fPPExpr $fPPBindDef$fPPBind$fPPDecl $fAddLocDecl $fHasLocDecl $fHasLocMatch $fHasLocBind $fHasLocExpr $fAddLocExpr $fPPTopDecl$fHasLocTopDecl $fPPModule$fHasLocModule $fPPProgram $fNoPosProp $fNoPosType $fNoPosTParam $fNoPosSchema$fNoPosPattern $fNoPosMatch$fNoPosTypeInst $fNoPosExpr$fNoPosPropSyn $fNoPosTySyn $fNoPosPragma $fNoPosBind$fNoPosNewtype $fNoPosDecl$fNoPosTopLevel$fNoPosParameterFun$fNoPosParameterType$fNoPosTopDecl $fNoPosModule$fNoPosProgram $fNoPosMaybe $fNoPos[] $fNoPosNamed$fNoPosLocated$fEqImportSpec$fShowImportSpec$fGenericImportSpec$fNFDataImportSpec $fEqImport $fShowImport$fGenericImport$fNFDataImport $fEqPragma $fShowPragma$fGenericPragma$fNFDataPragma$fEqExportType$fShowExportType$fOrdExportType$fGenericExportType$fNFDataExportType$fShowTopLevel$fGenericTopLevel$fNFDataTopLevel$fFunctorTopLevel$fFoldableTopLevel$fTraversableTopLevel $fEqNumInfo $fShowNumInfo$fGenericNumInfo$fNFDataNumInfo $fEqLiteral $fShowLiteral$fGenericLiteral$fNFDataLiteral $fEqNamed $fShowNamed$fFoldableNamed$fTraversableNamed$fGenericNamed $fNFDataNamed$fFunctorNamed$fEqParameterType$fShowParameterType$fGenericParameterType$fNFDataParameterType$fFunctorTParam $fFunctorType $fEqPattern $fShowPattern$fGenericPattern$fNFDataPattern$fFunctorPattern $fEqTypeInst$fShowTypeInst$fGenericTypeInst$fNFDataTypeInst$fFunctorTypeInst $fEqNewtype $fEqTySyn$fFunctorTySyn$fEqProp $fShowProp $fGenericProp $fNFDataProp $fFunctorProp$fFunctorSchema$fEqParameterFun$fShowParameterFun$fGenericParameterFun$fNFDataParameterFun $fEqPropSyn $fShowPropSyn$fGenericPropSyn$fNFDataPropSyn$fFunctorPropSyn$fEqDecl $fShowDecl $fGenericDecl $fNFDataDecl $fFunctorDecl$fEqExpr $fShowExpr $fGenericExpr $fNFDataExpr $fFunctorExpr $fEqMatch $fShowMatch$fGenericMatch $fNFDataMatch$fFunctorMatch$fEqBind $fGenericBind $fNFDataBind $fFunctorBind $fShowBind $fEqBindDef $fShowBindDef$fGenericBindDef$fNFDataBindDef$fFunctorBindDef $fEqReplInput$fShowReplInput $fShowTopDecl$fGenericTopDecl$fNFDataTopDecl $fShowModule$fGenericModule$fNFDataModule $fShowProgramtnamesNTnamesDsnamesD allNamesDpsNamenamesBnamesDefnamesEnamesPsnamesPnamesMnamesArm boundNamesnamesTnamesCtnamesDstnamesDtnamesB tnamesDeftnamesEtnamesTItnamesPtnamesMtnamesStnamesCtnamesTErrorMultipleSignaturesSignatureNoBind PragmaNoBindMultipleFixities FixityNoBind MultipleDocsRemovePatternsremovePatterns $fPPError $fMonadNoPatM$fApplicativeNoPatM$fFunctorNoPatM$fRemovePatterns[]$fRemovePatternsModule$fRemovePatternsExpr$fRemovePatternsProgram $fShowError$fGenericError $fNFDataError ExportSpeceTypeseBinds modExports exportBind exportTypeisExportedBindisExportedType$fMonoidExportSpec$fSemigroupExportSpec$fNFDataExportSpec$fShowExportSpec$fGenericExportSpecDeclDefdName dSignature dDefinitiondPragmasdInfixdFixitydDoc DeclGroup Recursive NonRecursiveFromLetERecETAbsETAppEAbs EProofAbs EProofApp ModVParammvpNamemvpTypemvpDoc mvpFixity ModTParammtpNamemtpKind mtpNumbermtpDocmExportsmTySyns mNewtypes mParamTypesmParamConstraints mParamFunsisParametrizedModulemtpParam groupDeclsePrimeErroreStringeCharppLam splitWhilesplitAbs splitTAbs splitProofAbs splitTApp splitProofApp splitExprInst $fPPDeclGroup$fShowModTParam$fGenericModTParam$fNFDataModTParam$fShowModVParam$fGenericModVParam$fNFDataModVParam $fShowDeclDef$fGenericDeclDef$fNFDataDeclDef$fShowDeclGroup$fGenericDeclGroup$fNFDataDeclGroupTypeMapTMtvartcontrecTypesMapListLnilconsTrieMapemptyTMnullTMlookupTMalterTMunionTMtoListTMmapMaybeWithKeyTM membersTMinsertTM insertWithTMmapTM mapWithKeyTM mapMaybeTM $fTrieMapMapa$fTrieMapList[] $fShowTypeMap$fTrieMapTypeMapType $fFunctorList$fFunctorTypeMapIntervaliLoweriUpperIntervalUpdateNoChangeInvalidInterval NewIntervals typeInterval tvarIntervalupdateIntervalcomputePropIntervals propInterval ppIntervals ppIntervaliIsExactiIsFin iIsPosFiniOverlap iIntersectiAnyiAnyFiniConstiAddiMuliExpiMiniMaxiSubiDiviModiWidth iLenFromTheniLenFromThenTo $fEqInterval$fShowInterval$fShowIntervalUpdateSolvedSolvedIfUnsolved UnsolvableCtxtelseTry solveOpts matchThenguarded $fPPSolved $fShowSolvedcryIsFin cryIsFinType ShowParseable showParseable maybeNameDoc$fShowParseableName$fShowParseableTParam$fShowParseableLocated$fShowParseableMaybe$fShowParseable[]$fShowParseableDeclGroup$fShowParseableDeclDef$fShowParseableDecl$fShowParseableMatch$fShowParseableSelector$fShowParseableType$fShowParseableIdent$fShowParseableInt$fShowParseable(,)$fShowParseableExpr rewModule$fTrieMapRewMap'(,,) addModParams$fAddParamsNewtype$fAddParamsTySyn$fAddParamsDecl$fAddParamsDeclGroup$fAddParamsExpr$fAddParamsType$fAddParamsSchema $fAddParams[] $fInstNewtype $fInstTySyn $fInstType $fInstDeclDef $fInstDecl$fInstDeclGroup $fInstMatch $fInstExpr$fInst[]DefsdefsFreeVarsfreeVarsDepsvalDepstyDepstyParams transDeps moduleDeps $fMonoidDeps$fSemigroupDeps$fFreeVarsNewtype$fFreeVarsTCon$fFreeVarsTVar$fFreeVarsType$fFreeVarsSchema$fFreeVarsMatch$fFreeVarsDeclDef$fFreeVarsDecl $fFreeVars[] $fDefsMatch $fDefsDecl$fDefsDeclGroup$fDefs[]$fFreeVarsExpr$fFreeVarsDeclGroup$fEqDeps widthIdenttranslateExprToNumT ParseError HappyError HappyErrorMsgHappyUnexpectedHappyOutOfTokensppError IfaceDecl ifDeclName ifDeclSig ifDeclPragmas ifDeclInfix ifDeclFixity ifDeclDoc IfaceNewtype IfaceTySyn IfaceDeclsifTySyns ifNewtypesifDecls IfaceParams ifParamTypesifParamConstraints ifParamFunsIface ifModNameifPublic ifPrivateifParams noIfaceParams ifTySynName mkIfaceDeclgenIface ifacePrimMap$fMonoidIfaceDecls$fSemigroupIfaceDecls$fShowIfaceParams$fGenericIfaceParams$fNFDataIfaceParams$fShowIfaceDecl$fGenericIfaceDecl$fNFDataIfaceDecl$fShowIfaceDecls$fGenericIfaceDecls$fNFDataIfaceDecls $fShowIface$fGenericIface $fNFDataIface ImportIface BindsNames namingEnvBuildNamingEnvrunBuildInModule NamingEnvneExprsneTypesneFixitylookupValNameslookupTypeNamesmerge toPrimMap toNameDisp visibleNamesqualify filterNames singletonT singletonE shadowing travNamingEnv namingEnv'newTopnewLocal interpImportunqualifiedEnvmodParamsNamingEnv$fMonoidNamingEnv$fSemigroupNamingEnv$fMonoidBuildNamingEnv$fSemigroupBuildNamingEnv$fBindsNamesInModule$fBindsNamesInModule0$fBindsNamesInModule1$fBindsNamesInModule2$fBindsNamesInModule3$fBindsNamesModule$fBindsNamesTParam$fBindsNamesInModule4$fBindsNamesSchema$fBindsNames[]$fBindsNamesMaybe$fBindsNamesNamingEnv$fBindsNamesImportIface$fShowNamingEnv$fGenericNamingEnv$fNFDataNamingEnv$fFunctorInModule$fTraversableInModule$fFoldableInModule$fShowInModuleRenamerenameRenameMRenamerWarningSymbolShadowedDangerousFixity UnusedName RenamerError MultipleSyms UnboundExpr UnboundTypeOverlappingSyms ExpectedValue ExpectedType FixityErrorInvalidConstraintMalformedBuiltinBoundReservedType runRenamer shadowNamescheckNamingEnv renameModule renameVar renameType$fPPRenamerError$fPPRenamerWarning$fFreshMRenameM$fMonadRenameM$fApplicativeRenameM$fFunctorRenameM$fMonoidRenameM$fSemigroupRenameM$fRenamePropSyn $fRenameTySyn $fRenameMatch$fRenameTypeInst $fRenameExpr$fRenamePattern$fRenameBindDef $fRenameBind $fRenameType $fRenameProp$fRenameTParam$fRenameSchema$fRenameNewtype $fRenameDecl$fRenameParameterFun$fRenameParameterType$fRenameTopDecl$fShowRenamerError$fGenericRenamerError$fNFDataRenamerError$fShowRenamerWarning$fGenericRenamerWarning$fNFDataRenamerWarning $fEqEnvCheck$fShowEnvCheck EvalError InvalidIndexTypeCannotBeDemoted DivideByZeroNegativeExponent LogNegative WordTooWide UserError LoopErrorEvalReadyThunkEvalOpts evalLogger evalPPOptsPPOptsuseAsciiuseBase useInfLengthready getEvalOptsdelay delayFill blackholerunEvalio evalPanictypeCannotBeDemoted divideByZeronegativeExponent logNegative wordTooWide cryUserError cryLoopError invalidIndex$fMonadFixEval $fNFDataEval $fMonadIOEval $fMonadEval$fApplicativeEval $fFunctorEval$fExceptionEvalError $fPPEvalError$fShowEvalErrorTypeEnvTValueTVBit TVIntegerTVIntModTVSeqTVStreamTVTupleTVRecTVFuntValTyisTBittvSeqfinNat'evalType evalValType evalNumTypeevalTF $fShowTValue$fGenericTValue$fNFDataTValue EvalPrimsevalPrimiteValueBitWordppBitppWord ppInteger wordAsCharwordLenbitLitwordLit integerLitwordBit wordUpdatepackWord unpackWordjoinWord splitWord extractWordwordPlus wordMinuswordMult wordToIntintPlusintMinusintMult intModPlus intModMinus intModMult wordFromIntValueGenValueVRecordVTupleVBitVIntegerVSeqVWordVStreamVFunVPolyVNumPoly WordValueWordValBitsVal LargeBitsVal SeqValMapSeqMap IndexSeqMap UpdateSeqMapBVbinBVunaryBVbvValmkBv lookupSeqMap finiteSeqMapinfiniteSeqMapenumerateSeqMap streamSeqMap reverseSeqMap updateSeqMap concatSeqMap splitSeqMap dropSeqMapmemoMap zipSeqMap mapSeqMap largeBitSize asWordVal asBitsMapenumerateWordValueenumerateWordValueRev wordValueSizecheckedSeqIndex checkedIndexindexWordValueupdateWordValueforceWordValue forceValue defaultPPOptsatFstatSndppValue asciiMode integerToCharppBVmaskwordlamwlamtlamnlamtoStreamtoFinSeq boolToWordtoSeqmkSeqfromVBit fromVIntegerfromVSeqfromSeqfromStrfromBit fromWordVal fromVWordvWordLen tryFromBitsfromWordfromVFun fromVPoly fromVNumPoly fromVTuple fromVRecord lookupRecordtoExpr$fShowBV$fShowGenValue$fNFDataSeqMap$fBitWordBoolBVInteger $fGenericBV $fNFDataBV$fGenericGenValue$fNFDataGenValue$fGenericWordValue$fNFDataWordValue TestReport reportResult reportPropreportTestsRunreportTestsPossibleTestSpectestFntestProp testTotal testPossibletestRptProgresstestClrProgresstestRptFailuretestRptSuccess TestResult FailFalse FailErrorisPass runOneTest testableTypetypeSize typeValuesrunTestsSIntegerSWordSBool fromBitsLE literalSWord forallBV_ existsBV_ forallSBool_ existsSBool_forallSInteger_existsSInteger_ iteSValuemergeBit mergeWord mergeWord' mergeBits mergeValue mergeSeqMap$fBitWordSValSValSVal GenEvalEnvEvalEnvenvVarsenvTypesppEnvemptyEnvbindVar bindVarDirect lookupVarbindType lookupType$fMonoidGenEvalEnv$fSemigroupGenEvalEnv$fGenericGenEvalEnv$fNFDataGenEvalEnv moduleEnvevalExpr evalDecls$fMonoidListEnv$fSemigroupListEnvMatchesmatchesPat|||&&&~>~~><~__succeed checkThatlit matchDefaultmatch matchMaybelist><$fMonadPlusMatch$fAlternativeMatch $fMonadMatch$fApplicativeMatch$fMatchesa(,,,)(,,)$fMatchesa(,,)(,)$fMatchesa(,)r1aInfaNataNat'anAdd|-|aMul|^||/||%|aMinaMaxaWidthaCeilDivaCeilMod aLenFromThenaLenFromThenToaTVar aFreeTVaraBitaSeqaWordaCharaTupleaRec|->|aFin|=||/=||>=|aCmpaArithaAndaTrueaLiteralaLogicanError tRebuild'tRebuildtAddtMaxtWidthtotalop1op2op3tOpsplitVarSummandssplitVarSummandsplitConstSummandsplitConstFactor classStep solveZeroInstsolveLogicInstsolveArithInst solveCmpInstsolveSignedCmpInstsolveLiteralInst expandPropGen randomValue randomBit randomSize randomInteger randomIntMod randomWord randomStreamrandomSequence randomTuple randomRecord UnaryArithBinArithUnaryBinary primTablemkLit ecNumberV ecToIntegerVecFromIntegerVmodExp intModExp integerExp integerLg2 integerNeg intModNeg doubleAndAddbinaryunary liftBinArith liftDivArithliftBinInteger liftBinIntModliftDivIntegermodWrap arithBinaryliftUnaryArith arithUnary arithNullarylg2addVsubVmulVintVcmpValue lexComparesignedLexComparecmpOrdersignedCmpOrderliftWord liftSignedsignedBV signedValuebvSltbvSdivbvSremsshrVscarryVcarryVzeroV joinWordVal joinWordsjoinSeqjoinV splitWordValsplitAtVextractWordValecSplitVreverseV transposeVccatVwordValLogicOp logicBinarywordValUnaryOp logicUnary logicShiftshiftLWshiftLBshiftLSshiftRWshiftRBshiftRSrotateLWrotateLBrotateLSrotateRWrotateRBrotateRS indexPrim indexFrontindexFront_bits indexBackindexBack_bits updateFrontupdateFront_word updateBackupdateBack_word updatePrim fromThenVfromToV fromThenToVinfFromV infFromThenVrandomVerrorV$fEvalPrimsBoolBVInteger traverseSndshifterselectVupdateFrontSymupdateFrontSym_word updateBackSymupdateBackSym_word asBitList asWordListliftBin liftModBinsExpsModExpsLg2svLg2svModLg2cmpEqcmpNotEq cmpSignedLtcmpLtcmpGtcmpLtEqcmpGtEqcmpModcmpModEq cmpModNotEq svDivisible cmpBinary signedQuot signedRemcarryscarry$fEvalPrimsSValSValSVal cryIsEqual cryIsNotEqualcryIsGeqsimplify simplifyStepTVarsapSubstSubst emptySubst singleSubst@@defaultingSubst listSubst isEmptySubst substBinds substToList apSubstMaybeapplySubstToVarapSubstTypeMapKeys $fPPSubst $fTVarsModule$fTVarsDeclDef $fTVarsDecl$fTVarsDeclGroup $fTVarsMatch $fTVarsExpr $fTVarsSchema$fTVarsTypeMap $fTVarsList $fTVarsType $fTVars(,) $fTVars[] $fTVarsMaybe $fShowSubstUnificationErrorUniTypeMismatchUniKindMismatchUniTypeLenMismatch UniRecursiveUniNonPolyDepends UniNonPolyResultMGU runResultuniErroremptyMGUmgumguMany freeParams fastTypeOf fastSchemaOfinstantiateModule$fDefinesDeclGroup $fDefinesDecl $fDefines[]$fInstExportSpec $fInstUserTC$fInstTC $fInstTCon $fInstSchema $fShowEnv improveProps improveProp improveLit improveEq TyFunName UserTyFun BuiltInTyFun BuiltInTCConstraintSourceCtComprehension CtSplitPat CtTypeSigCtInst CtSelector CtExactType CtEnumeration CtDefaultingCtPartialTypeFun CtImprovement CtPatternCtModuleInstance DelayedCt dctSource dctForalldctAsmpsdctGoalsHasGoalhasNamehasGoalGoal goalSource goalRangegoalLitGoalGoalsgoalSet literalGoalsVarTypeExtVarCurSCC SolverConfig solverPath solverArgs solverVerbosesolverPreludePath litGoalToGoal goalToLitGoal emptyGoals nullGoals fromGoals goalsFromList insertGoal addTVarsDescsppUse $fPPTyFunName$fPPConstraintSource$fTVarsConstraintSource $fTVarsGoal $fFVSGoal $fOrdGoal$fEqGoal$fTVarsDelayedCt$fFVSDelayedCt$fTVarsHasGoal $fTVarsGoals$fShowSolverConfig$fGenericSolverConfig$fNFDataSolverConfig$fShowTyFunName$fGenericTyFunName$fNFDataTyFunName$fShowConstraintSource$fGenericConstraintSource$fNFDataConstraintSource $fShowGoal $fGenericGoal $fNFDataGoal$fShowDelayedCt$fGenericDelayedCt$fNFDataDelayedCt $fShowHasGoal $fShowGoalsdebugLogSolver withSolver debugBlockproveImpcheckUnsolvable tryGetModel shrinkModel isNumeric$fDebugLogSubst$fDebugLogGoal$fDebugLogType $fDebugLogDoc$fDebugLogMaybe $fDebugLog[]$fDebugLogChar$fMk(,,)$fMk(,)$fMkTCErrorMessage$fMkType$fMkTVar $fMkInteger$fMk()ErrorMsg KindMismatchTooManyTypeParamsTyVarWithParamsTooManyTySynParamsTooFewTySynParamsRecursiveTypeDecls TypeMismatch RecursiveType UnsolvedGoalsUnsolvedDelayedCtUnexpectedTypeWildCardTypeVariableEscaped NotForAllUnusableFunctionTooManyPositionalTypeParams%CannotMixPositionalAndNamedTypeParamsUndefinedTypeParameterRepeatedTypeParameter AmbiguousTypeWarningDefaultingKindDefaultingWildType DefaultingTo cleanupErrorssubsumes $fPPWarning $fFVSWarning$fTVarsWarning $fFVSError $fTVarsError $fShowWarning$fGenericWarning$fNFDataWarningLkpTyVar TLocalVar TOuterVarKRW typeParamskCtrsAllowWildCards NoWildCardsKRO lazyTParams allowWildKindMKMunKMRWiErrors iWarningsiSubst iExistTVars iSolvedHas iNameSeedsiCtsiHasCtsiSupplyROiRangeiVarsiTVarsiTSyns iNewtypes iParamTypesiParamConstraints iParamFunsiSolvedHasLazy iMonoBindsiSolver iPrimNames iSolveCounterDefLocIsLocal IsExternalInferMIMunIM InferOutput InferFailedInferOK NameSeedsseedTVarseedGoal InferInputinpRangeinpVarsinpTSyns inpNewtypes inpParamTypesinpParamConstraints inpParamFuns inpNameSeeds inpMonoBindsinpSolverConfig inpSearchPath inpPrimNames inpSupply nameSeeds bumpCounter runInferMinRange inRangeMbcurRange recordError recordWarning getSolver getPrimMapnewGoalnewGoalsgetGoalsaddGoals collectGoalssimpGoal simpGoals newHasGoal addHasGoal getHasGoals solveHasGoal newParamNamenewName newGoalNamenewTVarnewTVar' newTParamnewTypeunify applySubstapplySubstPredsapplySubstGoalsgetSubst extendSubst varsWithAsmps lookupTParam lookupTSyn lookupNewtypelookupParamTypelookupParamFunexistVargetTSyns getNewtypes getParamFuns getParamTypesgetParamConstraintsgetTVarsgetBoundInScope getMonoBindscheckTShadowing withTParam withTParams withTySyn withNewtype withParamType withVarType withVarTypeswithVar withParamFunswithParameterConstraints withMonoType withMonoTypes withDecls inNewScoperunKindM kLookupTyVarkWildOK kRecordErrorkRecordWarningkNewType kLookupTSynkLookupNewtypekLookupParamType kExistTVar kInstantiateTkSetKindkInRange kNewGoals kInInferM$fFreshMInferM$fMonadFixInferM $fMonadInferM$fApplicativeInferM$fFunctorInferM $fMonadKindM$fApplicativeKindM$fFunctorKindM$fShowNameSeeds$fGenericNameSeeds$fNFDataNameSeeds$fShowInferInput$fShowInferOutput tryHasGoal ExpectedMonoTupleSelectorOutOfRange MissingFieldUnexpectedTupleShapeUnexpectedRecordShapeUnexpectedSequenceShape BadSelectorBadInstantiationCaptured BadProofNoAbsBadProofTyVarsNotEnoughArgumentsInKindBadApplicationFreeTypeVariableBadTypeApplicationRepeatedVariableInForallBadMatchEmptyArmUndefinedTypeVaraibleUndefinedVariableProofObligationsametcExprtcDeclstcModule $fSameTParam $fSameSchema $fSameType$fSame[] $fMonadTcM$fApplicativeTcM $fFunctorTcMinstantiateWithFromDecltoBind toParamFuntoParamConstraintstoTyDecl isTopDeclTyDeclTSNTATPS setDocString orderTyDecls orderBindsmkScc combineMapscombine duplicates$fFromDeclDecl$fFromDeclTopDecldefaultLiteralsimproveByDefaultingWithPuredefaultReplExpr'wfTypeFunctionwfTCwfTypedefaultReplExprdefaultAndSimplifysimplifyAllConstraintsproveModuleTopLevelproveImplication checkSchemacheckParameterType checkTySyn checkPropSyn checkNewtype checkTypecheckParameterConstraints inferModule inferBinds checkSigBinferDscheckModuleInstance tcModuleInst ppWarning DynamicEnvDEnvdeNamesdeDeclsdeEnv LoadedModulelmName lmFilePathlmCanonicalPath lmInterfacelmModule LoadedModuleslmLoadedModuleslmLoadedParamModulesCoreLint NoCoreLint ModuleEnvmeLoadedModules meNameSeedsmeSolverConfig meEvalEnv meCoreLint meMonoBindsmeFocusedModule meSearchPathmeDynEnvmeSupplyresetModuleEnvinitialModuleEnv focusModule loadedModules focusedEnv dynamicEnvgetLoadedModulesisLoaded lookupModuleaddLoadedModuleremoveLoadedModule deIfaceDecls$fMonoidLoadedModules$fSemigroupLoadedModules$fMonoidDynamicEnv$fSemigroupDynamicEnv$fNFDataModuleEnv$fGenericCoreLint$fNFDataCoreLint$fShowLoadedModule$fGenericLoadedModule$fNFDataLoadedModule$fShowLoadedModules$fGenericLoadedModules$fNFDataLoadedModules$fGenericDynamicEnv$fNFDataDynamicEnv$fGenericModuleEnvversion commitHashcommitShortHash commitBranch commitDirty parseModName parseHelpNameparseProgramWith parseModule parseProgram parseExprWith parseExpr parseDeclWith parseDeclparseDeclsWith parseDeclsparseLetDeclWith parseLetDecl parseReplWith parseReplparseSchemaWith parseSchema IncludeError IncludeFailedIncludeParseError IncludeCycleremoveIncludesModuleppIncludeError $fMonadNoIncM$fApplicativeNoIncM$fFunctorNoIncM$fShowIncludeError$fGenericIncludeError$fNFDataIncludeErrorModuleMModuleT unModuleT roLoading roEvalOpts ModuleWarningTypeCheckWarningsRenamerWarnings ModuleErrorModuleNotFound CantFindFile OtherIOErrorModuleParseErrorRecursiveModules RenamerErrors NoPatErrorsNoIncludeErrorsTypeCheckingFailed OtherFailureModuleNameMismatchDuplicateModuleNameImportedParamModuleFailedToParameterizeModDefsNotAParameterizedModule ErrorInFile ImportSource FromModule FromImportFromModuleInstanceimportedModulemoduleNotFound cantFindFile otherIOErrormoduleParseErrorrecursiveModules renamerErrors noPatErrorsnoIncludeErrorstypeCheckingFailedmoduleNameMismatchduplicateModuleNameimportParamModulefailedToParameterizeModDefsnotAParameterizedModule errorInFilewarntypeCheckWarningsrenamerWarningsemptyRO runModuleT runModuleM getModuleEnv setModuleEnvmodifyModuleEnvgetLoadedMaybe loadingImport loadingModuleloadingModInstance interactiveloadinggetImportSourcegetIface getLoaded getNameSeeds getSupply setMonoBinds setNameSeeds setSupply unloadModule loadedModule modifyEvalEnv getEvalEnvgetFocusedModulesetFocusedModule getSearchPathwithPrependedSearchPath getFocusedEnv getDynEnv setDynEnv setSolvergetSolverConfig withLogger$fPPImportSource$fEqImportSource$fPPModuleError$fNFDataModuleError$fPPModuleWarning$fMonadIOModuleT$fFreshMModuleT$fMonadTModuleT$fMonadModuleT$fApplicativeModuleT$fFunctorModuleT$fShowImportSource$fGenericImportSource$fNFDataImportSource$fShowModuleError$fShowModuleWarning$fGenericModuleWarning$fNFDataModuleWarningTCActiontcActiontcLintertcPrimsActTCLinter lintCheck lintModulenoPatloadModuleByPathloadModuleFrom doLoadModulefullyQualified importIface importIfaces moduleFile findModulefindFile addPreludeloadDeps getLocalEnv checkExpr checkDecls checkModulecheckSingleModule exprLinter declsLinter moduleLinter typecheck genInferInput ModuleRes ModuleCmdloadModuleByNameSpecMSpecT SpecCacherunSpecT liftSpecT getSpecCache setSpecCachemodifySpecCachemodify specializespecializeExprspecializeMatchwithDeclGroupsspecializeEWherespecializeDeclGroupsspecializeConstdestEProofApps destETApps destEProofAbs destETAbs freshNameinstantiateSchemainstantiateExpr allDeclGroupsallLoadedModulesallPublicNamesFinTypeFTBit FTIntegerFTIntModFTSeqFTTupleFTRecord ProverResult AllSatResult ThmResult EmptyResult ProverError ProverStats ProverCommand pcQueryType pcProverName pcVerbose pcProverStats pcExtraDecls pcSmtFilepcExprpcSchema QueryTypeSatQuery ProveQuerySatNumAllSatSomeSat SatResult proverConfigs proverNames lookupProver satSMTResultsallSatSMTResults thmSMTResults proverErrorsatProvesatProveOffline protectStack parseValues parseValuenumTypefinType unFinType predArgTypesinBoundsIntMod forallFinType existsFinType $fShowSatNum$fShowQueryTypeSmoke Z3NotFound OptionDescroptName optDefaultoptCheckoptHelpoptEffEnvVal EnvStringEnvProgEnvNumEnvBool REPLException FileNotFoundDirectoryNotFound NoPatErrorNoIncludeErrorModuleSystemError EvalPolyErrorTypeNotTestableEvalInParamModuleSBVErrorREPLunREPLlNamelPathrunREPLraisecatchrethrowEvalError getPromptclearLoadedMod setLoadedMod setEditPath getLoadedMod setSearchPathprependSearchPathshouldContinuestop unlessBatchasBatch disableLet enableLet getLetEnabledvalidEvalContextupdateREPLTitlesetUpdateREPLTitle setPutStr getPutStr getLoggerrPutStr rPutStrLnrPrintgetVars getExprNames getTypeNamesgetPropertyNames getModNamesuniqifysetUser tryGetUsergetUsergetUserShowProverStats userOptions getUserSatNum whenDebug smokeTest$fPPREPLException$fExceptionREPLException $fFreshMREPL$fMonadBaseControlIOREPL$fMonadBaseIOREPL $fMonadIOREPL $fMonadREPL$fApplicativeREPL $fFunctorREPL $fPPSmoke$fShowREPLException $fShowEnvVal $fShowSmoke $fEqSmokeVListevaluate $fMonoidEnv$fSemigroupEnvQCModeQCRandom QCExhaustCommandExitCode CommandOk CommandError CommandBodyExprArg FileExprArgDeclsArg ExprTypeArg ModNameArg FilenameArg OptionArgShellArgHelpArgNoArg CommandDescrcNamescBodycHelpCommand AmbiguousUnknown runCommandqcCmdsatCmdproveCmdonlineProveSatofflineProveSat moduleCmd loadPreludeloadCmd setOptionCmd handleCtrlC replParse replParseExprinteractiveConfig liftModuleCmdmoduleCmdResult replCheckExpr replEvalExprsanitize splitCommand findCommandfindCommandExact findNbCommand parseCommand$fOrdCommandDescr$fEqCommandDescr$fShowCommandDescr $fEqQCMode $fShowQCModewritePreludeContentscryptolTcContentsGHC.ShowShowGHC.BaseNothing nameVariant nameVariantsmarkdownlatexTokenOpOtherVirtualExplicit splitQual dropWhite byteForChar ComplementGEQLEQMulEqualMinusPlusHashExpModDivBlock AlexInputInpinputalexInputPrevCharalexPosLexSInCharInString InCommentNormalAction startComment endComment addToCommentstartEndComment startString endString addToString startCharendChar addToChar mkQualIdentmkQualOpemitemitSnumToken fromDigit alexGetByte isExplicit startsLayoutlayoutvirtnUniquenInfonIdentnFixitynLocppName annotTopDsannotDsannotDannotB checkSigstoSigtoPragmatoFixitytoDocsGHC.Errerrorghc-prim GHC.TypesTrueFalseinLocalInst instTyParamssNextTyParamNum anonRecord mkPrimDeclmkDocmkModulemkAnonymousModulemkModuleInstanceSsTokenssPrevTokParseMPunP parseStringparselexerP happyError errorMessage customErrorexpected mkModNamemkSchemagetNamegetNumgetStrnumLitintValmkFixity mkTupleSel fromStrLitvalidDemotedTypemkEAppunOpbinOpeFromTo exprToNumT exportDecl exportNewtypemkParFun mkParType changeExport mkTypeInstmkTParammkTySyn mkPropSynpolyTermmkPoly mkPropertymkIfdistrLocmkProp zeroIdent logicIdent arithIdentfinIdentcmpIdentsignedCmpIdent literalIdentCheckAll CheckOverlap CheckNonerwNameUseCountrecordrecordWcurLoclocatedwithLocgetNS shadowNames'checkEnvcontainsOverlap typeExists mkFakeName renameSchema isReserved lookupFixityTOpisDangerousFixity renameMatch renamePatsmkEInfixUnforced BlackHoleForcedIOListEnvleVarsleStatic evalNewtypefillHole isValueTypeetaWordetaDelayevalDeclevalSel evalListEnvevalComp branchEnvs evalMatchJust solveArithSeqsolveSignedCmpSeqpBin tryGeqKThan tryGeqThanK geqByInterval tryCancelVar tryEqMulConst tryEqAddInf tryAddConsttryLinearSolutionmatchLinearUnifier matchLinearsuMapdefaultFreeVar plainSubst typeSelect freshenName computeEnvsolverlogger loadTcPrelude unsolvableflatGoalInt solveSelectormkSel checkTypeIsexprType exprSchema convertible checkDeclinstantiateWithNames simpHasGoals quickSolverproveImplicationIO checkTUserappTy doCheckType checkProp checkKindmkPrimmkPrim'appTyscheckEsmallestinferP inferMatch inferCArm guessType generalize checkMonoB checkTyParamsmakeValParamDefcheckValParamshashbranchdirty getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileNameHappyStkenvSeen envIncPath getIncPath withIncPathNoIncM fromIncPath includeFailedpushPath failsWith collectErrorsData.TraversablemapMnoIncludeModulenoIncludeProgram noIncTopDeclresolveInclude readIncludeCheckerUserEnv eLoadedMod eContinueeIsBatch eModuleEnveUserEnveLogger eLetEnabled eUpdateTitle defaultRWmkPrompt mkUserEnv checkBase fromVListvFinPoly bitsToIntegersignedBitsToInteger vWordValue integerToBitslexSignedComparesplitV indexPrimOnecommands nbCommands nbCommandListexpectedCoverage cmdProveSatmkSolverResultreplCheckDeclsbindItVariablebindItVariableValbindItVariables sanitizeEnduncons