úÎ;c A chain of effectful f$-computations with composite result a. & Individual computations (lifted into Effects using  below) have their 2 own result types, which fit together in standard  fashion. A Although these result types are lost in the composite type, the = computations can still be moved around within the list (see  and  B in the source code for examples). This allows their permutations  to be computed. .Compute the length of a list of computations. CAllow a computation to be occur so many times in each permutation. GIf all the effects in the chain allow frequency 0, we can execute them  all 0 times and get a result. Build a tree (using  + for branching) of all permutations of the L computations. The tree shape allows permutations to share common prefixes. E This allows clever computations to quickly prune away uninteresting  branches of permutations. Through repeated 0ping, give each effect a chance to be the first  effect in the chain, producing n new chains where n is the  of D the input chain. In each case the relative order of the effects is E preserved with exception of the effect that was moved to the front. 9Swaps the first two elements of the list, if they exist.  1 represents the empty list of computations while   acts like  .  Map over the final result type.      PermuteEffects-0.2Control.PermuteEffects*.permsbaseControl.Applicative ApplicativeswapfirstsConsNillengtheffectsMatchEpsilon<|>$fApplicativeEffectspure<*>GHC.Base++$fFunctorEffects