Racket Programming - Racket Programming Part 14: Back to Basics

It is time to revisit the basics, but in a different way. We discuss how to code a version of cons, car and cdr solely based on lambda expressions. This motivates a notion of mutable lists and cyclical s-expressions in Racket. As mentioned, information on the books "The Little Schemer" and "The Seasoned Schemer" can be found at: https://felleisen.org/matthias/books.html