úÎ*K'…#      !"None !"246=HJKM An instance  KDynCase f a defines an instance DynCase (Term f) a„This operation allows you to rediscover the label giving the sort of a term by inspecting the term. It is mainly used through the  and  operators"Determine whether a node has sort a(Inspect an existentially-quantified sort #$%&' #$%&'None( This is the Q%-lifted version of 'abstractNewtypeQ.)This function abstracts away newtype# declaration, it turns them into data declarations.*LThis function provides the name and the arity of the given data constructor.+7This function returns the name of a bound type variable,]This function provides a list (of the given length) of new names based on the given string.()*+,()*+,None!"HJKM#A monadic translation for all sorts'A monadic translation for a single sort 1A single-sorted translation in the Identity monad?Applies a rewrite to all immediate subterms of the current termDApplies two rewrites in suceesion, succeeding if one or both succeedDLeft-biased choice -- (f +> g) runs f, and, if it fails, then runs gZApplies a rewrite to all immediate subterms of the current term, succeeding if any succeedYApplies a rewrite to the first immediate subterm of the current term where it can succeed'Runs a rewrite in a bottom-up traversal&Runs a rewrite in a top-down traversalBRuns a rewrite in a bottom-up traversal, succeeding if any succeedARuns a rewrite in a top-down traversal, succeeding if any succeed^Runs a rewrite in a top-down traversal, succeeding if any succeed, and pruning below successesQApplies a rewrite to the first node where it can succeed in a bottom-up traversalPApplies a rewrite to the first node where it can succeed in a top-down traversaljAllows a one-sorted translation to be applied to any sort, failing at sorts different form the original=Lifts a translation into the Maybe monad, allowing it to fail:Runs a failable computation, replacing failure with mempty ‡Runs a translation in a top-down manner, combining its When run using MaybeT, returns its result for the last node where it succeded! Fold a tree in a top-down manner"CAn always successful top-down fold, replacing failures with mempty.% -. /012345 !"  !"   !"% -. /012345 !"6      !"#$%&'()*+,-./0123456789:compstrat-0.1.0.2'Data.Comp.Multi.Strategy.ClassificationData.Comp.Multi.Strategy.DeriveData.Comp.Multi.StrategicKDynCasekdyncaseDynCasedyncasedynProjcaseE makeDynCase GTranslateM TranslateM TranslateGRewrite GRewriteMRewriteRewriteMtryRpromoteR promoteRFallR>+>+>anyRoneRallbuRalltdRanybuRanytdRprunetdRonebuRonetdR promoteTFaddFailmtryMonetdTfoldtdTcrushtdT$fKDynCase:&:l $fDynCaseCxtl $fDynCaseKb$fKDynCase:+:l $fKDynCasefaabstractNewtypeQabstractNewtypeabstractConType tyVarBndrNamenewNamesOneRAnyRsubstsubst2wrapAnyR unwrapAnyRwrapOneR unwrapOneRdynamicR