List of presentations
Basic introduction to functional programming
1. Course introduction. Introduction to Functional programming. Introduction to programming in the language Haskell (using GHC interpreter).
2. Basic function definition. How to write simple (recursive) functions in Haskell. Basic data types and how to use them.
3. Defining functions revisited: pattern matching.
4. Lists and tuples - a basic notation, how to use them in programs.
5. Working with list.
6. Introduction of higher-order functions. Functions as a first-class value. Functions map - fold. List comprehensions, list generators.
7. User defined data types and how to work with them.
8. Recursive data types and polymorphism, a partial function evaluation, basic introduction to type classes.
Advanced topics
9. Theory important for pure functional programming - Introduction to lambda calculus, computation as rewriting, lazy evaluation.
10. Programming with actions - using classic arrays and handling side effect (input and output operations).
11. Monads in Haskell
12. - 13. Functional programming in traditional languages - differences between Haskell and languages like C# or Java, Haskell like Monads to represent state in other programming languages (LINQ in C#).
List of laboratories (it is expected that all laboratories will be in a computer laboratories)
1. GHC Interpreter - basic usage
2. Implementation of basic functions computing for example: factorial, Fibonacci sequence, or the greatest common divisor.
3. Functions and operators that work with numbers, strings or characters.
4. Implementation of more complex functions that uses pattern matching, guard expressions etc.
5. Implementation of functions that work with lists like: length, reverse, (++), zip, zipWith.
6. Usage of standard functions working with lists like map, fold, concat etc. List generators.
7. First programming test.
8. Definition of a data type for mathematical expressions. Evaluation of such expressions.
9. Definition of a binary tree. Implementation of a functions that work with such a tree.
10. Working with files.
11. Working with arrays, generating random numbers - computing the value of PI.
12. Defining new instances of Monad in Haskell
13. Second programming test.
Basic introduction to functional programming
1. Course introduction. Introduction to Functional programming. Introduction to programming in the language Haskell (using GHC interpreter).
2. Basic function definition. How to write simple (recursive) functions in Haskell. Basic data types and how to use them.
3. Defining functions revisited: pattern matching.
4. Lists and tuples - a basic notation, how to use them in programs.
5. Working with list.
6. Introduction of higher-order functions. Functions as a first-class value. Functions map - fold. List comprehensions, list generators.
7. User defined data types and how to work with them.
8. Recursive data types and polymorphism, a partial function evaluation, basic introduction to type classes.
Advanced topics
9. Theory important for pure functional programming - Introduction to lambda calculus, computation as rewriting, lazy evaluation.
10. Programming with actions - using classic arrays and handling side effect (input and output operations).
11. Monads in Haskell
12. - 13. Functional programming in traditional languages - differences between Haskell and languages like C# or Java, Haskell like Monads to represent state in other programming languages (LINQ in C#).
List of laboratories (it is expected that all laboratories will be in a computer laboratories)
1. GHC Interpreter - basic usage
2. Implementation of basic functions computing for example: factorial, Fibonacci sequence, or the greatest common divisor.
3. Functions and operators that work with numbers, strings or characters.
4. Implementation of more complex functions that uses pattern matching, guard expressions etc.
5. Implementation of functions that work with lists like: length, reverse, (++), zip, zipWith.
6. Usage of standard functions working with lists like map, fold, concat etc. List generators.
7. First programming test.
8. Definition of a data type for mathematical expressions. Evaluation of such expressions.
9. Definition of a binary tree. Implementation of a functions that work with such a tree.
10. Working with files.
11. Working with arrays, generating random numbers - computing the value of PI.
12. Defining new instances of Monad in Haskell
13. Second programming test.