"First we shall introduce symbolic, conditional and meta expressions and their recursive definitions with the $\lambda$-notation. Then we will briefly describe how such expressions might be represented by a computer. We shall introduce the Lisp REPL and use it to explore a number of basic Lisp paradigms such as closures, functional programming and Lisp macros. Finally we shall look at the past and present of Lisp as a language."
For people who know Lisp the Lispy part will be less interesting since this is only introductory level material, but the Lisp history part might be interesting.
For people who do not know Lisp the history part might be slightly less interesting but the Lispy part might be more interesting.
Lecture slides in Portable Document Format (PDF) or in LaTeX Format.
Back to the Club's homepage