The memoizing store (state-in-context/costate) comonad transformer is
subject to the laws:

x = seek (pos x) x
y = pos (seek y x)
seek y x = seek y (seek z x)

This version of the transformer lazily memoizes the result of applying the
comonad to the current state. This can be useful for avoiding redundant
computation if you reuse the same StoreT object multiple times.