Difference between revisions of "Functional programming"

From Marek Běhálek Wiki
Jump to navigation Jump to search
 
(149 intermediate revisions by the same user not shown)
Line 1: Line 1:
 
<translate>
 
<translate>
−
<!--T:1-->
+
== Basic introduction == <!--T:1-->  
−
== 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.
+
<!--T:4-->
 +
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===
+
===Subject aims expressed by acquired skills and competences=== <!--T:5-->
  
 +
<!--T:6-->
 
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.  
 
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===
+
===Recommended literature=== <!--T:7-->
−
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/
+
*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===
+
<!--T:37-->
−
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.  
+
*Wiki Books: Haskell, for free at: https://en.wikibooks.org/wiki/Haskell
 +
 
 +
<!--T:8-->
 +
*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/
 +
 
 +
<!--T:9-->
 +
*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=== <!--T:10-->
 +
During the exercises, students will be programming assigned tasks. Additionally, two smaller projects will be given.
 +
 
 +
== Software == <!--T:15-->
 +
In our lectures, we will be using [https://www.haskell.org/downloads/#platform Haskell Platform] with [https://code.visualstudio.com/ Visual Studio Code]. For VS Code, we will be using an extension:
 +
*[https://marketplace.visualstudio.com/items?itemName=haskell.haskell Haskell]
 +
 
 +
<!--T:31-->
 +
More information about various options for work environments can be found: [[FP_installation_guide | Installation Guide]]
 +
 
 +
== Presentations == <!--T:11-->
 +
</translate>
 +
<span id="presentations"></span>
 +
<translate>
 +
<!--T:12-->
 +
Presentations used in our lectures:
 +
</translate>
 +
 
 +
[http://linedu.vsb.cz/~beh01/wiki_data/FP_uvod.pdf Úvod do FPR] [http://linedu.vsb.cz/~beh01/wiki_data/FP_introduction.pdf Introduction to FPR]
 +
 
 +
[http://linedu.vsb.cz/~beh01/wiki_data/FP_zaklady.pdf Základy funkcionálního programování]
 +
*[http://linedu.vsb.cz/~beh01/wiki_data/FP_zaklady.pdf#page=19 Page 17] [[File:Video logo.png|80px|link=https://youtu.be/641a45ILdkc]] CZ
 +
*[http://linedu.vsb.cz/~beh01/wiki_data/FP_zaklady.pdf#page=39 Page 37] [[File:Video logo.png|80px|link=https://youtu.be/6eXCGAlI3FM]] CZ
 +
*[http://linedu.vsb.cz/~beh01/wiki_data/FP_zaklady.pdf#page=36 Page 34] [[File:Video logo.png|80px|link=https://youtu.be/RlQumT3LNfI]] CZ
 +
*[http://linedu.vsb.cz/~beh01/wiki_data/FP_zaklady.pdf#page=44 Page 42] Lists [[File:Video logo.png|80px|link=https://youtu.be/qJyi7fuICT0]] Tuples [[File:Video logo.png|80px|link=https://youtu.be/axb0WOROuf0]] CZ
 +
*[http://linedu.vsb.cz/~beh01/wiki_data/FP_zaklady.pdf#page=50 Page 48] Theory [[File:Video logo.png|80px|link=https://youtu.be/XINafdmXTIE]] Example [[File:Video logo.png|80px|link=https://youtu.be/6jawdNysjs8]] CZ
 +
*[http://linedu.vsb.cz/~beh01/wiki_data/FP_zaklady.pdf#page=57 Page 55] [[File:Video logo.png|80px|link=https://youtu.be/QHtGADjvwCU]] CZ
 +
*[http://linedu.vsb.cz/~beh01/wiki_data/FP_zaklady.pdf#page=72 Page 70] [[File:Video logo.png|80px|link=https://youtu.be/Tf7tyJbHDuo]] CZ
 +
*[http://linedu.vsb.cz/~beh01/wiki_data/FP_zaklady.pdf#page=82 Page 80] [[File:Video logo.png|80px|link=https://youtu.be/tOmNZNCWICg]] CZ
 +
 
 +
[http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf Basics of functional Programming]
 +
*[http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=19 Page 17] [[File:Video logo.png|80px|link=https://youtu.be/ZAR4ZPkTRSI]] EN
 +
*[http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=39 Page 37] [[File:Video logo.png|80px|link=https://youtu.be/se5G4KjvGh8]] EN
 +
*[http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=36 Page 34] [[File:Video logo.png|80px|link=https://youtu.be/jgOIsTomglM]] EN
 +
*[http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=44 Page 42] [[File:Video logo.png|80px|link=https://youtu.be/GeFUKjhz46s]] EN
 +
*[http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=50 Page 48] [[File:Video logo.png|80px|link=https://youtu.be/xKEMJPES9K4]] EN
 +
 
 +
[http://linedu.vsb.cz/~beh01/wiki_data/PFP_tools.pdf Tools for Haskell]
 +
 
 +
[http://linedu.vsb.cz/~beh01/wiki_data/FP_advanced.pdf Introduction to advanced topics of functional programming]
 +
 
 +
<translate>
 +
<!--T:20-->
 +
Schedule:
 +
</translate>
 +
# [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=1 Beginning] - [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=31 Page 29] (2 hours, PORUA1, 18.9.)
 +
# [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=32 Page 30] - [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=49 Page 47] (2 hours, PORUA1, 25.9.)
 +
# [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=49 Page 47] - [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=64 Page 62] (2 hour, PORUA1, 2.10.)
 +
# [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=65 Page 63] - [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=85 Page 83] (2 hour, PORUA1, 9.10)
 +
# No lecture (16.10.)
 +
# Summary before test and hints for Homework 1 (POREC1, 23.10.)
 +
# No lecture (30.10.)
 +
# [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=73 Page 71] - [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=82 Page 80] (1 hour, POREC1, 6.11.)
 +
#  Advanced topics (2 hours, POREC1, 13.11.) + Solutions for Test 1
 +
# Advanced topics (2 hours, POREC1, 20.11.) + Solutions for Homework 1
 +
# Summary before Test 2 and hints for Homework 2 (POREC1, 27.11.)
 +
# No lecture - (4.12.)
 +
# No lecture - (11.12.)
 +
<translate>
 +
 
 +
== Laboratories == <!--T:13-->
 +
</translate>
 +
{{anchor|laboratories}}
 +
# [[FP_Laboratory_1 | Laboratory 1]]
 +
# [[FP_Laboratory_2 | Laboratory 2]]
 +
# [[FP_Laboratory_3 | Laboratory 3]]
 +
# [[FP_Laboratory_4 | Laboratory 4]]
 +
# [[FP_Laboratory_5 | Laboratory 5]]
 +
# [[FP_Laboratory_6 | Laboratory 6]]
 +
# [[FP_Laboratory_7 | Laboratory 7]] 
 +
# First programming test
 +
# [[FP_Laboratory_9 | Laboratory 9]]  + 1. Homework
 +
# [[FP_Laboratory_10 | Laboratory 10]]
 +
# [[FP_Laboratory_11 | Laboratory 11]]
 +
# Second programming test
 +
# 2. Homework + credits for the subject given. Student can repeat one of their tests.
 +
 
 +
Optional:
 +
* [[FP_Laboratory_12 | Laboratory 12]]
 +
<translate>
 +
<!--T:28-->
 +
Cheat sheet containing basic functions in [http://linedu.vsb.cz/~beh01/wiki_data/FP_cheatsheet.pdf PDF]
 +
 
 +
== Homework == <!--T:26-->
 +
 
 +
<!--T:27-->
 +
* [[FP_Homework_1 | Homework 1]]
 +
* [[FP_Homework_2 | Homework 2]]
 +
 
 +
== Combine study == <!--T:29-->
 +
=== Tutorial 1 ===
 +
* Presentation [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=1 Beginning] - [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=49 Page 47]
 +
* [[FP_Laboratory_1 | Laboratory 1]]
 +
* [[FP_Laboratory_2 | Laboratory 2]]
 +
 
 +
=== Tutorial 2 === <!--T:32-->
 +
* Presentation [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=50 Page 48] - [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=64 Page 62]
 +
* [[FP_Laboratory_3 | Laboratory 3]]
 +
* [[FP_Laboratory_4 | Laboratory 4]]
 +
 
 +
=== Tutorial 3 === <!--T:33-->
 +
* Presentation [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=65 Page 63] - [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=85 Page 83]
 +
* [[FP_Laboratory_5 | Laboratory 5]]
 +
* [[FP_Laboratory_6 | Laboratory 6]]
 +
* [[FP_Laboratory_7 | Laboratory 7]]
 +
* There will be a short test (10 points)
 +
* First homework will be assigned.
 +
 
 +
=== Tutorial 4 === <!--T:34-->
 +
* Presentation [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=86 Page 84] - [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=102 Page 100]
 +
* [[FP_Laboratory_9 | Laboratory 9]]
 +
* [[FP_Laboratory_10 | Laboratory 10]]
 +
* [[FP_Laboratory_11 | Laboratory 11]]
 +
* First homework will be evaluated (25 points).
 +
* First programming exercise (20 points)
 +
 
 +
=== Tutorial 5 === <!--T:35-->
 +
* Second homework will be assigned.
 +
* Presentation [http://linedu.vsb.cz/~beh01/wiki_data/FP_advanced.pdf#page=1 Beginning] - [http://linedu.vsb.cz/~beh01/wiki_data/FP_advanced.pdf#page=55 Page 53] (optional, it will not be tested)
 +
* [[FP_Laboratory_12 | Laboratory 12]] (optional, it will not be tested)
 +
 
 +
=== Tutorial 6 === <!--T:36-->
 +
* Second homework will be evaluated (25 points).
 +
* Second programming exercise (20 points)
  
 
</translate>
 
</translate>

Latest revision as of 08:59, 27 November 2023

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

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í

Basics of functional Programming

Tools for Haskell

Introduction to advanced topics of functional programming

Schedule:

  1. Beginning - Page 29 (2 hours, PORUA1, 18.9.)
  2. Page 30 - Page 47 (2 hours, PORUA1, 25.9.)
  3. Page 47 - Page 62 (2 hour, PORUA1, 2.10.)
  4. Page 63 - Page 83 (2 hour, PORUA1, 9.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:

Cheat sheet containing basic functions in PDF

Homework

Combine study

Tutorial 1

Tutorial 2

Tutorial 3

Tutorial 4

Tutorial 5

Tutorial 6

  • Second homework will be evaluated (25 points).
  • Second programming exercise (20 points)
Retrieved from "http://behalek.cs.vsb.cz/wiki/index.php?title=Functional_programming&oldid=3786"