IB016 Seminar on Functional Programming

Faculty of Informatics
Spring 2024
Extent and Intensity
1/1/0. 2 credit(s) (plus extra credits for completion). Type of Completion: z (credit).
Teacher(s)
RNDr. Martin Jonáš, Ph.D. (lecturer)
Bc. Jakub Šárník (assistant)
Guaranteed by
RNDr. Martin Jonáš, Ph.D.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Wed 10:00–11:50 B130
Prerequisites
IB015 Non-Imperative Programming
Pre-requisities for enrolling in the course are to be familiar with Haskell in the scope of the IB015 Non-Imperative Programming course and to have a positive attitude towards functional programming.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
The capacity limit for the course is 45 student(s).
Current registration and enrolment status: enrolled: 33/45, only registered: 0/45, only registered with preference (fields directly associated with the programme): 0/45
fields of study / plans the course is directly associated with
there are 71 fields of study the course is directly associated with, display
Course objectives
Students will significantly extend their knowledge of functional programming. At the end of the course, they should be able to solve non-trivial programming problems using Haskell and be familiar with practical use of this functional language.
Learning outcomes
After finishing the course, the student will be able to:
— write a Haskell program with approximatelly 100 to 200 lines;
— perform analysis and functional decompisition of given problem;
— use supportive tools for Haskell developers such as the Cabal package manager, the Hackage package repository, the HLint linter, and the QuickCheck testing framework;
— describe theoretical functional concepts;
— have an idea about some more advanced functional techniques used in practice.
Syllabus
  • Advanced syntax, modules, custom type classes, advanced data structures.
  • Package system (Hackage/Stackage), support tools (Cabal, HLint, Haddock).
  • Functors, applicative functors, monads.
  • Automatic generation of tests according to program specification (QuickCheck).
  • Input and output in Haskell, processing errors and exceptions (Maybe, Either, exceptions, error states).
  • Semigroups, monoids, the Foldable and Traversable classes.
  • Evaluation strategies (laziness vs. strictness).
  • Monadic parsing (Parsec).
  • Monads for shared writing, shared reading and keeping the state (Writer, Reader, State).
  • Monad transformers (MaybeT, ErrorT).
  • Processing strings and other useful GHC extensions.
  • Haskell in real world projects.
Literature
  • 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
  • O'SULLIVAN, Bryan, John GOERZEN and Don STEWART. Real World Haskell. First Edition. O'Reilly Media, Inc., 2009, 670 pp. ISBN 978-0-596-51498-3. URL info
Bookmarks
https://is.muni.cz/ln/tag/FI:IB016!
Teaching methods
Seminars combining lecture and individual programming work; homework.
Assessment methods
In order to successful completion of the course, it is necessary to obtain enough points from homework assignments. The attendance of seminars is not compulsory, but highly recommended.
Language of instruction
Czech
Follow-Up Courses
Further Comments
Study Materials
The course is taught annually.
Teacher's information
https://is.muni.cz/auth/el/1433/jaro2023/IB016/index.qwarp
The course is also listed under the following terms Spring 2010, Spring 2011, Spring 2012, Spring 2013, Spring 2015, Spring 2016, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2025.
  • Enrolment Statistics (recent)
  • Permalink: https://is.muni.cz/course/fi/spring2024/IB016