f]       Safe-Infered$Color the result of a show function  Safe-InferedCompose 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 !" !" !"  Safe-Infered#$%&'()#$%&'()#$%&'() Safe-Infered *)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 0!A position from a single integer 1An error with a given position 23Used if a bottom value has no position information 3=Map a function over a list and provide the function with the 2 correct position with respect to a root position 4567*+,-./012389:;4567*+,-./01234567*+,-./012389:; Safe-Infered?Data type used to check polymorphic functions. For example, to / check the function zip we annotate the type [A] -> [A] -> [(A, A)]. </Check whether a DataType is the data type of A =9Construct a polymorphic A value with a specific position >/Select the position from a polymorphic A value ?<=>?<=>?<=> Safe-Infered@A polymorpic component AA runtime error B#Bottom with no postion information C!Bottom with position information D8A term where the first argument encodes the constructor E<Shows a PVal with a specific substitution of some positions F<The infimum of a list of PVals. In contrast to the standard 5 infimum this function yields _|_ for an empty list. G*Checks whether a partial value is bottom. H5Convert a term representation into polymorphic value I7Convert a polymorphic value into a term representation J?Project to a specific position of a PVal. The function assumes = that the position is a valid position of the partial value. KBCollect 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. L#Collect bottom positions in a PVal MBReplace 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. N: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. O#Rename positions to letters a to z P@ABCDEFGHIJKLMNOQP@ABCDEFGHIJKLMNO PDCBA@EFGHIJKLMNOQ Safe-Infered 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      Safe-Infered RSTUVWXYZRSTUVWRSTUVWXYZ  Safe-Infered [<An argument refinement consists of a bottom position in the * argument and a list of refinement trees. \@A result refinement consists of a bottom position in the result % and a list of argument refinements. ]+Annotate a value with an argument position ^(Annotate a value with a result position _BA tree that represents the demand behaviour of a function refered  to as refinement. `4Constructor used for non-lifted types like integers a0A value and a list of refinements in the result b=Generate a refinement tree for a type that is an instance of  Data. c'Cut a refinement tree at a given depth d*Breadth first search on a refinement tree e(Depth first search on a refinement tree f9A refinement tree with effects around the successsors is 9 transformed into a tree with effects around the entries [\]ghi^jkl_`amnbcdefopqr?[\]ghi^jkl_`amnbcdef[\]ghi^jkl_a`mnbcdefopqr  Safe-Infered s'Monad tansformer counterpart of Search t<States whether we searched the complete search space or not u'Case analysis for the Search data type v#Check whether a search is complete w=Replace an incomplete search by a complete one if the result  satisfies the predicate x>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 y<Filter the incomplete elements of a list by a predicate. We 6 assume that the list starts with incomplete elements z$Check whether a SearchT is complete {%An incomplete Search with no results |"A complete Search with one result s}~tuvwxyz{|s}~tuvwxyz{|s}~tuvwxyz{|  Safe-Infered>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   Safe-Infered@Approximate the characteristic set for a function up to a given  depth 0Check a characteristic set for counter-examples 4Prune a refinement by looking for leftmost, topmost D counter-examples. We prune up to some depth and increase the depth  each time   Safe-Infered@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.    !"#$%&'()*+,-./0,123456789:;<=>?@ABCCDDEFGHIJKLMNOPQRSTUVWXYZ[\] ^ _ ` a b c d e f g h i j k l k m n o p q i r s j t u v w x y z { | } ~  |        sloth-0.0.2 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 interactCheckcheck showColorColorBlueMagentaGreenRed $fShowColorCompose inComposegunfoldMgunfoldWithIndexfromConstrWithChildrencompose isDataTypeFunfun2fun3fun4fun5fun6fun7PosisRootrootfirstrest|> singletonbottom bottomNoPos mapWithPosNoPositionExceptionPositionException$fExceptionNoPositionException$fExceptionPositionException$fOrdPos $fShowPos isDataTypeApolyApolyPosPolyError BottomNoPosBottomConsshowsPrecPValWithSubinfimumisBottomfromPValtoPValselbotPosGEbotPosmapPolyproj simplifyPosPVal $fShowPValCoMonad duplicateextend CoPointedextract<<=$fCoPointedWriterT$fCoMonadIdentity$fCoPointedIdentityArgRefResRefArgPosResPosRefNoRef refineTreecutbfsdfscoSeqargPosargRefsresPosresRefs fmapResRefs fmapArgRefs$fApplicativeRef $fFunctorRef$fFunctorArgPos$fFunctorResPosSearchTSearchsearch isComplete completion filterSearchfilterIncomplete isCompleteTzeroone runSearchT IncompleteComplete$fCoMonadSearchT$fCoPointedSearchT$fMonadSearchT$fMonadTransSearchT$fFunctorSearchT$fCoMonadSearch$fCoPointedSearch $fMonadSearch$fFunctorSearchTestCaseMappingmapping isFailureisValidargumentresult showTestCase $fShowMappingcharSet checkCharSetpruneSetTestable$fTestable(->)$fTestable(->)0$fTestable(->)1$fTestable(->)2$fTestable(->)3$fTestable(->)4$fTestable(->)5