FI:IB015 Intro to Func.Programming - Course Information
IB015 Introduction to Functional ProgrammingFaculty of Informatics
- Extent and Intensity
- 2/1. 3 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
- prof. RNDr. Jiří Barnat, Ph.D. (lecturer)
Mgr. Matej Kollár (seminar tutor)
Peter Molnár (seminar tutor)
Mgr. Adam Šiška (seminar tutor)
Mgr. Tomáš Zábojník (seminar tutor)
- Guaranteed by
- prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science - Faculty of Informatics
Contact Person: prof. RNDr. Jiří Barnat, Ph.D.
- Thu 10:00–11:50 D1
- Timetable of Seminar Groups:
IB015/02: each odd Monday 16:00–17:50 B117, A. Šiška
IB015/03: each even Wednesday 16:00–17:50 B117, A. Šiška
IB015/04: each odd Wednesday 16:00–17:50 B117, A. Šiška
IB015/05: each even Tuesday 12:00–13:50 B117, M. Kollár
IB015/06: each odd Tuesday 12:00–13:50 B117, M. Kollár
IB015/07: each even Wednesday 12:00–13:50 B117, M. Kollár
IB015/08: each odd Wednesday 12:00–13:50 B117, M. Kollár
IB015/09: each even Thursday 14:00–15:50 B117, T. Zábojník
IB015/10: each odd Thursday 14:00–15:50 B117, T. Zábojník
IB015/11: each even Thursday 12:00–13:50 B130, P. Molnár
IB015/12: each odd Thursday 12:00–13:50 B130, P. Molnár
IB015/13: each even Tuesday 18:00–19:50 B130, P. Molnár
IB015/14: each odd Tuesday 18:00–19:50 B130, P. Molnár
- 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 the course is directly associated with
- there are 19 fields of study the course is directly associated with, display
- 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.
- Basic notions: term, value, evaluation step.
- 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.
- THOMPSON, Simon. Haskell :the craft of functional programming. Harlow: Addison-Wesley, 1996. xx, 500 s. ISBN 0-201-40357-9. info
- Assessment methods
- The course is organized as a series of lectures accompanied with voluntary exercises. The evaluation consists of one obligatory midterm written test and a final written exam. The final grade can be further improved by solving voluntary miniprojects.
- Language of instruction
- Follow-Up Courses
- Further Comments
- Study Materials
The course is taught each semester.
- Listed among pre-requisites of other courses
- Teacher's information