Is it the case that all the cons cells at the base of the language are compiled into more efficient structures?
I looked into the Racket Repo to find something, but had a hard time finding the code.
Other Schemes and Common Lisp have similar constructs. Just because a language is a lisp doesn't mean its primitives have to be implemented using cons cells.
https://www.khoury.northeastern.edu/home/lth/larceny/notes/n...
Cons cells are typically used to provide lists with O(n) access time.