Functional and Logic Programming
FIT-FLPAcad. year: 2018/2019
Practical applications and broader introduction into lambda calculus and predicate logic within the context of functional and logic programming languages. Within functional programming, abstract data types are discussed, as well as the use of recursion and induction, manipulation of lists and infinite data structures in language Haskell. Experience in logic programming is gained in programming languages Prolog (cut operator, state space search, database modification), CLP, and Goedel. Moreover, principles of their implementation are mentioned too.
Learning outcomes of the course unit
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.
Processing (analysis, evaluation/interpretation/compilation) of programming languages, predicate logic.
Recommended optional programme components
Recommended or required reading
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
Jones, S.P.: Haskell 98 Language and Libraries, Cambridge University Press, 2003, p. 272, ISBN 0521826144
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
- Mid-term exam, for which there is only one schedule and, thus, there is no possibility to have another trial.
- Two projects should be solved and delivered in a given date during a term.
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.
Language of instruction
Obtaining a basic knowledge and practical experience in functional and logic programming. Introduction into formal concepts used as a theoretical basis for both paradigms.
Specification of controlled education, way of implementation and compensation for absences
- 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).
Classification of course in study plans
- Programme IT-MGR-2 Master's
branch MBI , any year of study, summer semester, 5 credits, elective
branch MPV , any year of study, summer semester, 5 credits, compulsory-optional
branch MGM , any year of study, summer semester, 5 credits, compulsory-optional
branch MSK , any year of study, summer semester, 5 credits, elective
branch MMM , any year of study, summer semester, 5 credits, compulsory
branch MIS , 1. year of study, summer semester, 5 credits, compulsory
branch MBS , 1. year of study, summer semester, 5 credits, compulsory
branch MIN , 1. year of study, summer semester, 5 credits, compulsory
branch MMI , 1. year of study, summer semester, 5 credits, compulsory
Type of course unit
26 hours, optionally
Teacher / Lecturer
- Introduction to functional programming
- Lambda calculus
- Programming language Haskell, introduction, lists
- User-defined data types, type classes, and arrays in Haskell
- Input/Output in Haskell - type classes IO and Monad
- Proofs in functional programming
- Denotational semantics, implementation of functional languages
- Introduction to logic programming, Prolog
- Lists, cut operator, and sorting in Prolog
- Data structures, text strings, operators - extensions of SWI Prolog
- Searching state space, clause management, and parsing in Prolog
- Goedel - logic programming language not using Horn clauses
- Implementation of logic languages, CLP, conclusion
Exercise in computer lab
12 hours, compulsory
Teacher / Lecturer
- Haskell - basic language features, recursion, lists, partial application, higher-order functions (map, filter, foldX), infinite lists, partial evaluation
- Haskell - data types, monads, I/O
- Haskell - demonstration - construction of a simple interpreter using library Parsec
- Prolog - program structure, recursion, lists
- Prolog - dynamic predicates, advanced example on dynamic predicates
- Prolog - more advanced examples, tests on variable instantiation, state space search