ú΀Ùvê      $Color the result of a show function Compose two type constructors =Lift a function on nested type constructors to a function on  composed type constructors =An implementation of gunfold with additional monadic context =An implementation of gunfold which additionally provides the % index for every child (zero-based). !@Build a term from a list of subterms and a generic function for  these subterms  ! !"#$%&'()*+,-./01234./01234./0123456789)Datatype to identify positions in a term :;<,Test whether a postion is the root position =Root position >First element of the position ?#Position without the first element @"Extend a position with an element A!A position from a single integer BAn error with a given position C3Used if a bottom value has no position information D=Map a function over a list and provide the function with the 2 correct position with respect to a root position 56789<=>?@ABCD5667889<=>?@ABCD?Data type used to check polymorphic functions. For example, to / check the function zip we annotate the type [A] -> [A] -> [(A, A)]. EF/Check whether a DataType is the data type of A G9Construct a polymorphic A value with a specific position H/Select the position from a polymorphic A value EFGHEEFGHIJA polymorpic component KA runtime error L#Bottom with no postion information M!Bottom with position information N8A term where the first argument encodes the constructor OPQRST<Shows a PVal with a specific substitution of some positions UVWXYSemantic join of two PVals Z<The infimum of a list of PVals. In contrast to the standard 5 infimum this function yields _|_ for an empty list. [*Checks whether a partial value is bottom. \5Convert a term representation into polymorphic value ]7Convert a polymorphic value into a term representation ^?Project to a specific position of a PVal. The function assumes = that the position is a valid position of the partial value. _BCollect all bottom positions in a PVal which are greater equal to A a specific position. The function assumes that this position is ! valid with respect to the PVal. `#Collect bottom positions in a PVal abBReplace all occurences of the Poly constructor by a partial value ? by employing a mapping from positions to partial values. This @ function implements a generic fmap on basis of partial values. c:Project to a specific position of a partial value. If the = position does not exist the result is bottom. This function : implements a generic indexing to a polymorphic position. d#Rename positions to letters a to z ef3Generalization of intercalate to arbitrary monoids g,Specialization of mintercalate to functions IJKLMNTZ[\]^_`bcdINMLKJJKLMNTZ[\]^_`bcd Default configuration -Show test cases that are no counter-examples >Show test cases that are no counter-examples but no test case  with total results Do not use colors for output APresent counter-examples in interactive mode and give a detailed  explanation     hijklmhijklmhijijkllm !n<An argument refinement consists of a bottom position in the * argument and a list of refinement trees. o@A result refinement consists of a bottom position in the result % and a list of argument refinements. p+Annotate a value with an argument position qrst(Annotate a value with a result position uvwxBA tree that represents the demand behaviour of a function refered  to as refinement. y4Constructor used for non-lifted types like integers z0A value and a list of refinements in the result {|}=Generate a refinement tree for a type that is an instance of  Data. ~?Generate a refinement tree for a data type where all positions + are relative to a provided root position. @Generate refinement tree in the case that the representation of  the type is an AlgRep. €AConstruct refinement tree from list of children by adding bottom  as root element ?Construct refinement tree from list of children without adding  bottom as root element ‚"Contruct a refinement for a value ƒ/Construct a refinement for a unary constructor „0Construct a refinement for a twoary constructor …A refinement for integers †=A refinement where each node has one value and one successor ‡!A refinement tree for characters ˆ-A refinement for integers between two bounds ‰'Cut a refinement tree at a given depth Š*Breadth first search on a refinement tree ‹(Depth first search on a refinement tree Œ9A refinement tree with effects around the successsors is 9 transformed into a tree with effects around the entries ŽEnopqrstuvwxyz{|}‰Š‹Œnopqrsqrstuvwuvwxzyyz{|}‰Š‹Œ 'Monad tansformer counterpart of Search ‘’<States whether we searched the complete search space or not “”•'Case analysis for the Search data type –#Check whether a search is complete —=Replace an incomplete search by a complete one if the result  satisfies the predicate ˜>Filter a list by a predicate that yields a search result. The E element is only droped if the predicate yields False and the search  was complete ™<Filter the incomplete elements of a list by a predicate. We 6 assume that the list starts with incomplete elements š$Check whether a SearchT is complete ›%An incomplete Search with no results œ"A complete Search with one result ‘’“”•–—˜™š›œ‘‘’”““”•–—˜™š›œ >A TestCase is a Mapping and a list of tested result positions 9 with corresponding suggested results of these positions žŸ=A Mapping consists of a argument value and the corresponding  result  ¡¢£4Construct a Mapping from a function and an argument ¤¥¦§6Check whether a TestCase is a failure given a certain  configuration ¨5Check whether a TestCase should be displayed under a  configuration žŸ ¡¢£¤§¨ žžŸ ¡¢ ¡¢£¤§¨ ©ª@Approximate the characteristic set for a function up to a given  depth «7Approximate the characteristic set of a given function ¬=Compute a superset of the characteristic set. This set still & contains non-sequential refinements. ­®BIdentify argument refinements that are definitely sequential. The E first argument refinement is a refinement at the demanded position. ¯°?A position is definitely sequential if it is sequential in all  successors ±4Definite Positions that have all children in common ²>Argument positions definitely identified as beeing sequential ³8Remove all definitely and potially non-sequential steps ´9Remove all definitely non-sequential steps from a set of  refinement steps µ¶0Check a characteristic set for counter-examples ·¸*Compute the infimum for a result position ¹:Collect the mappings that are defined at a given position º»4Prune a refinement by looking for leftmost, topmost D counter-examples. We prune up to some depth and increase the depth  each time ¼'Prune a refinement up to a given depth ½¾¿À,Elementwise intersection of a list of lists ©ª¶»©ªª¶»@Test a function for partial values up to a specific size and do $ not present successful test cases. BTest a function for partial values up to a specific size and even  present successful test cases. BInteractively test a function for partial values up to a specific  size. ?Test a function for partial values up to a specific size where G the provided configuration determines which test cases are presented. Á>Tests a function for partial values up to a specific size and  yields a list of results. Â1Show test cases by generating a list of Strings.   à !"#$%&'()*++,-./0112233445566789:;<=>>??@@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijkA l m n o p q r s t t u v w w x y z { z | } ~  € ‚ ƒ „ … † ‡ ˆ ‰ Š ‹ Œ Ž   ‘ ’ “ ” • – — ˜ ™ š › œ   ž ž Ÿ   ¡ ¢ £ ¤ ¥ ¦ § ¨ © ª « ¬ ­ ® ¯ ° ± ² ³ ´ µ ¶ · ¸ ¹ º » ¼ ½ ¾¿ÀÁ sloth-0.0.1 Test.SlothTest.Sloth.ColorTest.Sloth.GenericsTest.Sloth.FunctionTest.Sloth.PosTest.Sloth.PolyTest.Sloth.PValTest.Sloth.ConfigTest.Sloth.CoMonadTest.Sloth.RefineTest.Sloth.SearchTest.Sloth.TestCaseTest.Sloth.CharSetbase Data.DataDataData.Typeable.InternalTypeableAConfig minInfSize interactivecolored successes noBottomPosdetailed simpleApprox defaultConfig verboseConfigsuccessesConfiguncoloredConfiginteractiveConfig strictCheck verboseCheck interactCheckcheckColorBlueMagentaGreenRed showColorComposecompose inComposegunfoldMgunfoldWithIndexfromConstrWithChildrenFun7Fun6Fun5Fun4Fun3Fun2 isDataTypeFunfun2fun3fun4fun5fun6fun7NoPositionExceptionPositionExceptionPos intercalateSisRootrootfirstrest|> singletonbottom bottomNoPos mapWithPos isDataTypeApolyApolyPosPValPolyError BottomNoPosBottomCons showsBottom showsPoly showsBlank showsComma showsConsshowsPrecPValWithSubisInfix infixSymbisDataTypeTupleisDataTypeList/\infimumisBottomfromPValtoPValselbotPosGEbotPosbotPosWithRootmapPolyproj simplifyPossimplifyPosState mintercalateCoMonad duplicateextend CoPointedextract<<=ArgRefResRefArgPosargPosargRefsResPosresPosresRefsRefNoRef fmapResRefs fmapArgRefs refineTree refineData refineAlgRepliftedunliftedcons0cons1cons2intRef linearRefcharRef boundedNatRefcutbfsdfscoSeqcoSeqRef coSeqArgRefSearchT runSearchTSearch IncompleteCompletesearch isComplete completion filterSearchfilterIncomplete isCompleteTzerooneTestCaseMappingargumentresultmapping showTestCase showsTestCaseshowsPrecSearchPVal isFailureisValidTestablecharSetcharSet'wholeSet wholeSet'identifySeqPosidentifySeqPosResRefidentifyDerivedSeqPoscommonDefiniteSeqPosdefiniteSeqPosfilterDemanded filterSeqfilterSeqResRef checkCharSet checkMappinginfvalues valuesArgRefpruneSet pruneSetUpTopruneSetWriter pruneResRef pruneArgRef intersectAll listCheck showResults