460-2054/04 – Functional Programming (FPR)
| Gurantor department | Department of Computer Science | Credits | 4 |
| Subject guarantor | Ing. Marek Běhálek, Ph.D. | Subject version guarantor | Ing. Marek Běhálek, Ph.D. |
| Study level | undergraduate or graduate | | |
| | Study language | English |
| Year of introduction | 2023/2024 | Year of cancellation | |
| Intended for the faculties | FEI | Intended for study types | Bachelor |
Subject aims expressed by acquired skills and competences
The basic outcome will be the ability to write simple algorithms using a functional style of programing. More precisely, students will understand recursion and recursive data structures, they will be able to use high-order functions, and they will be able to define functions using the pattern matching. They will be able to use functional encapsulation mechanisms such as closures and modular interfaces and correctly reason about variables and lexical scope in programs. On practical level, they will be able to write these basic algorithms in programming language Haskell. Moreover, they will be able to recognize functional style of programming, they will understand advantages and disadvantages of this style of programming and they will be able to compare this style of programming with other approaches like imperative or object-oriented programming.
Teaching methods
Lectures
Individual consultations
Tutorials
Project work
Summary
The course introduces the functional style of programming. It covers basic properties of the functional programming like: the side effect-free programming, functions as first-class values, high-order functions, recursion, pattern matching, or function closures. Also, course introduces selected data structures like a list and a tree and a functional style of working with these structures. As a programming language, Haskell will be used. It is a pure functional, statically typed, lazy evaluated language.
Compulsory literature:
Recommended literature:
Thompson S.: The Haskell: The Craft of Functional Programming (3nd ed.). Addison-Wesley Professional, October 2, 2011, ISBN-10: 0201882957.
Lipovaca M.:Learn You a Haskell for Great Good!: A Beginner's Guide (1st ed.). No Starch Press, San Francisco, CA, USA, 2011 - for free at: http://learnyouahaskell.com/
Way of continuous check of knowledge in the course of semester
During the exercise, students will be programing assigned tasks. The results of these tasks will be the crucial part of the final evaluation. At least seven evaluated tasks will be given. It will be possible to get approximately 70 points for these tasks. Additionally, two smaller projects will be given. It will be possible to get remaining points for them.
E-learning
Other requirements
There are no additional requirements for students.
There are no additional requirements for students.
Prerequisities
Subject has no prerequisities.
Co-requisities
Subject has no co-requisities.
Subject syllabus:
List of presentations
Basic introduction to functional programming
1. Course introduction. Introduction to Functional programming. Introduction to programming in the language Haskell (using GHC interpreter).
2. Basic function definition. How to write a simple (recursive) functions in Haskell.
3. Basic data types and how to use them.
4. Defining functions revisited: pattern matching.
5. Lists and tuples - a basic notation, how to use them in programs.
6. Working with list.
7. Introduction of higher-order functions. Functions as a first-class value. Functions map - fold.
8. List comprehensions, list generators.
9. User defined data types and how to work with them.
10. Recursive data types and polymorphism, a partial function evaluation, basic introduction to type classes.
11. Abstract data types (list, queue, tree).
Advanced topics
11. Introduction to lambda calculus, computation as rewriting, lazy evaluation.
13. Input and output.
14. Programing language Elm.
List of laboratories (it is expected, that all laboratories will be in a computer laboratories)
1. GHC Interpreter - basic usage
2. Implementation of basic functions computing for example: factorial, Fibonacci sequence, or the greatest common divisor.
3. Functions and operators that work with numbers, strings or characters.
4. Implementation of more complex functions that uses pattern matching, guard expressions etc.
5. - 6. Implementation of functions that work with lists like: length, reverse, (++), zip, zipWith.
7. Usage of standard functions working with lists like map, fold, concat etc.
8. List generators.
9. Evaluaiton of first project.
10. Definition of a data type for mathematical expressions. Evaluation of such expressions.
11. Definition of a binnary tree. Implementation of a functions that work with such a tree.
12. Implementation of abstract data types - stack and queue.
13. Input and output in Haskell - writing to standard output, reading a file.
14. Evaluation of the second project.
Conditions for subject completion
Occurrence in study plans
Occurrence in special blocks
Assessment of instruction
Předmět neobsahuje žádné hodnocení.