Apologies, we were late this ¡­

Apologies, we were late this week in releasing a model solution for problem set (1a) and the next part of the first obligatory assignment, problem set (1b); both are now linked from the detailed course schedule (see the laboratory sections for this week and the following one). In the laboratory tomorrow, we will walk you through selected parts of our model solution, discuss contrastively your solutions and ours, and answer questions of all kinds. In doing so, we will comment more on some of the Lisp constructs we learned in the previous lecture. On Friday, we will lecture a little more about Lisp data structures and finer points of (local) variable binding, and then move on into our first (basic) search problem: a recognition procedure for non-deterministic finite-state automata.