# **🌿 Booth: Lisp (1958)** * **Creator:** John McCarthy (MIT) * **Design Philosophy:** "LISt Processor" — built for symbolic computing and artificial intelligence research, treating program code and data identically. * **Key Innovations:** Automatic garbage collection, dynamic typing, first-class functions, recursion as a first-class control flow, and **homoiconic** syntax (everything is a list formatted as S-expressions: (operator operand1 operand2)). ## **🔮 Homoiconicity & S-Expressions** Lisp is famous for its nested parentheses. Because code is represented as nested list structures, a Lisp program can easily parse, generate, and manipulate other Lisp programs at runtime. This property of "code as data" is known as homoiconicity, and it makes Lisp exceptionally powerful for metaprogramming, macros, and symbolic logic. ## **🚀 Hello, World\!** (write-line "Hello, World\!") ## **🎨 Showpiece: Recursive List Length** Lisp avoids traditional iteration loops in favor of recursion. This snippet defines a function to recursively calculate the length of a list: ![][image1];; Define a recursive function to find the length of a list (defun my-list-length (lst) (if (null lst) 0 (+ 1 (my-list-length (cdr lst))))) ;; Let's test the function (let ((my-list '(apple banana cherry date))) (format t "The list contains \~D elements.\~%" (my-list-length my-list))) *Note: car returns the first element of a list, whereas cdr (pronounced "could-er") returns the rest of the list.* [image1]: