====== Archive eFLP 2011: Lectures ======
( [[courses:ae4b33flp:start | home]] | lectures | [[courses:ae4b33flp:tutorials | tutorials]] )
[[courses:ae4b33flp:scheme]] ^ No. ^ Date ^ Topic ^ ^ [[courses:ae4b33flp:scheme#scheme_lecture_1|1.]] ^ //17.2// | Introduction to declarative programming languages. Comparison to classical imperative languages. Introduction to programming for artificial intelligence. | ^ [[courses:ae4b33flp:scheme#scheme_lecture_2|2.]] ^ //24.2// | Lisp and Scheme: basic language idioms, atoms, lists, recursion. | ^ [[courses:ae4b33flp:scheme#scheme_lecture_3|3.]] ^ // 3.3// | Scheme: lambda abstraction, built-in functions, advanced data structures. | ^ [[courses:ae4b33flp:scheme#scheme_lecture_4|4.]] ^ //10.3// | Scheme: relations between iterations and tail recursion optimisations guaranteed by the language standard, built-in high-order functions. | ^ [[courses:ae4b33flp:scheme#scheme_lecture_5|5.]] ^ //17.3// | Scheme: state space search, applications in artificial intelligence. | [[courses:ae4b33flp:haskell]] ^ No. ^ Date ^ Topic ^ ^ [[courses:ae4b33flp:haskell#haskell_lecture_6|6.]] ^ //24.3// | Haskell: types, patterns, built-in functions, lambda abstraction. | ^ [[courses:ae4b33flp:haskell#haskell_lecture_7|7.]] ^ //31.3// | Haskell: advanced properties of the language in comparison to Scheme. | Prolog (we follow Peter Flach's {{http://www.cs.bris.ac.uk/~flach/SimplyLogical.html|Simply Logical course book}}) ^ No. ^ Date ^ Topic ^ ^ {{http://www.cs.bris.ac.uk/~flach/SL/slides/SLchapter1.pdf|8.}} ^ // 7.4// | Prolog: facts, rules and queries. Recursion. Query answering. | ^ {{http://www.cs.bris.ac.uk/~flach/SL/slides/SLchapter1.pdf|9.}} ^ //14.4// | Functions, unification, list operations. | ^ {{http://www.cs.bris.ac.uk/~flach/SL/slides/SLchapter2.pdf|10.}} ^ //21.4// | Prolog and logic: clauses, Herbrand base, interpretation, model, closed-world assumption, decidability. | ^ {{http://www.cs.bris.ac.uk/~flach/SL/slides/SLchapter3.pdf|11.}} ^ //28.4// | Cut and negation. Extralogical operators, arithmetics. | ^ {{http://www.cs.bris.ac.uk/~flach/SL/slides/SLchapter5.pdf|12.}} ^ // 5.5// | Combinatorial search in Prolog. | ^ 13. ^ //12.5// | Constraint logic programming. | ^ {{http://www.cs.bris.ac.uk/~flach/SL/slides/SLchapter7.pdf|14.}} ^ //19.5// | Definite clause grammar. |