Functional programming/en

Basic introduction

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.

Subject aims expressed by acquired skills and competences

The basic outcome of this course will be the ability to write simple algorithms using a functional style of programming. 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.

Recommended literature

• 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/

• Wiki Books: Haskell, for free at: https://en.wikibooks.org/wiki/Haskell

• O'Sullivan B., Goerzen J., Stewart D.: Real world Haskell, O'Reilly Media, Inc. 2008. ISBN:0596514980 - for free at: http://book.realworldhaskell.org/read/

• Thompson S.: The Haskell: The Craft of Functional Programming (3nd ed.). Addison-Wesley Professional, October 2, 2011, ISBN-10: 0201882957.

Way of continuous check of knowledge in the course of semester

During the exercises, students will be programming assigned tasks. Additionally, two smaller projects will be given.

Software

In our lectures, we will be using Haskell Platform with Visual Studio Code. For VS Code, we will be using an extension:

• Haskell

More information about various options for work environments can be found: Installation Guide

Presentations

Presentations used in our lectures:

Úvod do FPR Introduction to FPR

Základy funkcionálního programování

• Page 12 CZ
• Page 26 CZ
• Page 34 CZ
• Page 42 Lists Tuples CZ
• Page 48 Theory Example CZ
• Page 55 CZ
• Page 70 CZ
• Page 80 CZ

Basics of functional Programming

• Page 12 EN
• Page 26 EN
• Page 34 EN
• Page 42 EN
• Page 48 EN

Introduction to advanced topics of functional programming

Schedule:

1. Beginning - Page 34 (2 hours, PORUA1)
2. Page 35 - Page 42 (2 hours, PORUA1)
3. Page 43 - Page 55 (2 hour, PORUA1)
4. Page 56 - Page 70 (2 hour, PORUA1)
5. Summary before Test 1 (POREC1)
6. Summary before Homework 1 (POREC1)
7. No lecture
8. Page 71 - Page 80 (1 hour, POREC1) + Solutions for Test 1
9. Advanced topics (1 hours, POREC1) + Solutions for Homework 1
10. Advanced topics (2 hours, POREC1)
11. Advanced topics (1 hours, POREC1)
12. No lecture

Laboratories

1. Laboratory 1
2. Laboratory 2
3. Laboratory 3
4. Laboratory 4
5. Laboratory 5
6. Laboratory 7 + Laboratory 6
7. First programming test
8. Laboratory 9 + 1. Homework
9. Laboratory 10
10. Laboratory 11
11. Second programming test
12. 2. Homework + credits for the subject given. Student can repeat one of their tests.

Optional:

• Laboratory 12

Cheat sheet containing basic functions in PDF

Homework

• Homework 1
• Homework 2

Combine study

Tutorial 1

• Presentation Beginning - Page 34
• Laboratory 1
• Laboratory 2

Tutorial 2

• Presentation Page 35 - Page 46
• Laboratory 3
• Laboratory 4

Tutorial 3

• Presentation Page 47 - Page 63
• Laboratory 5
• Laboratory 6
• Laboratory 7
• There will be a short test (10 points)
• First homework will be assigned.

Tutorial 4

• Presentation Page 64 - Page 80
• Laboratory 9
• Laboratory 10
• Laboratory 11
• First homework will be evaluated (25 points).
• First programming exercise (20 points)

Tutorial 5

• Second homework will be assigned.
• Presentation Beginning - Page 53 (optional, it will not be tested)
• Laboratory 12 (optional, it will not be tested)

Tutorial 6

• Second homework will be evaluated (25 points).
• Second programming exercise (20 points)