>> Interesting challenge. Can we "prove" that cursors are "REQUIRED" in a
relational model? <<
There is a proof that a finite automata with a push-down stack can
solve the same set of problems as primitive recursive functions, so
declarative and procedural languages can do the same things.