Lectures — ae4b33flp
( home | lectures | tutorials | homework )
Scheme Lecture 1
No. | Date | Topic |
1. | 14.2 | Introduction to declarative programming languages. Comparison to classical imperative languages. Introduction to programming for artificial intelligence. |
2. | 21.2 | Lisp and Scheme: basic language idioms, atoms, lists, recursion. |
3. | 28.2 | Scheme: lambda abstraction, built-in functions, advanced data structures. |
4. | 7.3 | Scheme: relations between iterations and tail recursion optimisations guaranteed by the language standard, built-in high-order functions. |
5. | 14.3 | Scheme: state space search, applications in artificial intelligence. |
Haskell Lecture 6
No. | Date | Topic |
6. | 21.3 | Haskell: types, patterns, built-in functions, lambda abstraction. |
7. | 28.3 | Haskell: advanced properties of the language in comparison to Scheme. |
Prolog (we follow Peter Flach's Simply Logical course book)
No. | Date | Topic |
8. | 4.4 | Prolog: facts, rules and queries. Recursion. Query answering. |
9. | 11.4 | Prolog: functions and list operations (SL chapter 1 cont'd) |
10. | 18.4 | Prolog and logic: clauses, Herbrand base, interpretation, model, closed-world assumption, decidability. |
11. | 25.4 | Cut and negation. Extralogical operators, arithmetics. |
12a. 12b. | 9.5 | Combinatorial search in Prolog. |
13. | 16.5 | Induction in Prolog |