====== Archive eFLP 2011: Tutorials ======
( [[courses:ae4b33flp:start | home]] | [[courses:ae4b33flp:lectures | lectures]] | tutorials )
^ No. ^ Date ^ Topic ^
^ [[courses:ae4b33flp:scheme#scheme_tutorial_1| 1.]] ^ //17.2// | Scheme. First look at Scheme and its environment. Program debugging. Basic examples. Recursion. Accumulator. |
^ [[courses:ae4b33flp:scheme#scheme_tutorial_2| 2.]] ^ //24.2// | Operations with lists. |
^ [[courses:ae4b33flp:scheme#scheme_tutorial_3| 3.]] ^ // 3.3// | Lambda abstraction. Tail recursion. High-order functions. |
^ [[courses:ae4b33flp:scheme#scheme_tutorial_4| 4.]] ^ //10.3// | Applications of Scheme. |
^ [[courses:ae4b33flp:scheme#scheme_tutorial_5| 5.]] ^ //17.3// | Solving combinatorial problems: permutation generation, power set generation. |
^ [[courses:ae4b33flp:haskell#haskell_tutorial_6| 6.]] ^ //24.3// | Haskell. First look at Haskell and its environment. Program debugging. Basic examples. |
^ [[courses:ae4b33flp:haskell#haskell_tutorial_7| 7.]] ^ //31.3// | Haskell's type system. Automatic types and corresponding functions derivations. |
^ [[.:prolog#prolog_tutorial_1basic_prolog| 8.]] ^ // 7.4// | Prolog as a database: Facts, queries, simple recursion and Prolog search strategy. [[courses:ae4b33flp:2011:prolog_assignment_1|Assignment 1]] |
^ [[.:prolog#prolog_tutorial_2lists| 9.]] ^ //14.4// | Unification, Lists, Proof trees for recursive predicates. |
^ [[.:prolog#prolog_tutorial_3code_efficiency|10.]] ^ //21.4// | Cut, Tail-recursion, Efficient programming with cut. |
^ [[.:prolog#prolog_tutorial_4searching_a_graph|11.]] ^ //28.4// | Search algorithms. |
^ [[.:prolog#prolog_tutorial_5searching_a_state-space|12.]] ^ // 5.5// | Search algorithms II. |
^ [[.:prolog#prolog_tutorial_6constraint_logic_programming|13.]] ^ //12.5// | Constraint logic programming. |
^ 14. ^ //19.5// | Dynamic predicates, credits. |