Îõ³h$³šé      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefgh Safe-InferredÉÖ×_pointed does not require a i$, as the only relationship between  and j is given by a free theorem. Safe-InferredÉÖ×’&'&'ë      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnlmoð$pointed-5.0.4-DWYJAL91rQfFVOcBNmqpIJData.Copointed Data.Pointed Copointedcopoint$fCopointed:.:$fCopointed:+:$fCopointedRec1 $fCopointedM1$fCopointedPar1$fCopointedMaybeApply$fCopointedWrappedApplicative$fCopointedArg$fCopointedWrappedMonoid$fCopointedMin$fCopointedMax$fCopointedLast$fCopointedFirst$fCopointedNonEmpty$fCopointedProduct$fCopointedSum$fCopointedDual$fCopointedWriterT$fCopointedWriterT0$fCopointedIdentityT$fCopointedReverse$fCopointedLift$fCopointedBackwards$fCopointedSum0$fCopointedCompose$fCopointedIdentity$fCopointedTagged$fCopointedTree$fCopointedStoreT$fCopointedEnvT$fCopointedTracedT$fCopointedWrappedMonad $fCopointed->$fCopointed(,,,)$fCopointed(,,)$fCopointed(,)Pointedpoint $fPointed:.: $fPointed:*: $fPointedM1 $fPointedRec1 $fPointedPar1 $fPointedU1$fPointedHashMap$fPointedListT$fPointedErrorT $fPointedLift$fPointedBackwards$fPointedReverse$fPointedWriterT$fPointedWriterT0 $fPointedRWST$fPointedRWST0$fPointedStateT$fPointedStateT0$fPointedConstant$fPointedReaderT$fPointedMaybeT$fPointedIdentityT$fPointedExceptT$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