"Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I"
http://www-formal.stanford.edu/jmc/recursive.html
Amazing that one can define an entire language in terms of only seven functions and two special forms: atom, car, cdr, cond, cons, eq, quote, lambda, and label.
http://www-formal.stanford.edu/jmc/recursive.html
Amazing that one can define an entire language in terms of only seven functions and two special forms: atom, car, cdr, cond, cons, eq, quote, lambda, and label.