You must know the performance characteristics of your API. OO says nothing about performance. Sure, it's possible to have a random-access/list-like interface to a set of records ... on a file system, and assuming you're willing to take the initial hit for indexing should you want to seek to the end. But this assumes you are working with a file, and not a tape drive, socket, pipe, keyboard or other interface.
It also assume that memory is infinite. You do not get a "list of entries", you get an iterator (notice the "-or"!) of records. A reader doesn't know if you have enough memory to provide a list. A list does, or it had to provide a lot of work to fake it.
If you don't care about performance, memory constraints, latency, and other real-world factors then sure, your idealized world could do what you want. I don't live in that world, nor do you, nor does it seem that we'll get there in our lifetimes, nor does it seem reasonable to get rid of readers for the contexts I've mentioned, nor does it seem that people are confused by the "reader" suffix.
Again, I ask for your names that distinguish between something which reads from a streaming interface (what I call a reader) and something which supports random access lookup (what I call a list). I gave code; they do different things. You suggsted "list" for the first one; what do you call them?
I also asked you for what you think is the right name for a "generator".