úÎ ã òK      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJ Trustworthy does not require a K$, as the only relationship between  and L is given by a free theorem.    Trustworthy2 !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJ2JIHGFEDCBA@?>=<;:9876543210/.-,+*)('&%$#"! 1 !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJM      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPNOQR pointed-4.1.1Data.Copointed Data.Pointed Copointedcopoint$fCopointedStoreT$fCopointedEnvT$fCopointedMin$fCopointedMax$fCopointedLast$fCopointedFirst$fCopointedNonEmpty$fCopointedSum$fCopointedDual$fCopointedWriterT$fCopointedWriterT0$fCopointedIdentityT$fCopointedCoproduct$fCopointedCompose$fCopointedTree$fCopointed(,,,)$fCopointed(,,)$fCopointed(,)$fCopointedTracedT$fCopointed(->)$fCopointedIdentity$fCopointedTagged$fCopointedSum0Pointedpoint$fPointedStatic$fPointedStateT$fPointedStateT0$fPointedWriterT$fPointedWriterT0 $fPointedRWST$fPointedRWST0$fPointedReaderT$fPointedMaybeT$fPointedListT$fPointedIdentityT$fPointedExceptT$fPointedErrorT$fPointedContT$fPointedConstant$fPointedProduct $fPointedLift$fPointedBackwards$fPointedReverse$fPointedCompose $fPointedSet $fPointedSeq $fPointedMin $fPointedMax $fPointedLast$fPointedFirst$fPointedLast0$fPointedFirst0$fPointedProduct0 $fPointedSum $fPointedEndo $fPointedDual$fPointedWrappedArrow$fPointedConst$fPointedWrappedMonad $fPointed(,) $fPointed(->)$fPointedIdentity$fPointedZipList$fPointedNonEmpty $fPointedTree $fPointedSTM $fPointedIO$fPointedEither$fPointedMaybe $fPointed[]$fPointedTagged$fPointedProxybaseGHC.BaseFunctorfmap