====== Cvičení předmětu FLP ======
( [[courses:a4b33flp:2015::start | domů]] | [[courses:a4b33flp:2015:lectures | přednášky]] | cvičení | [[courses:a4b33flp:2015:assignments | úlohy]] )
===== Funkcionální programování =====
* [[courses:a4b33flp:2015:scheme_cviceni|Scheme]]
* [[courses:a4b33flp:2014:haskell_cviceni|Haskell]]
===== Logické programování =====
^ No. ^ Date ^ Topic ^
^ [[https://docs.google.com/presentation/d/1S1dom_UUf9yMdt9QEzygmqYtG3RH0jBQydyXsp3gsCk/present?slide=id.i0 | 8.]] ^ // 2.4// | Prolog as a database: Facts, queries, simple recursion and Prolog search strategy. [[http://pastebin.com/DmFbbD1h | metro.pl]] |
^ [[https://docs.google.com/presentation/d/1krK4noKNG2REBjHkA8A73bvrFrQPo9yY3QplvJa5Cv4/present?slide=id.i0 | 9.]] ^ // 9.4// | Unification, Lists, Proof trees for recursive predicates. |
^ [[https://docs.google.com/presentation/d/17LPV3OfQH4ccF9a4lTDiiLn0RI2sKEgb1WLiXcj4dMM/present#slide=id.i0 | 10.]] ^ //16.4// | Cut, Tail-recursion, Efficient programming with cut. |
^ [[https://docs.google.com/presentation/d/1N70qNeD070vEZ3ZBPQQLPBc40yt9rvi8omBYI8VafCk/present?slide=id.i0 | 11.]] ^ //23.4// | TEST, Search algorithms I. {{..:ae4b33flp:evropa.zip|Map of europe}} |
^ 12. ^ //30.4// | Search algorithms II. |
^ 13. ^ //14.5// | Constraint logic programming + zápočty |