Add lazy application operators

[treeowl]

($~) :: forall a (b :: TYPE rep). IsRecord a => (a -> b) -> a -> b
f $~ a = f $ lazify a

(<$~>) :: (Functor f, IsRecord a) => (a -> b) -> f a -> f b
f <$~> xs = (f $~) <$> xs

There should also be a Contravariant version, but I don't know its name yet.