# FI:IB015 Non-Imperative Programming - Course Information

## IB015 Non-Imperative Programming

**Faculty of Informatics**

Autumn 2023

**Extent and Intensity**- 2/1/1. 4 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).

Taught in person. **Teacher(s)**- prof. RNDr. Jiří Barnat, Ph.D. (lecturer)

RNDr. Martin Jonáš, Ph.D. (lecturer)

Bc. František Bráblík (seminar tutor)

Vít Falta (seminar tutor)

Filip Gregora (seminar tutor)

Marek Hradil (seminar tutor)

Ján Kapko (seminar tutor)

Mgr. Simona Katkinová (seminar tutor)

Bc. Filip Kučerák (seminar tutor)

Karel Procházka (seminar tutor)

Michal Rábek (seminar tutor)

Jan Ryzí (seminar tutor)

Bc. Jindřich Sedláček (seminar tutor)

Tereza Siková (seminar tutor)

Mgr. Tomáš Szaniszlo (seminar tutor)

Bc. Jakub Šárník (seminar tutor)

Bc. Adam Štafa (seminar tutor)

Bc. Dávid Šutor (seminar tutor)

Mgr. Jakub Balabán (assistant)

Mgr. Adam Matoušek (assistant) **Guaranteed by**- prof. RNDr. Jiří Barnat, Ph.D.

Department of Computer Science – Faculty of Informatics

Contact Person: prof. RNDr. Jiří Barnat, Ph.D.

Supplier department: Department of Computer Science – Faculty of Informatics **Timetable**- Tue 12:00–13:50 D1, Tue 12:00–13:50 D3
- Timetable of Seminar Groups:

*F. Bráblík, M. Hradil*

IB015/02: Fri 22. 9. to Fri 15. 12. each even Friday 8:00–9:50 B130,*F. Bráblík, M. Hradil*

IB015/03: Thu 12. 10. to Thu 7. 12. each odd Thursday 16:00–17:50 B130,*V. Falta, S. Katkinová*

IB015/04: Thu 21. 9. to Thu 14. 12. each even Thursday 16:00–17:50 B130,*V. Falta, S. Katkinová*

IB015/05: Wed 27. 9. to Wed 6. 12. each odd Wednesday 12:00–13:50 B130,*F. Gregora, J. Sedláček*

IB015/06: Wed 20. 9. to Wed 13. 12. each even Wednesday 12:00–13:50 B130,*F. Gregora, J. Sedláček*

IB015/07: Wed 27. 9. to Wed 6. 12. each odd Wednesday 14:00–15:50 B130,*F. Kučerák, K. Procházka*

IB015/08: Wed 20. 9. to Wed 13. 12. each even Wednesday 14:00–15:50 B130,*F. Kučerák, K. Procházka*

IB015/09: Fri 29. 9. to Fri 8. 12. each odd Friday 12:00–13:50 B130,*T. Szaniszlo, A. Štafa*

IB015/10: Fri 22. 9. to Fri 15. 12. each even Friday 12:00–13:50 B130,*T. Szaniszlo, A. Štafa*

IB015/11: Tue 26. 9. to Tue 5. 12. each odd Tuesday 14:00–15:50 B130,*J. Ryzí, J. Šárník*

IB015/12: Tue 19. 9. to Tue 12. 12. each even Tuesday 14:00–15:50 B130,*J. Ryzí, J. Šárník*

IB015/13: Wed 27. 9. to Wed 6. 12. each odd Wednesday 8:00–9:50 B130,*M. Jonáš, M. Rábek*

IB015/14: Wed 20. 9. to Wed 13. 12. each even Wednesday 8:00–9:50 B130,*M. Jonáš, M. Rábek*

IB015/15: Wed 27. 9. to Wed 6. 12. each odd Wednesday 10:00–11:50 B130,*M. Jonáš, T. Siková*

IB015/16: Wed 20. 9. to Wed 13. 12. each even Wednesday 10:00–11:50 B130,*M. Jonáš, T. Siková*

IB015/17: Mon 25. 9. to Mon 4. 12. each odd Monday 8:00–9:50 B130,*J. Kapko, D. Šutor*

IB015/18: Mon 18. 9. to Mon 11. 12. each even Monday 8:00–9:50 B130,*J. Kapko, D. Šutor* **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**- there are 54 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.
**Learning outcomes**- After graduation students will: - understand fundaments of functional programming, - be able to decompose computational problems to individual functions and apply this ability for design and implementation of programs even in imperative programming languages, - have basic knowledge of Haskell programming language - be able to design and implement recursive functions, - be able to work with recursively defined data structures.
**Syllabus****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

**Literature**- 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

- THOMPSON, Simon.
**Bookmarks**- https://is.muni.cz/ln/tag/FI:IB015!
**Teaching methods**- The course is organized as a series of lectures and homeworks, plus a set of voluntary exercises, where the students get practice with solving various problems.
**Assessment methods**- The evaluation consists of a final written test that have two parts, obligatory and voluntary. To complete successfully with "E", the student have to pass the obligatory part of the final test and collect some minimal amount of points from the homeworks. The final grade can be further improved by additional points from the homeworks and selected exercises during practicals.
**Language of instruction**- Czech
**Follow-Up Courses****Further Comments**- Study Materials

The course is taught annually. **Listed among pre-requisites of other courses**

- Enrolment Statistics (recent)

- Permalink: https://is.muni.cz/course/fi/autumn2023/IB015