Difference between revisions of "Functional programming"

From Marek Běhálek Wiki
Jump to navigation Jump to search
Line 1: Line 1:
 
<translate>
 
<translate>
== Functional Programming == <!--T:1-->
+
<!--T:1-->
As the expressions above imply, Haskell has a notion of integers
+
== Basic introduction ==
and floating point numbers. Integers can be arbitrarily large.
 
Here, ~(^)~ provides integer exponentiation.
 
  
<!--T:2-->
+
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.
<pre style="color: silver; background: black;">
+
 
ghci> 313 ^ 15
+
===Subject aims expressed by acquired skills and competences===
27112218957718876716220410905036741257
+
 
</pre>
+
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.
  
<!--T:3-->
 
<syntaxhighlight lang="Haskell" >
 
def quickSort(arr):
 
less = []
 
pivotList = []
 
more = []
 
if len(arr) <= 1:
 
return arr
 
else:
 
pass
 
</syntaxhighlight>
 
 
</translate>
 
</translate>

Revision as of 11:01, 8 August 2019

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.