úΪ Ï]      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\Safe>L does not require a ]$, as the only relationship between  and ^ is given by a free theorem.     None>L= !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ != !\[ZYXWVUTSRQPONMLKJIHGFEDCBA@?>=<;:9876543210/.-,+*)('&%$#"< !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\_      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`ab`acdpoint_LnhMtAEQWU5AMQ3TxowkS1Data.Copointed Data.Pointed Copointedcopoint$fCopointedMaybeApply$fCopointedWrappedApplicative$fCopointedArg$fCopointedWrappedMonoid$fCopointedMin$fCopointedMax$fCopointedLast$fCopointedFirst$fCopointedNonEmpty$fCopointedSum$fCopointedDual$fCopointedWriterT$fCopointedWriterT0$fCopointedIdentityT$fCopointedReverse$fCopointedLift$fCopointedBackwards$fCopointedSum0$fCopointedCompose$fCopointedIdentity$fCopointedTagged$fCopointedTree$fCopointedStoreT$fCopointedEnvT$fCopointedTracedT$fCopointedWrappedMonad$fCopointed(->)$fCopointed(,,,)$fCopointed(,,)$fCopointed(,)Pointedpoint$fPointedHashMap $fPointedLift$fPointedBackwards$fPointedReverse$fPointedWriterT$fPointedWriterT0 $fPointedRWST$fPointedRWST0$fPointedStateT$fPointedStateT0$fPointedConstant$fPointedReaderT$fPointedMaybeT$fPointedListT$fPointedIdentityT$fPointedExceptT$fPointedErrorT$fPointedContT$fPointedProduct$fPointedCompose$fPointedTagged$fPointedProxy $fPointedSTM $fPointedArg$fPointedWrappedMonoid$fPointedOption $fPointedMin $fPointedMax $fPointedLast$fPointedFirst$fPointedNonEmpty$fPointedMaybeApply$fPointedWrappedApplicative$fPointedStatic$fPointedCurried $fPointedSet$fPointedViewR$fPointedViewL $fPointedSeq $fPointedMap $fPointedTree$fPointedCokleisli$fPointedLast0$fPointedFirst0$fPointedProduct0 $fPointedSum $fPointedEndo $fPointedDual$fPointedWrappedArrow$fPointedWrappedMonad$fPointedConst $fPointed(,) $fPointed(->)$fPointedIdentity$fPointedZipList $fPointedIO$fPointedEither$fPointedMaybe $fPointed[]baseGHC.BaseFunctorfmap