úÎ!"S ß     SafeSX> ap-normalizeA delayed application of " which can be fused with an inner  or .vThis is the same definition as in the kan-extensions library, but we redefine it to not pay for all the dependencies. ap-normalize%Type of applicative difference lists.-An applicative transformer which accumulates f--actions in a left-nested composition using (). represents a sequence of f -actions  u1 :: f x1, ...  un :: f xn as "term with a hole"  (_ <*> u1 <*> ... <*> un) :: f r.That hole must have type _ :: f (x1 -> ... -> un -> r)c; the variable number of arrows is hidden by existential quantification and continuation passing..To help ensure that syntactic invariant, the  and  instances for  have no constraints. 3 is the only function whose signature requires an  f" constraint, wrapping each action u inside one (). ap-normalize#A difference list with one element u , denoted _ <*> u. ap-normalizeEComplete a difference list, filling the hole with the first argument.Safe&'½  ap-normalize5An applicative functor transformer which accumulates f-actions (things of type f x) in a normal form.It constructs a value of type f aF with the following syntactic invariant. It depends on the number of f -actions  a1 ... an* composing it, which are delimited using : Zero action: pure x One action: f <$> a1Two or more actions: $liftA2 f a1 a2 <*> a3 <*> ... <*> an ap-normalizef <$>^ u :: Aps f b is a delayed representation of f <$> u :: f b=, so that it can be fused with other applicative operations.f <$>^ u is a shorthand for f <$>  u. ap-normalizeu <*>^ v appends an f-action v to the right of an (  f)-action u.u <*>^ v is a shorthand for u <*>  v. ap-normalizeLift an f -action into   f. ap-normalize Lower an f -action from   f. ap-normalize#Append an action to the left of an  . ap-normalizeConversion from   to .  44Public interfaceSafe «          !+ap-normalize-0.1.0.0-2QeHNOPX4U46tR4dvD9814 ApNormalizeApNormalize.DListApNormalize.ApsControl.ApplicativeliftA2base Data.Function&YonedaApDList liftApDList lowerApDList$fFunctorYoneda$fApplicativeApDList$fFunctorApDListApsPureFmapLift LiftA2Aps<$>^<*>^liftApslowerAps liftA2Aps apsToApDList$fApplicativeAps $fFunctorApsGHC.Basefmap<*>Functor Applicative