Yoneda - Category Theory

Trying to get intuition on Yoneda Lemma - is this proper specialization to Hask?:

newtype f ~> g = Nat{ ($~) :: forall x. f x -> g x }
data a <-> b = Iso{ from :: a -> b, to :: b -> a }

yoneda :: Functor f => ((->) a ~> f) <-> f a
yoneda = Iso ($~ id) (\fa -> Nat (<$> fa))

yup, looks right to me

Is there an example of how to use Yoneda Lemma in Haskell ? I always saw is used in proof for category theory but not used in the context of programming language.