====== Functional and Logic Programming — ae4b33flp ======
( home | [[lectures | lectures]] | [[tutorials | tutorials]] )
===== Summary ===== This course introduces students into the techniques of functional programming in the LISP (or more precisely SCHEME) and HASKELL language and logic programming in the PROLOG language. Both languages are declarative in that the programmer symbolically describes the problem to be solved, rather than enumerating the exact sequence of actions to be taken. In PROLOG, one describes the problem by specifying properties of objects and relations thereamong through logic formulas. In LISP, the problem description takes the form of function definitions. Both languages have found significant applications in artificial intelligence fields, such as agent systems or symbolic machine learning. Motivating tasks from these domains will be used throughout the course. ===== Credit requirements ===== The tutorials consist of two halves (Scheme + Prolog). Each is evaluated separately according to following rules: * Out of the total of 25 points, students must achieve at least 13 to be allowed to take the exam. * During the term, there will be a test (7 points) and 3 compulsory assignments (6 points each). ===== Assignments ===== === Scheme === - [[courses:ae4b33flp:assignments:Scheme_assignment_1|Maze Robot Simulation]] - [[courses:ae4b33flp:assignments:Scheme_assignment_2|Population Evaluator]] - [[courses:ae4b33flp:assignments:Scheme_assignment_3|Automatic Code Synthesis]] === Prolog === - [[courses:ae4b33flp:2011:prolog_assignment_1|Family Relations]] - [[courses:ae4b33flp:2011:prolog_assignment_2|Vector Formula]] ===== Exam ===== Students who receive the credit (based on points from the tutorials) are allowed to take the exam. The written exam has a theoretical part and a practical part (programming). Additional points can be obtained during the oral exam. For the exam a maximum of 50 points can be awarded. A minimum of 25 points must be achieved for a passing grade: ^ ^ Total points ^ Minimum for passing ^ | Tutorials (assignments + tests) | 50 | 26 | | Exam | 50 | **25** | The final grade is assigned according to the sum of tutorials and exam points. ^ ECTS grade | Pass ||||| Fail | ^ ::: | **A** | **B** | **C** | **D** | **E** | **F** | ^ Points | 100-90 | 89-80 | 79-70 | 69-60 | 59-50 | 50-0 | ===== External links ===== * [[https://cw.felk.cvut.cz/forum/forum-112.html|Course forum]] * [[http://cw.felk.cvut.cz/upload/|Assignment Upload System]] * [[http://www.feld.cvut.cz/education/rozvrhy-ng.B102/public/cz/predmety/12/81/p12819904.html|Timetable]] ===== Literature ===== * //Brian Harvey and Matthew Wright:// **Simply Scheme: Introducing Computer Science**, MIT Press, 1999, now [[http://www.cs.berkeley.edu/~bh/ss-toc2.html | available online]] * //Bryan O'Sullivan, Don Stewart, and John Goerzen:// **Real World Haskell**, Paperback: 700 pages, O'Reilly, November 2008, English, ISBN-10: 0596514980, ISBN-13: 978-0596514983 now [[http://book.realworldhaskell.org/read/|available online]] * //Peter Flach:// **Simply logical**, John Wiley 1994, xvi + 240 pages, now [[http://www.cs.bris.ac.uk/~flach/SimplyLogical.html | available online]] ===== Teachers ===== \\ ^ Lecturers ^^ Tutorial instructors ^^ | [[http://cyber.felk.cvut.cz/people/page.php?id=331&detailed=y|{{vyskocil_jiri-80x75.jpg|Jiří Vyskočil}}]] | [[http://ida.felk.cvut.cz/ida/members#zelezny|{{zelezny_filip-80x95.png|Filip Železný}}]] | [[http://ida.felk.cvut.cz/ida/members#cernoch|{{cernoch_radomir-80x95.jpg|Radomír Černoch}}]] | ^ [[vyskoji1@fel.cvut.cz | Jiří Vyskočil]] ^ [[zelezny@fel.cvut.cz | Filip Železný]] ^ [[radomir.cernoch@fel.cvut.cz | Radomír Černoch]] |