====== Cvičení předmětu FLP ======
( [[courses:a4b33flp:2015::start | domů]] | [[lectures | přednášky]] | cvičení | [[assignments | úlohy]] )
===== Funkcionální programování =====
* [[courses:a4b33flp:internal:2012::scheme_cviceni|Scheme]]
* [[courses:a4b33flp:internal:2012:haskell_cviceni|Haskell]]
===== Logické programování =====
^ No. ^ Date ^ Topic ^
^ [[https://docs.google.com/present/view?id=0AUhT50rgdR0KZGNrOTNxODRfOTYyaG1rMmNjdw| 8.]] ^ // 3.4// | Prolog as a database: Facts, queries, simple recursion and Prolog search strategy. |
^ [[https://docs.google.com/present/view?id=0AUhT50rgdR0KZGNrOTNxODRfMTAwZnJ2N3A1Z3c| 9.]] ^ //10.4// | Unification, Lists, Proof trees for recursive predicates. |
^ [[https://docs.google.com/present/view?id=0AUhT50rgdR0KZGNrOTNxODRfMTAxdnhjZjRrMjc|10.]] ^ //17.4// | Cut, Tail-recursion, Efficient programming with cut. |
^ 11. ^ //24.3// | Search algorithms. |
^ 12. ^ // 1.5// | Search algorithms II. |
^ 13. ^ // 8.5// | Constraint logic programming. |
^ 14. ^ //15.5// | Dynamic predicates, credits. |