Difference between revisions of "Functional programming/en"
(Updating to match new version of source page) |
(Updating to match new version of source page) |
||
| Line 49: | Line 49: | ||
Schedule: | Schedule: | ||
| − | * Lecture 1: [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=1 Beginning] - [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=36 Page 34] (2 hours) | + | * Lecture 1: [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=1 Beginning] - [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=36 Page 34] (2 hours, PORUA1) |
| − | * Lecture 2: [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=35 Page 35] - [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=44 Page 42] (2 hours) | + | * Lecture 2: [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=35 Page 35] - [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=44 Page 42] (2 hours, PORUA1) |
* Lecture 3: no lecture | * Lecture 3: no lecture | ||
| − | * Lecture 4: [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=45 Page 43] - [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=57 Page 55] (2 hour) | + | * Lecture 4: [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=45 Page 43] - [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=57 Page 55] (2 hour, PORUA1) |
| − | * Lecture 5: [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=58 Page 56] - [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=65 Page 63] (1 hour) | + | * Lecture 5: [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=58 Page 56] - [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=65 Page 63] (1 hour, PORUA1) |
| − | * Lecture 6: [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=66 Page 64] - [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=72 Page 70] (1 hour) | + | * Lecture 6: [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=66 Page 64] - [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=72 Page 70] (1 hour, PORUA1) |
| − | * Lecture 7: Summary before Test 1 | + | * Lecture 7: Summary before Test 1 (POREC1) |
* Lecture 8: no lecture | * Lecture 8: no lecture | ||
| − | * Lecture 9: [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=73 Page 71] - [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=82 Page 80] (1 hour) + Solutions for Test 1 | + | * Lecture 9: [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=73 Page 71] - [http://linedu.vsb.cz/~beh01/wiki_data/Basics_of_FP.pdf#page=82 Page 80] (1 hour, PORUA1) + Solutions for Test 1 |
| − | * Lecture 10: Solutions for Homework 1 | + | * Lecture 10: Solutions for Homework 1 (POREC1) |
| − | * Lecture 11: Summary before Test 2 | + | * Lecture 11: Summary before Test 2 (POREC1) |
| − | * Lecture 12: Advanced topics (2 hours) | + | * Lecture 12: Advanced topics (2 hours, POREC1) |
| − | * Lecture 13: Advanced topics (2 hours) | + | * Lecture 13: Advanced topics (2 hours, POREC1) |
| − | * Lecture 14: Solutions for Homework 2 + Test 2 | + | * Lecture 14: Solutions for Homework 2 + Test 2 (POREC1) |
Revision as of 07:17, 29 August 2022
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/
- 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. The results of these tasks will be the crucial part of the final evaluation. 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:
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
Introduction to advanced topics of functional programming
Schedule:
- Lecture 1: Beginning - Page 34 (2 hours, PORUA1)
- Lecture 2: Page 35 - Page 42 (2 hours, PORUA1)
- Lecture 3: no lecture
- Lecture 4: Page 43 - Page 55 (2 hour, PORUA1)
- Lecture 5: Page 56 - Page 63 (1 hour, PORUA1)
- Lecture 6: Page 64 - Page 70 (1 hour, PORUA1)
- Lecture 7: Summary before Test 1 (POREC1)
- Lecture 8: no lecture
- Lecture 9: Page 71 - Page 80 (1 hour, PORUA1) + Solutions for Test 1
- Lecture 10: Solutions for Homework 1 (POREC1)
- Lecture 11: Summary before Test 2 (POREC1)
- Lecture 12: Advanced topics (2 hours, POREC1)
- Lecture 13: Advanced topics (2 hours, POREC1)
- Lecture 14: Solutions for Homework 2 + Test 2 (POREC1)
Laboratories
- Laboratory 1
- Laboratory 2
- Laboratory 3
- Laboratory 4
- Laboratory 5
- Laboratory 6
- Laboratory 7
- First programming test
- Laboratory 9 (1. Homework)
- Laboratory 10
- Laboratory 11
- Second programming test
- Laboratory 12 (2. Homework)
- Credits for the subject given. Student can repeat one of their tests.
Cheat sheet containing basic functions in PDF
Homework
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 31 (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)
