Functional programming

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 17 CZ
• Page 37 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 17 EN
• Page 37 EN
• Page 34 EN
• Page 42 EN
• Page 48 EN

Tools for Haskell

Introduction to advanced topics of functional programming

Schedule:

1. Beginning - Page 19 (2 hours, PORUA1, 23.9.)
2. Page 19 - Page 61 (2 hours, PORUA1, 30.9.)
3. Page 61 - Page 62 (2 hour, PORUA1, 7.10.)
4. Page 63 - Page 83 (2 hour, PORUA1, 14.10)
5. No lecture (16.10.)
6. Summary before test and hints for Homework 1 (POREC1, 23.10.)
7. No lecture (30.10.)
8. Page 71 - Page 80 (1 hour, POREC1, 6.11.)
9. Advanced topics (2 hours, POREC1, 13.11.) + Solutions for Test 1
10. Advanced topics (2 hours, POREC1, 20.11.) + Solutions for Homework 1
11. Summary before Test 2 and hints for Homework 2 (POREC1, 27.11.)
12. No lecture - (4.12.)
13. No lecture - (11.12.)

Laboratories

1. Laboratory 1
2. Laboratory 2
3. Laboratory 3
4. Laboratory 4
5. Laboratory 5
6. Laboratory 6
7. Laboratory 7
8. First programming test
9. Laboratory 9 + 1. Homework
10. Laboratory 10
11. Laboratory 11
12. Second programming test
13. 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 49
• Laboratory 1
• Laboratory 2

Tutorial 2

• Presentation Page 50 - Page 67
• Laboratory 3
• Laboratory 4
• There will be a short test (10 points)

Tutorial 3

• Presentation Page 68 - Page 85
• Laboratory 5
• Laboratory 6
• Laboratory 7
• There will be a short test (10 points)

Tutorial 4

• First programming exercise (25 points)

Tutorial 5

• Presentation Page 84 - Page 100
• Presentation Beginning - Page 53 (optional, it

will not be tested)

• Homework will be assigned.
• Laboratory 9
• Laboratory 10
• Laboratory 11

Tutorial 6

• Second programming exercise (25 points)

Tutorial 7 (after Christmas, just a test)

• Programming exercise based on the homework (30 points).