FI:IB015 Non-Imperative Programming - Course Information
IB015 Non-Imperative ProgrammingFaculty of Informatics
- Extent and Intensity
- 2/2. 4 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
- prof. RNDr. Jiří Barnat, Ph.D. (lecturer)
Mgr. Petr Bauch, Ph.D. (seminar tutor)
Mgr. Juraj Major (seminar tutor)
Mgr. Eva Mráková, Ph.D. (seminar tutor)
Mgr. Tomáš Szaniszlo (seminar tutor)
RNDr. Vladimír Štill (seminar tutor)
RNDr. Martin Ukrop (seminar tutor)
Mgr. Lukáš Másilko (assistant)
- 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.
Supplier department: Department of Computer Science - Faculty of Informatics
- Mon 12:00–13:50 D1
- Timetable of Seminar Groups:
IB015/01: Tue 12:00–13:50 B130, E. Mráková
IB015/02: Wed 8:00–9:50 B130, E. Mráková
IB015/03: Thu 16:00–17:50 B130, V. Štill
IB015/04: Wed 10:00–11:50 B130, V. Štill
IB015/05: Thu 8:00–9:50 B130, M. Ukrop
IB015/06: Thu 12:00–13:50 B130, M. Ukrop
IB015/07: Mon 16:00–17:50 B130, T. Szaniszlo
IB015/08: Tue 8:00–9:50 B130, T. Szaniszlo
IB015/09: Wed 18:00–19:50 B130, P. Bauch
IB015/10: Mon 18:00–19:50 B130, J. Major
- 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
- there are 17 fields of study the course is directly associated with, display
- Course objectives
- On successful completion of the course, students will understand functional and logic programming paradigms. Programming languages enforcing declarative way of description of an algorithm bring on programming habits that the students will be able to use in practice later on when implementing large applications using even imperative languages.
- Logic programming paradigm
- Search for a prove as way of computation
- Functional programming paradigm
- 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
- Teaching methods
- The course is organized as a series of lectures, plus a set of exercises, where the students get practice with solving various problems.
- Assessment methods
- The evaluation consists of one obligatory midterm written test (24%) and a final written exam (76%). The final grade can be further improved by additional "bonus points" which can be acquired for solving selected exercises.
- Language of instruction
- Follow-Up Courses
- Further Comments
- Study Materials
The course is taught annually.
- Listed among pre-requisites of other courses
- Teacher's information