====== Tutorials — ae4b33flp ======
( [[start | home]] | [[lectures | lectures]] | tutorials | [[.:2013:assignments | homework]] )
^ No. ^ Date ^ Topic ^
^ [[scheme#Scheme_Tutorial_1| 1.]] ^ //23.2// | Scheme. First look at Scheme and its environment. Program debugging. Basic examples. Recursion. Accumulator. |
^ [[scheme#Scheme_Tutorial_2| 2.]] ^ //2.3// | Operations with lists. |
^ [[scheme#Scheme_Tutorial_3| 3.]] ^ //9.3// | Lambda abstraction. Tail recursion. High-order functions. |
^ [[scheme#Scheme_Tutorial_4| 4.]] ^ //16.3// | Applications of Scheme. |
^ [[scheme#Scheme_Tutorial_5| 5.]] ^ //23.3// | Solving combinatorial problems: permutation generation, power set generation. |
^ [[haskell#Haskell_Tutorial_6| 6.]] ^ //30.3// | Haskell. First look at Haskell and its environment. Program debugging. Basic examples. |
^ [[haskell#Haskell_Tutorial_7| 7.]] ^ //6.4// | Haskell's type system. Automatic types and corresponding functions derivations. |
^ {{tut1.pdf| 8. }} ^ //13.4// | Test from functional part, Prolog as a database |
^ {{tut2.pdf| 9. }} ^ //20.4// | Unification, Lists. |
^ {{tut3.pdf| 10. }} ^ //27.4// | Cut, Tail-recursion, Efficient programming with cut. |
^ {{tut4.pdf| 11. }} ^ //4.5// | Search algorithms |
^ {{tut5.pdf| 13. }} ^ //18.5// | Test from the logic part, proof trees for recursive predicates. |
^ {{tut6.pdf| 14. }} ^ //25.5// | Term manipulation, advanced algorithms. |