FI:IB015 Intro to Func.Programming

IB015 Introduction to Functional Programming

Faculty of Informatics
Autumn 2007

Extent and Intensity

2/1. 3 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).

Teacher(s)

RNDr. Libor Škarvada (lecturer)
Mgr. Jiří Appl (seminar tutor)
doc. RNDr. Jan Bouda, Ph.D. (seminar tutor)
RNDr. Václav Brožek, Ph.D. (seminar tutor)
doc. RNDr. Aleš Horák, Ph.D. (seminar tutor)
Bc. Tomáš Janoušek (seminar tutor)
Mgr. Matej Kollár (seminar tutor)
RNDr. Václav Lorenc (seminar tutor)
Mgr. Eva Mráková, Ph.D. (seminar tutor)
RNDr. Petr Ročkai, Ph.D. (seminar tutor)
RNDr. David Sehnal, Ph.D. (seminar tutor)
doc. RNDr. David Šafránek, Ph.D. (seminar tutor)
Mgr. Adam Šiška (seminar tutor)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: RNDr. Libor Škarvada

Timetable

Mon 18:00–19:50 D1, Mon 18:00–19:50 D3, Mon 18:00–19:50 D2

Timetable of Seminar Groups:

IB015/01: each odd Tuesday 10:00–11:50 B130, J. Appl
IB015/02: each even Tuesday 10:00–11:50 B130, J. Appl
IB015/03: each odd Tuesday 12:00–13:50 B130, L. Škarvada
IB015/04: each even Tuesday 12:00–13:50 B130, A. Horák
IB015/05: each odd Tuesday 14:00–15:50 B130, A. Šiška
IB015/06: each even Tuesday 14:00–15:50 B130, A. Šiška
IB015/07: each odd Tuesday 16:00–17:50 B130, D. Šafránek
IB015/08: each even Tuesday 16:00–17:50 B130, D. Šafránek
IB015/09: each odd Tuesday 18:00–19:50 B130, V. Brožek
IB015/10: each even Tuesday 18:00–19:50 B130, V. Brožek
IB015/11: each odd Wednesday 10:00–11:50 B130, P. Ročkai
IB015/12: each even Wednesday 10:00–11:50 B130, P. Ročkai
IB015/13: each odd Wednesday 16:00–17:50 B130, V. Brožek
IB015/14: each even Wednesday 16:00–17:50 B130, V. Brožek
IB015/15: each odd Wednesday 18:00–19:50 B130, V. Lorenc
IB015/16: each even Wednesday 18:00–19:50 B130, V. Lorenc
IB015/17: each odd Thursday 8:00–9:50 B130, J. Bouda
IB015/18: each even Thursday 8:00–9:50 B130, J. Bouda
IB015/19: each odd Thursday 10:00–11:50 B130, J. Bouda
IB015/20: each even Thursday 10:00–11:50 B130, J. Bouda
IB015/21: each odd Thursday 12:00–13:50 B130, T. Janoušek
IB015/22: each even Thursday 12:00–13:50 B130, T. Janoušek
IB015/23: each odd Friday 8:00–9:50 B130, M. Kollár
IB015/24: each even Friday 8:00–9:50 B130, M. Kollár
IB015/25: each odd Friday 10:00–11:50 B130, D. Sehnal
IB015/26: each even Friday 10:00–11:50 B130, D. Sehnal
IB015/27: each odd Friday 12:00–13:50 B130, D. Sehnal
IB015/28: each even Friday 12:00–13:50 B130, D. Sehnal

Prerequisites

There are no special prerequisities apart from the basic math skills (on the secondary-school level), and certain aptitude for abstract reasoning.

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

Applied Informatics (programme FI, B-AP)
Bioinformatics (programme FI, B-AP)
Informatics with another discipline (programme FI, B-BI)
Informatics with another discipline (programme FI, B-FY)
Informatics with another discipline (programme FI, B-GE)
Informatics with another discipline (programme FI, B-GK)
Informatics with another discipline (programme FI, B-CH)
Informatics with another discipline (programme FI, B-IO)
Informatics with another discipline (programme FI, B-MA)
Informatics with another discipline (programme FI, B-SO)
Informatics with another discipline (programme FI, B-TV)
Informatics (programme FI, B-IN)
Mathematical Informatics (programme FI, B-IN)
Parallel and Distributed Systems (programme FI, B-IN)
Computer Graphics and Image Processing (programme FI, B-IN)
Computer Networks and Communication (programme FI, B-IN)
Computer Systems and Data Processing (programme FI, B-IN)
Programmable Technical Structures (programme FI, B-IN)
Artificial Intelligence and Natural Language Processing (programme FI, B-IN)

Course objectives

The students get acquainted with functional programming paradigm. Haskell enforces purely functional programming style without side effects, which brings on programming habits, useful also in imperative languages. Apart from lectures the course consists of non-obligatory exercises, where the students can practise solving various problems.

Syllabus

Basic notions: term, value, evaluation step.
Definition of functions by recursion or by combinators.
Lambda abstraction.
Higher-order functions, partial application, currying.
Simple types: ground types and type constructors, product types.
Polymorfic types, typing.
User defined type constructors, sum types, recursive types; definitions by patterns.
List constructors, list enumeration and list comprehension.
Evaluation order, strict vs. lazy reduction.
Infinite data structures.
Recursive functions, operations on lists and trees, time complexity.

Literature