Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2019/2020

Functional Programming

Login to KOS for course enrollment Display time-table
Code Completion Credits Range Language
BE4B36FUP Z,ZK 6 2P+2C
The course cannot be taken simultaneously with:
Functional Programming (B4B36FUP)
The course is a substitute for:
Functional Programming (B4B36FUP)
Lecturer:
Viliam Lisý, Michal Pěchouček (guarantor), Rostislav Horčík
Tutor:
Viliam Lisý, Michal Pěchouček (guarantor), Antonio Bellon, Niklas Maximilian Heim, Rostislav Horčík, Dominik Andreas Seitz
Supervisor:
Department of Computer Science
Synopsis:

This course introduces students into the techniques of functional

programming, the advantages and disadvantages of this programming

paradigm, and its use in practice. This approach is declarative in the

sense that the programmer symbolically describes the problem to be

solved, rather than specifying the exact sequence of operations

required to solve it. It allows focusing on the essence of the solved

problem and implementing even more complex algorithms compactly.

Functional programming has notable advantages for parallelization and

automated verification of algorithms, and the most useful functional

programming concepts are increasingly often introduced to standard

programming languages. Because of the focus of functional programming

on symbols, rather than numbers, functional programming has been

heavily used in in artificial intelligence fields, such as agent

systems or symbolic machine learning.

Requirements:
Syllabus of lectures:

1. Introduction to declarative programming languages. Comparison to

classical imperative languages. Main principles and practical

applications of functional programming.

2. LISP: basic constructions of the language, atoms, lists, recursion

3. LISP: basic language idioms, atoms, lists, recursion

3. LISP: built-in functions, data structures, lambda abstraction

4. LISP: built-in high-order functions

5. LISP: infinite data structures, closures

6. Introduction to Lambda calculus, relation to functional programming

7. Equivalence of functional programming to Turing machine

8. Types in functional languages, their role and consequences to the

expressive power of the languages, typed Lambda calculus

9. Haskell: types, patterns, built-in functions, lambda abstraction

10. Haskell: lazy evaluation, partial function application

11. Haskell: monads

12. Automated optimizations in functional programming, formal

verification of functional programs

13. Functional programming and parallel computation

14. Functional constructs in popular programming languages and tools

Syllabus of tutorials:
Study Objective:
Study materials:

Hudak, Paul, and Joseph H. Fasel. „A gentle introduction to Haskell.“ ACM Sigplan Notices 27.5 (1992): 1-52.

Harvey, Brian, and Matthew Wright. Simply Scheme: introducing computer science. Mit Press, 1999.

Note:
Further information:
https://cw.fel.cvut.cz/wiki/courses/fup/start
Time-table for winter semester 2019/2020:
Time-table is not available yet
Time-table for summer semester 2019/2020:
06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon
Tue
Fri
Thu
roomKN:E-301
Lisý V.
Horčík R.

12:45–14:15
(lecture parallel1)
Karlovo nám.
Šrámkova posluchárna K9
roomKN:E-328
Bellon A.
14:30–16:00
(lecture parallel1
parallel nr.101)

Karlovo nám.
Bourací učebna
roomKN:E-328
Heim N.
16:15–17:45
(lecture parallel1
parallel nr.102)

Karlovo nám.
Bourací učebna
roomKN:E-328
Seitz D.
18:00–19:30
(lecture parallel1
parallel nr.103)

Karlovo nám.
Bourací učebna
Fri
The course is a part of the following study plans:
Data valid to 2020-05-28
For updated information see http://bilakniha.cvut.cz/en/predmet5148306.html