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. Matúš Bezek (seminar tutor)
Mgr. Bc. Tomáš Janík (seminar tutor)
RNDr. Martin Jonáš, Ph.D. (seminar tutor)
Mgr. Juraj Major (seminar tutor)
Mgr. Jan Mrázek (seminar tutor)
Mgr. Tomáš Szaniszlo (seminar tutor)
Mgr. Martin Škrovina (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
- Tue 12:00–13:50 D1
- Timetable of Seminar Groups:
IB015/01: Fri 12:00–13:50 B130, M. Jonáš
IB015/02: Thu 16:00–17:50 B130, M. Jonáš
IB015/03: Wed 12:00–13:50 B130, J. Mrázek
IB015/04: Thu 12:00–13:50 B130, V. Štill
IB015/05: Thu 14:00–15:50 B130, M. Ukrop
IB015/06: Thu 8:00–9:50 B130, M. Ukrop
IB015/07: Fri 10:00–11:50 B130, T. Szaniszlo
IB015/08: Wed 8:00–9:50 B130, T. Szaniszlo
IB015/09: Thu 18:00–19:50 B130, J. Major
IB015/10: Wed 18:00–19:50 B130, J. Major
IB015/11: Tue 14:00–15:50 B130, V. Štill
IB015/12: Fri 8:00–9:50 B130, M. Škrovina
- 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.
- Functional computational paradigm and Haskell
- Functions in programming;
- Lists, Types and Recursion
- Functions of higher rank, Lambda functions
- Accumulators, Type definitions, Input/Output
- Reduction strategy, Infinite lists
- Relation of recursion and induction, Recursive data types
- Time complexity of computation, Type classes, Modules
- Functional solutions od some problems
- Logical computational paradigm and Prolog
- Non-imperative programming in Prologu
- Lists, Arithmetics, Tail rekursion in Prologu
- Cuts, Input-Output, All solutions
- An Introduction to Constraint Solving Programming
- THOMPSON, Simon. Haskell :the craft of functional programming. Harlow: Addison-Wesley, 1996. xx, 500 s. ISBN 0-201-40357-9. info
- LIPOVAČA, Miran. Learn You a Haskell for Great Good!: A Beginner's Guide. First Edition. San Francisco, CA, USA: No Starch Press, 2011. 400 pp. ISBN 978-1-59327-283-8. URL info
- BLACKBURN, Patrick and Johan BOS. Learn Prolog Now! London: College Publications, 2016. Texts in Computing, volume 7. ISBN 1-904987-17-6. URL 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 homeworks and selected exercises during practicals.
- 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