This is a pretty technical question about conforming implementations of the ANSI Lisp spec:
In Section 2.3.4, it says that a token read as a symbol that's not available in the current package is interred as a new symbol in the current package.
In Section 3.1.2.1, it says that if a symbol isn't bound, an error is given.
What happens to unbound symbols between iterations of the REPL? Will a conforming implementation remove unbound symbols from the current package, or will it keep interning symbols until the REPL occupies all available memory?