====== Cvičení předmětu FLP ======
( [[courses:a4b33flp::start | domů]] | [[courses:a4b33flp:lectures | přednášky]] | cvičení | [[courses:a4b33flp:assignments | úlohy]] )
===== Funkcionální programování =====
* [[courses:a4b33flp:scheme_cviceni|Scheme]]
* [[courses:a4b33flp:haskell_cviceni|Haskell]]
^ No. ^ Datum ^^
^ 1. | //21.2// | //22.2// |
^ 2. | //28.2// | //29.2// |
^ 3. | //7.3// | //8.3// |
^ 4. | //14.3// | //15.3// |
^ 5. | //21.3// | //22.3// |
^ 6. | //28.3// | //29.3// |
^ 7. | //4.4// | //5.4// |
===== Logické programování =====
^ No. ^ Datum ^^ Téma ^
^ {{..:ae4b33flp:tut1.pdf| 8. }} ^ //11.4// ^ //12.4// | Test from functional part, Prolog as a database |
^ {{..:ae4b33flp:tut2.pdf| 9. }} ^ //18.4// ^ //19.4// | Unification, Lists. |
^ {{..:ae4b33flp:tut3.pdf| 10. }} ^ //25.4// ^ //26.4// | Cut, Tail-recursion, Efficient programming with cut. |
^ {{..:ae4b33flp:tut4.pdf| 11. }} ^ //9.5// ^ //3.5// | Search algorithms. |
^ {{..:ae4b33flp:tut5.pdf| 13. }} ^ //16.5// ^ //10.5// | Test from the logic part, proof trees for recursive predicates. |
^ {{..:ae4b33flp:tut6.pdf| 14. }} ^ //23.5// ^ //24.5// | Term manipulation, advanced algorithms. |