Difference between revisions of "Functional programming"

From Marek Běhálek Wiki
Jump to navigation Jump to search
(Marked this version for translation)
 
(5 intermediate revisions by the same user not shown)
Line 11: Line 11:
  
 
===Recommended literature=== <!--T:7-->
 
===Recommended literature=== <!--T:7-->
 +
</translate>
 
*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/
  
−
<!--T:37-->
 
 
*Wiki Books: Haskell, for free at: https://en.wikibooks.org/wiki/Haskell
 
*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/
 
*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.
 
*Thompson S.: The Haskell: The Craft of Functional Programming (3nd ed.). Addison-Wesley Professional, October 2, 2011, ISBN-10: 0201882957.
−
 
+
<translate>
 
===Way of continuous check of knowledge in the course of semester=== <!--T:10-->
 
===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.  
 
During the exercises, students will be programming assigned tasks. Additionally, two smaller projects will be given.  
Line 69: Line 67:
 
# [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=1 Beginning] - [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=21 Page 19] (2 hours, PORUA1, 23.9.)
 
# [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=1 Beginning] - [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=21 Page 19] (2 hours, PORUA1, 23.9.)
 
# [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=21 Page 19] - [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=63 Page 61] (2 hours, PORUA1, 30.9.)
 
# [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=21 Page 19] - [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=63 Page 61] (2 hours, PORUA1, 30.9.)
−
# [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=63 Page 61] - [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=64 Page 62] (2 hour, PORUA1, 7.10.)
+
# [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=63 Page 61] - [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=76 Page 74] (2 hour, PORUA1, 7.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, 14.10)
+
# [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=77 Page 75] - [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=85 Page 83] (1 hour, PORUA1, 14.10)
−
# No lecture (16.10.)
+
# No lecture (21.10.)
−
# Summary before test and hints for Homework 1 (POREC1, 23.10.)
+
# Summary before test (POREC1, 28.10.)  
−
# No lecture (30.10.)
+
# [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=77 Page 75] - [http://linedu.vsb.cz/~beh01/wiki_data/FP_basics.pdf#page=85 Page 83] (1 hour, POREC1, 4.11.)  
−
# [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, 11.11.) + Solutions for Test 1
−
# Advanced topics (2 hours, POREC1, 13.11.) + Solutions for Test 1
+
# Advanced topics (1 hours, POREC1, 18.11.) + Summary before Test 2
−
# Advanced topics (2 hours, POREC1, 20.11.) + Solutions for Homework 1
+
# Advanced topics (1 hours, POREC1, 25.11.) + Summary before Test 3
−
# Summary before Test 2 and hints for Homework 2 (POREC1, 27.11.)
+
# No lecture - (2.12.)  
−
# No lecture - (4.12.)  
+
# No lecture - (9.12.)  
−
# No lecture - (11.12.)  
 
 
<translate>
 
<translate>
  
Line 90: Line 87:
 
# [[FP_Laboratory_4 | Laboratory 4]]
 
# [[FP_Laboratory_4 | Laboratory 4]]
 
# [[FP_Laboratory_5 | Laboratory 5]]
 
# [[FP_Laboratory_5 | Laboratory 5]]
−
# [[FP_Laboratory_6 | Laboratory 6]]
+
# [[FP_Laboratory_6 | Laboratory 6]] + [[FP_Laboratory_7 | Laboratory 7]]   
−
# [[FP_Laboratory_7 | Laboratory 7]]   
 
 
# First programming test
 
# First programming test
−
# [[FP_Laboratory_9 | Laboratory 9]]  + 1. Homework
+
# [[FP_Laboratory_9 | Laboratory 9]]  +[[FP_Laboratory_10 | Laboratory 10]]
−
# [[FP_Laboratory_10 | Laboratory 10]]
 
 
# [[FP_Laboratory_11 | Laboratory 11]]
 
# [[FP_Laboratory_11 | Laboratory 11]]
 
# Second programming test
 
# Second programming test
−
# 2. Homework + credits for the subject given. Student can repeat one of their tests.
+
# Third programming test
 +
# Credits for the subject given. Student can repeat one of their tests.
  
 
Optional:
 
Optional:
Line 106: Line 102:
  
 
== Homework == <!--T:26-->
 
== Homework == <!--T:26-->
 +
* [[FP_Test3_2024 | Homework for test 3 - 2024]]
  
−
<!--T:27-->
+
== Old Homeworks == <!--T:27-->
−
* [[FP_Homework_1 | Homework 1]]
+
* [[FP_Homework_1 | Old Homework 1]]
−
* [[FP_Homework_2 | Homework 2]]
+
* [[FP_Homework_2 | Old Homework 2]]
  
 
== Combine study == <!--T:29-->
 
== Combine study == <!--T:29-->
Line 146: Line 143:
 
* Second programming exercise (25 points)
 
* Second programming exercise (25 points)
  
−
=== Tutorial 7 (after Christmas, just a test) === <!--T:36-->
+
=== Tutorial 7 (after Christmas, just a test) === <!--T:37-->
 
* Programming exercise based on the homework (30 points).
 
* Programming exercise based on the homework (30 points).
  
 
</translate>
 
</translate>

Latest revision as of 09:48, 15 November 2024

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 19 (2 hours, PORUA1, 23.9.)
  2. Page 19 - Page 61 (2 hours, PORUA1, 30.9.)
  3. Page 61 - Page 74 (2 hour, PORUA1, 7.10.)
  4. Page 75 - Page 83 (1 hour, PORUA1, 14.10)
  5. No lecture (21.10.)
  6. Summary before test (POREC1, 28.10.)
  7. Page 75 - Page 83 (1 hour, POREC1, 4.11.)
  8. Advanced topics (2 hours, POREC1, 11.11.) + Solutions for Test 1
  9. Advanced topics (1 hours, POREC1, 18.11.) + Summary before Test 2
  10. Advanced topics (1 hours, POREC1, 25.11.) + Summary before Test 3
  11. No lecture - (2.12.)
  12. No lecture - (9.12.)

Laboratories

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

Optional:

Cheat sheet containing basic functions in PDF

Homework

Old Homeworks

Combine study

Tutorial 1

Tutorial 2

Tutorial 3


Tutorial 4

  • First programming exercise (25 points)

Tutorial 5

will not be tested)

Tutorial 6

  • Second programming exercise (25 points)

Tutorial 7 (after Christmas, just a test)

  • Programming exercise based on the homework (30 points).
Retrieved from "http://behalek.cs.vsb.cz/wiki/index.php?title=Functional_programming&oldid=3856"