A translation of the original Lisp to Python in about 150 lines of code. Impressive.

PTTP is an implementation of the model elimination theorem-proving procedure that extends Prolog to the full first-order predicate calculus.

An excellent computer science text used in introductory courses at MIT. One of the bibles of the LISP/Scheme world.

An essay written a while ago (1986 or so) by Richard M Stallman (RMS), about his experiences at the MIT AI Lab, and the story of the Lisp Machine Wars.

6.844 is a graduate introduction to programming theory, logic of programming, and computability, with the programming language Scheme used to crystallize computability constructions and as an object of study itself.

"Python supports all of Lisp's essential features except macros, and you don't miss macros all that much because it does have eval, and operator overloading, and regular expression parsing, so you can create custom languages that way."

Call a program "elegant" if no smaller program has the same output. I.e., a LISP S-expression is defined to be elegant if no smaller S-expression has the same value. It is impossible to prove that any particular large program is elegant.

99 problems in list processing, arithmetic, logic, codes, data structures, graphs, sudoku, etc.

Chaitin compares and contrasts Gödel's, Turing's and his own work in a straight-forward manner using Lisp.

What if the syntax and semantics of a programming language were specified in a library, rather than built into the language, and thus could be swapped or extended at will just like any other library?

Complete online version of Practical Common Lisp by Peter Seibel.

A life with Lisp blog

How to Understand and Use Common Lisp