Functional and Logic Programming

• 26 hrs lectures
• 12 hrs pc labs
• 14 hrs projects

• 60 pts final exam (written part)
• 20 pts mid-term test (written part)
• 20 pts projects

Students will get basic knowledge and practical experience in functional and logic programming (two important representatives of declarative programming). Moreover, they will get basic information about theoretical basis of both paradigms and implementation techniques.

Use and understanding of recursion for expression of algorithms.

Obtaining a basic knowledge and practical experience in functional and logic programming. Introduction into formal concepts used as a theoretical basis for both paradigms.

Processing (analysis, evaluation/interpretation/compilation) of programming languages, predicate logic.

• Thompson, S.: Haskell, The Craft of Functional Programming, ADDISON-WESLEY, 1999, ISBN 0-201-34275-8
• Nilsson, U., Maluszynski, J.: Logic, Programming and Prolog (2ed), John Wiley & Sons Ltd., 1995
• Hill, P., Lloyd, J.: The Gödel Programming Language, MIT Press, 1994, ISBN 0-262-08229-2
• Bieliková, M., Návrat, P.: Funkcionálne a logické programovanie, Vydavateĺstvo STU, Vazovova 5, Bratislava, 2000.

• Thompson, S.: Haskell, The Craft of Functional Programming, ADDISON-WESLEY, 1999, ISBN 0-201-34275-8
• Nilsson, U., Maluszynski, J.: Logic, Programming and Prolog (2ed), John Wiley & Sons Ltd., 1995
• Hill, P., Lloyd, J.: The Gödel Programming Language, MIT Press, 1994, ISBN 0-262-08229-2
• Bieliková, M., Návrat, P.: Funkcionálne a logické programovanie, Vydavateĺstvo STU, Vazovova 5, Bratislava, 2000.
• Jones, S.P.: Haskell 98 Language and Libraries, Cambridge University Press, 2003, p. 272, ISBN 0521826144

1. Introduction to functional programming
2. Lambda calculus
3. Programming language Haskell, introduction, lists
4. User-defined data types, type classes, and arrays in Haskell
5. Input/Output in Haskell - type classes IO and Monad
6. Proofs in functional programming
7. Denotational semantics, implementation of functional languages
8. Introduction to logic programming, Prolog
9. Lists, cut operator, and sorting in Prolog
10. Data structures, text strings, operators - extensions of SWI Prolog
11. Searching state space, clause management, and parsing in Prolog
12. Goedel - logic programming language not using Horn clauses
13. Implementation of logic languages, CLP, conclusion

1. Haskell - basic language features, recursion, lists, partial application, higher-order functions (map, filter, foldX), infinite lists, partial evaluation
2. Haskell - data types, monads, I/O
3. Haskell - demonstration - construction of a simple interpreter using library Parsec
4. Prolog - program structure, recursion, lists
5. Prolog - dynamic predicates, advanced example on dynamic predicates
6. Prolog - more advanced examples, tests on variable instantiation, state space search

At the end of a term, a student should have at least 50% of points that he or she could obtain during the term; that means at least 20 points out of 40. Plagiarism and not allowed cooperation will cause that involved students are not classified and disciplinary action can be initiated.

• Mid-term exam - written form, questions and exercises to be answered and solved, no possibility to have a second/alternative trial - 20 points.
• Projects realization - 2 projects, implementation of a simple program according to the given specification - one in a functional programming language the other in a logic programming language - 20 points all projects together.
• Final exam - written form, questions and exercises to be answered and solved, 2 another corrections trials possible (60 points - the minimal number of points which can be obtained from the final exam is 25, otherwise, no points will be assigned to a student).