These slides are under constant construction during the term. They are scaled for use in the classroom by projection in a classroom for 50 people. I set the browser with maximal sized fonts, both variable and fixed width, of 24pt and scalable. This also is OK for viewing on a 17" monitor. Some of these sets of slides were not used this term and are incorrectly formated, having been transfered in ascii instead of latex. Earlier sets of slides have a lot of hand-editing in html whereas later ones are generated entirely using latex2html.

• Chapter One - Data and operators
• Chapter Two - Procedures and recursion
• Chapter Three - Data abstraction
• Chapter Four - Data-driven recursion
• Chapter Five - Locally defined procedures and environments
• Chapter Seven - Abstracting procedures
• Evaluation and Environments
• The Scheme Interpreter
• The Lambda Calculus
• Example of recursion in Lambda Calculus
• Interpretation using an explicit state - The SECD Machine
• Chapter Eleven - Mutation
• Chapter Twelve - Objects
• Chapter Fourteen - Macros
• Chapter Fifteen - Streams
• Chapters Sixteen and Seventeen - Continuations
• Interpretation using continuations

• Functional programming concepts
• ML
• Types
• Expressions
• Val definitions
• Function definitions
• Summary of ML expression and definition forms
• Examples of ML programs, from Paulson's book
• Polymorphism
• Defining New Types
• Type checking
• The ML module system

• Programming multiagent systems
• Programming in April
• April tutorial and user's manual
• Frank and the Mobilets
• Contract Net in April - Keith Clark's notes
• Agent0 in April - Keith Clark's notes
• Speech Acts in April - Keith Clark's notes