IA014 Advanced Functional Programming

Faculty of Informatics
Spring 2024
Extent and Intensity
2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Taught in person.
Teacher(s)
doc. Mgr. Jan Obdržálek, PhD. (lecturer)
Guaranteed by
doc. Mgr. Jan Obdržálek, PhD.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Mon 12:00–13:50 A217
Prerequisites
Previous experience with functional programming, at least to the extent covered by the course IB015 - Non-imperative programming.
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 46 fields of study the course is directly associated with, display
Course objectives
Introduce the theoretical concepts behind the functional programming paradigm, i.e. lambda-calculus and various type systems. Present some of the modern advanced functional programming concepts (typeclasses, monads, monad transformers, GADTs, dependent types...).
Learning outcomes
By the end of the course, students will:
understand the theoretical foundations of functional programming, e,g, lambda calculi and type theory;
understand and be able to efficiently use modern/advanced concepts of functional programming languages (e.g. typeclasses, monads, monad transformers...);
know the limits of the functional programming paradigm;
be able to evaluate and use FP-based concepts in modern mainstream (non-FP) languages.
Syllabus
  • History of functional programming languages.
  • Untyped lambda calculus.
  • Simply typed lambda calculus.
  • Polymorphism add type inference (Hindley-Milner, System F)
  • Type classes.
  • Functors, Applicatives.
  • Monads.
  • Monad tranformers.
  • GADTs - Generalized Algebraic Data Types
  • Dependent types.
Literature
  • BARENDREGT, Henk. The lambda calculus, its syntax and semantics. London: College Publications, 2012, xv, 621. ISBN 9781848900660. info
  • MICHAELSON, Greg. An introduction to functional programming through Lambda calculus. Wokingham: Addison-Wesley Publishing Company, 1989, 320 s. ISBN 0-201-17812-5. info
  • PIERCE, Benjamin C. Types and programming languages. Cambridge, Massachusetts: The MIT Press, 2002, xxi, 623. ISBN 9780262162098. 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
  • 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
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Teaching methods
The course is organized as a series of lectures.
Assessment methods
Written midterm test covering the first half of the course, final oral exam (with a written part).
Language of instruction
English
Further Comments
Study Materials
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Autumn 2014, Autumn 2015, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023.

IA014 Advanced Functional Programming

Faculty of Informatics
Spring 2023
Extent and Intensity
2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Taught in person.
Teacher(s)
doc. Mgr. Jan Obdržálek, PhD. (lecturer)
Guaranteed by
doc. Mgr. Jan Obdržálek, PhD.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Tue 14. 2. to Tue 9. 5. Tue 10:00–11:50 A318
Prerequisites
Previous experience with functional programming, at least to the extent covered by the course IB015 - Non-imperative programming.
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 46 fields of study the course is directly associated with, display
Course objectives
Introduce the theoretical concepts behind the functional programming paradigm, i.e. lambda-calculus and various type systems. Present some of the modern advanced functional programming concepts (typeclasses, monads, monad transformers, GADTs, dependent types...).
Learning outcomes
By the end of the course, students will:
understand the theoretical foundations of functional programming, e,g, lambda calculi and type theory;
understand and be able to efficiently use modern/advanced concepts of functional programming languages (e.g. typeclasses, monads, monad transformers...);
know the limits of the functional programming paradigm;
be able to evaluate and use FP-based concepts in modern mainstream (non-FP) languages.
Syllabus
  • History of functional programming languages.
  • Untyped lambda calculus.
  • Simply typed lambda calculus.
  • Polymorphism add type inference (Hindley-Milner, System F)
  • Type classes.
  • Functors, Applicatives.
  • Monads.
  • Monad tranformers.
  • GADTs - Generalized Algebraic Data Types
  • Dependent types.
Literature
  • BARENDREGT, Henk. The lambda calculus, its syntax and semantics. London: College Publications, 2012, xv, 621. ISBN 9781848900660. info
  • MICHAELSON, Greg. An introduction to functional programming through Lambda calculus. Wokingham: Addison-Wesley Publishing Company, 1989, 320 s. ISBN 0-201-17812-5. info
  • PIERCE, Benjamin C. Types and programming languages. Cambridge, Massachusetts: The MIT Press, 2002, xxi, 623. ISBN 9780262162098. 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
  • 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
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Teaching methods
The course is organized as a series of lectures.
Assessment methods
Written midterm test covering the first half of the course, final oral exam (with a written part).
Language of instruction
English
Further Comments
Study Materials
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Autumn 2014, Autumn 2015, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2024.

IA014 Advanced Functional Programming

Faculty of Informatics
Spring 2022
Extent and Intensity
2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Taught in person.
Teacher(s)
doc. Mgr. Jan Obdržálek, PhD. (lecturer)
Guaranteed by
doc. Mgr. Jan Obdržálek, PhD.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Thu 17. 2. to Thu 12. 5. Thu 10:00–11:50 A320
Prerequisites
Previous experience with functional programming, at least to the extent covered by the course IB015 - Non-imperative programming.
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 45 fields of study the course is directly associated with, display
Course objectives
Introduce the underlying theory of functional programming. Show some of the modern advanced functional programming concepts (monads, monad transformers, GADTs, dependent types...).
Learning outcomes
By the end of the course, students will:
understand the theoretical foundations of functional programming, e,g, lambda calculi and type theory;
understand and be able to efficiently use modern/advanced concepts of functional programming languages (e.g. typeclasses, monads, monad transformers...);
know the limits of the functional programming paradigm;
be able to evaluate and use FP-based concepts in modern mainstream (non-FP) languages
Syllabus
  • History of functional programming languages.
  • Untyped lambda calculus.
  • Simply typed lambda calculus.
  • Polymorphism add type inference (Hindley-Milner, System F)
  • Type classes.
  • Functors, Applicatives.
  • Monads.
  • Monad tranformers.
  • GADTs - Generalized Algebraic Data Types
  • Dependent types.
  • IO and Concurrency.
Literature
  • BARENDREGT, Henk. The lambda calculus, its syntax and semantics. London: College Publications, 2012, xv, 621. ISBN 9781848900660. info
  • MICHAELSON, Greg. An introduction to functional programming through Lambda calculus. Wokingham: Addison-Wesley Publishing Company, 1989, 320 s. ISBN 0-201-17812-5. info
  • PIERCE, Benjamin C. Types and programming languages. Cambridge, Massachusetts: The MIT Press, 2002, xxi, 623. ISBN 9780262162098. 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
  • 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
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Teaching methods
The course is organized as a series of lectures.
Assessment methods
Evaluation: midterm exam (20%), final written exam (80%).
>50% of points required to pass.
Optional oral exam if you get at least "C" for the written part.
Language of instruction
English
Further Comments
Study Materials
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Autumn 2014, Autumn 2015, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2023, Spring 2024.

IA014 Advanced Functional Programming

Faculty of Informatics
Spring 2021
Extent and Intensity
2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Taught online.
Teacher(s)
doc. Mgr. Jan Obdržálek, PhD. (lecturer)
Guaranteed by
doc. Mgr. Jan Obdržálek, PhD.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Wed 10:00–11:50 Virtuální místnost
Prerequisites
Previous experience with functional programming, at least to the extent covered by the course IB015 - Non-imperative programming.
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 45 fields of study the course is directly associated with, display
Course objectives
Introduce the underlying theory of functional programming. Show some of the modern advanced functional programming concepts (monads, monad transformers, GADTs, dependent types...).
Learning outcomes
By the end of the course, students will:
understand the theoretical foundations of functional programming, e,g, lambda calculi and type theory;
understand and be able to efficiently use modern/advanced concepts of functional programming languages (e.g. typeclasses, monads, monad transformers...);
know the limits of the functional programming paradigm;
be able to evaluate and use FP-based concepts in modern mainstream (non-FP) languages
Syllabus
  • History of functional programming languages.
  • Untyped lambda calculus.
  • Simply typed lambda calculus.
  • Polymorphism add type inference (Hindley-Milner, System F)
  • Type classes.
  • Functors, Applicatives.
  • Monads.
  • Monad tranformers.
  • GADTs - Generalized Algebraic Data Types
  • Dependent types.
  • IO and Concurrency.
Literature
  • BARENDREGT, Henk. The lambda calculus, its syntax and semantics. London: College Publications, 2012, xv, 621. ISBN 9781848900660. info
  • MICHAELSON, Greg. An introduction to functional programming through Lambda calculus. Wokingham: Addison-Wesley Publishing Company, 1989, 320 s. ISBN 0-201-17812-5. info
  • PIERCE, Benjamin C. Types and programming languages. Cambridge, Massachusetts: The MIT Press, 2002, xxi, 623. ISBN 9780262162098. 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
  • 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
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Teaching methods
The course is organized as a series of lectures.
Assessment methods
Evaluation: midterm exam (20%), final written exam (80%).
>50% of points required to pass.
Optional oral exam if you get at least "C" for the written part.
Language of instruction
English
Further Comments
Study Materials
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Autumn 2014, Autumn 2015, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2022, Spring 2023, Spring 2024.

IA014 Advanced Functional Programming

Faculty of Informatics
Spring 2020
Extent and Intensity
2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
doc. Mgr. Jan Obdržálek, PhD. (lecturer)
Guaranteed by
doc. Mgr. Jan Obdržálek, PhD.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Mon 17. 2. to Fri 15. 5. Tue 12:00–13:50 A217
Prerequisites
Previous experience with functional programming, at least to the extent covered by the course IB015 - Non-imperative programming.
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 45 fields of study the course is directly associated with, display
Course objectives
Introduce the underlying theory of functional programming. Show some of the modern advanced functional programming concepts (monads, monad transformers, GADTs, dependent types...).
Learning outcomes
By the end of the course, students will:
understand the theoretical foundations of functional programming, e,g, lambda calculi and type theory;
understand and be able to efficiently use modern/advanced concepts of functional programming languages (e.g. typeclasses, monads, monad transformers...);
know the limits of the functional programming paradigm;
be able to evaluate and use FP-based concepts in modern mainstream (non-FP) languages
Syllabus
  • History of functional programming languages.
  • Untyped lambda calculus.
  • Simply typed lambda calculus.
  • Polymorphism add type inference (Hindley-Milner, System F)
  • Type classes.
  • Functors, Applicatives.
  • Monads.
  • Monad tranformers.
  • GADTs - Generalized Algebraic Data Types
  • Dependent types.
  • IO and Concurrency.
Literature
  • BARENDREGT, Henk. The lambda calculus, its syntax and semantics. London: College Publications, 2012, xv, 621. ISBN 9781848900660. info
  • MICHAELSON, Greg. An introduction to functional programming through Lambda calculus. Wokingham: Addison-Wesley Publishing Company, 1989, 320 s. ISBN 0-201-17812-5. info
  • PIERCE, Benjamin C. Types and programming languages. Cambridge, Massachusetts: The MIT Press, 2002, xxi, 623. ISBN 9780262162098. 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
  • 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
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Teaching methods
The course is organized as a series of lectures.
Assessment methods
Evaluation: midterm exam (20%), final written exam (80%).
>50% of points required to pass.
Optional oral exam if you get at least "C" for the written part.
Language of instruction
English
Further Comments
Study Materials
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Autumn 2014, Autumn 2015, Spring 2017, Spring 2018, Spring 2019, Spring 2021, Spring 2022, Spring 2023, Spring 2024.

IA014 Advanced Functional Programming

Faculty of Informatics
Spring 2019
Extent and Intensity
2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
doc. Mgr. Jan Obdržálek, PhD. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Mon 12:00–13:50 A217
Prerequisites
Previous experience with functional programming, at least to the extent covered by the course IB015 - Non-imperative programming.
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 16 fields of study the course is directly associated with, display
Course objectives
by the end of the course, students will:
understand the theoretical foundations of functional programming;
understand and be able to efficiently use modern/advanced concepts of functional programming languages (e.g. monads);
know the limits of the functional programming paradigm;
know some of the applications suited to the FP approach;
be able to evaluate and use FP-based concepts in modern mainstream (non-FP) languages
Syllabus
  • Theoretical foundations of functional programming (lambda calculus).
  • Type system, type classes.
  • Type system extensions.
  • Monads, monad transformers.
  • Generic programming.
  • Purely functional data structures.
  • Concurrency.
  • DSL - Domain specific languages.
  • Quickcheck - type based property testing.
  • Dependent types: Agda and Coq
Literature
  • 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
  • OKASAKI, Chris. Purely functional data structures. Cambridge: Cambridge University Press, 1998, x, 220. ISBN 0521631246. info
  • MICHAELSON, Greg. An introduction to functional programming through Lambda calculus. Wokingham: Addison-Wesley Publishing Company, 1989, 320 s. ISBN 0-201-17812-5. info
  • JONES, Simon L. Peyton. The implementation of functional programming languages. New York: Prentice Hall, 1987, xvi, 445 s. ISBN 0-13-453325-9. info
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Teaching methods
The course is organized as a series of lectures.
Assessment methods
Evaluation: final written exam.
Language of instruction
English
Further Comments
Study Materials
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Autumn 2014, Autumn 2015, Spring 2017, Spring 2018, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024.

IA014 Advanced Functional Programming

Faculty of Informatics
Spring 2018
Extent and Intensity
2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
doc. Mgr. Jan Obdržálek, PhD. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Mon 16:00–17:50 A218
Prerequisites
Previous experience with functional programming, at least to the extent covered by the course IB015 - Non-imperative programming.
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 16 fields of study the course is directly associated with, display
Course objectives
by the end of the course, students will:
understand the theoretical foundations of functional programming;
understand and be able to efficiently use modern/advanced concepts of functional programming languages (e.g. monads);
know the limits of the functional programming paradigm;
know some of the applications suited to the FP approach;
be able to evaluate and use FP-based concepts in modern mainstream (non-FP) languages
Syllabus
  • Theoretical foundations of functional programming (lambda calculus).
  • Type system, type classes.
  • Type system extensions.
  • Monads, monad transformers.
  • Generic programming.
  • Purely functional data structures.
  • Concurrency.
  • DSL - Domain specific languages.
  • Quickcheck - type based property testing.
  • Dependent types: Agda and Coq
Literature
  • 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
  • OKASAKI, Chris. Purely functional data structures. Cambridge: Cambridge University Press, 1998, x, 220. ISBN 0521631246. info
  • MICHAELSON, Greg. An introduction to functional programming through Lambda calculus. Wokingham: Addison-Wesley Publishing Company, 1989, 320 s. ISBN 0-201-17812-5. info
  • JONES, Simon L. Peyton. The implementation of functional programming languages. New York: Prentice Hall, 1987, xvi, 445 s. ISBN 0-13-453325-9. info
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Teaching methods
The course is organized as a series of lectures.
Assessment methods
Evaluation: final written exam.
Language of instruction
English
Further Comments
Study Materials
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Autumn 2014, Autumn 2015, Spring 2017, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024.

IA014 Advanced Functional Programming

Faculty of Informatics
Spring 2017
Extent and Intensity
2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
doc. Mgr. Jan Obdržálek, PhD. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Mon 12:00–13:50 A217
Prerequisites
Previous experience with functional programming, at least to the extent covered by the course IB015 - Non-imperative programming.
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 16 fields of study the course is directly associated with, display
Course objectives
by the end of the course, students will:
understand the theoretical foundations of functional programming;
understand and be able to efficiently use modern/advanced concepts of functional programming languages (e.g. monads);
know the limits of the functional programming paradigm;
know some of the applications suited to the FP approach;
be able to evaluate and use FP-based concepts in modern mainstream (non-FP) languages
Syllabus
  • Theoretical foundations of functional programming (lambda calculus).
  • Type system, type classes.
  • Type system extensions.
  • Monads, monad transformers.
  • Generic programming.
  • Purely functional data structures.
  • Concurrency.
  • DSL - Domain specific languages.
  • Quickcheck - type based property testing.
  • Dependent types: Agda and Coq
Literature
  • 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
  • OKASAKI, Chris. Purely functional data structures. Cambridge: Cambridge University Press, 1998, x, 220. ISBN 0521631246. info
  • MICHAELSON, Greg. An introduction to functional programming through Lambda calculus. Wokingham: Addison-Wesley Publishing Company, 1989, 320 s. ISBN 0-201-17812-5. info
  • JONES, Simon L. Peyton. The implementation of functional programming languages. New York: Prentice Hall, 1987, xvi, 445 s. ISBN 0-13-453325-9. info
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Teaching methods
The course is organized as a series of lectures.
Assessment methods
Evaluation: final written exam.
Language of instruction
English
Further Comments
Study Materials
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Autumn 2014, Autumn 2015, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024.

IA014 Advanced Functional Programming

Faculty of Informatics
Autumn 2015
Extent and Intensity
2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
doc. Mgr. Jan Obdržálek, PhD. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Thu 10:00–11:50 D2
Prerequisites
Previous experience with functional programming, at least to the extent covered by the course IB015 - Non-imperative programming.
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 16 fields of study the course is directly associated with, display
Course objectives
by the end of the course, students will:
understand the theoretical foundations of functional programming;
understand and be able to efficiently use modern/advanced concepts of functional programming languages (e.g. monads);
know the limits of the functional programming paradigm;
know some of the applications suited to the FP approach;
be able to evaluate and use FP-based concepts in modern mainstream (non-FP) languages
Syllabus
  • Theoretical foundations of functional programming (lambda calculus).
  • Type system, type classes.
  • Type system extensions.
  • Monads, monad transformers.
  • Generic programming.
  • Purely functional data structures.
  • Concurrency.
  • DSL - Domain specific languages.
  • Quickcheck - type based property testing.
  • Dependent types: Agda and Coq
Literature
  • 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
  • OKASAKI, Chris. Purely functional data structures. Cambridge: Cambridge University Press, 1998, x, 220. ISBN 0521631246. info
  • MICHAELSON, Greg. An introduction to functional programming through Lambda calculus. Wokingham: Addison-Wesley Publishing Company, 1989, 320 s. ISBN 0-201-17812-5. info
  • JONES, Simon L. Peyton. The implementation of functional programming languages. New York: Prentice Hall, 1987, xvi, 445 s. ISBN 0-13-453325-9. info
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Teaching methods
The course is organized as a series of lectures.
Assessment methods
Evaluation: final written exam.
Language of instruction
English
Further Comments
Study Materials
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Autumn 2014, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024.

IA014 Advanced Functional Programming

Faculty of Informatics
Autumn 2014
Extent and Intensity
2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
doc. Mgr. Jan Obdržálek, PhD. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Thu 12:00–13:50 D2
Prerequisites
Previous experience with functional programming, at least to the extent covered by the course IB015 - Non-imperative programming.
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 15 fields of study the course is directly associated with, display
Course objectives
by the end of the course, students will:
understand the theoretical foundations of functional programming;
understand and be able to efficiently use modern/advanced concepts of functional programming languages (e.g. monads);
know the limits of the functional programming paradigm;
know some of the applications suited to the FP approach;
be able to evaluate and use FP-based concepts in modern mainstream (non-FP) languages
Syllabus
  • Theoretical foundations of functional programming (lambda calculus).
  • Type system, type classes.
  • Type system extensions.
  • Monads, monad transformers.
  • Generic programming.
  • Purely functional data structures.
  • Concurrency.
  • DSL - Domain specific languages.
  • Quickcheck - type based property testing.
  • Dependent types: Agda and Coq
Literature
  • 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
  • OKASAKI, Chris. Purely functional data structures. Cambridge: Cambridge University Press, 1998, x, 220. ISBN 0521631246. info
  • MICHAELSON, Greg. An introduction to functional programming through Lambda calculus. Wokingham: Addison-Wesley Publishing Company, 1989, 320 s. ISBN 0-201-17812-5. info
  • JONES, Simon L. Peyton. The implementation of functional programming languages. New York: Prentice Hall, 1987, xvi, 445 s. ISBN 0-13-453325-9. info
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Teaching methods
The course is organized as a series of lectures.
Assessment methods
Evaluation: final written exam.
Language of instruction
English
Further Comments
Study Materials
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Autumn 2015, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024.

IA014 Functional Programming

Faculty of Informatics
Spring 2013
Extent and Intensity
3/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
RNDr. Libor Škarvada (lecturer)
Mgr. Matej Kollár (assistant)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: RNDr. Libor Škarvada
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Wed 16:00–18:50 G123
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 23 fields of study the course is directly associated with, display
Course objectives
The course surveys the main results in functional programming.
Syllabus
  • Simple functional language and its semantics.
  • Types, typing. Parametric polymorphism, impredicative type systems. Typing in predicative type systems.
  • Subtyping, dependent types, Pure Type Systems.
  • Imperative features, input/output, exceptions, nondeterminism, destructible arrays, state. Continuations.
  • Implementation of functional languages. Translation of definitions by patterns, guarded clauses, list comprehensions.
  • Graph reduction, G-machine. Supercombinators, lambda lifting. Optimal reduction, full laziness.
Literature
  • FIELD, Anthony J. and Peter G. HARRISON. Functional programming. 1st ed. Wokingham: Addison-Wesley Publishing Company, 1988, 602 s. ISBN 0-201-19249-7. info
  • JONES, Simon L. Peyton. The implementation of functional programming languages. New York: Prentice Hall, 1987, xvi, 445 s. ISBN 0-13-453325-9. info
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Teaching methods
The course is organized as a series of lectures.
Assessment methods
Evaluation: final written exam.
Language of instruction
Czech
Further Comments
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Autumn 2014, Autumn 2015, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024.

IA014 Functional Programming

Faculty of Informatics
Spring 2012
Extent and Intensity
3/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
RNDr. Libor Škarvada (lecturer)
Mgr. Matej Kollár (assistant)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: RNDr. Libor Škarvada
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Thu 16:00–18:50 B204
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 23 fields of study the course is directly associated with, display
Course objectives
The course surveys the main results in functional programming. Functional languages are viewed as various modifications and enhancements of common mathematical calculi. The course is also partly devoted to the implementation of interpreters and compilers, and to the optimization issues. After finishing the course the students should understand the context of functional languages and their connection to mathematical calculi, as well as the links to mathematical logic and type theory.
Syllabus
  • Untyped and typed lambda calculi. Strong normalization, Church-Rosser property.
  • Recursive definitions. The Fixpoint Theorem.
  • Simple functional language and its semantics.
  • Types, typing. Parametric polymorphism, impredicative type systems. Typing in predicative type systems.
  • Subtyping, dependent types, Pure Type Systems.
  • Imperative features, input/output, exceptions, nondeterminism, destructible arrays, state. Continuations.
  • Constructor classes. Monads. Monadic data type for I/O. Monadic parser combinators.
  • Implementation of functional languages. Translation of definitions by patterns, guarded clauses, list comprehensions.
  • Graph reduction, G-machine. Supercombinators, lambda lifting. Optimal reduction, full laziness.
Literature
  • FIELD, Anthony J. and Peter G. HARRISON. Functional programming. 1st ed. Wokingham: Addison-Wesley Publishing Company, 1988, 602 s. ISBN 0-201-19249-7. info
  • JONES, Simon L. Peyton. The implementation of functional programming languages. New York: Prentice Hall, 1987, xvi, 445 s. ISBN 0-13-453325-9. info
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Teaching methods
The course is organized as a series of lectures.
Assessment methods
Evaluation: final written exam.
Language of instruction
Czech
Further Comments
Study Materials
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2013, Autumn 2014, Autumn 2015, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024.

IA014 Functional Programming

Faculty of Informatics
Spring 2011
Extent and Intensity
3/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
RNDr. Libor Škarvada (lecturer)
Mgr. Matej Kollár (assistant)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: RNDr. Libor Škarvada
Timetable
Thu 14:00–16:50 B204
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 22 fields of study the course is directly associated with, display
Course objectives
The course surveys the main results in functional programming. Functional languages are viewed as various modifications and enhancements of common mathematical calculi. The course is also partly devoted to the implementation of interpreters and compilers, and to the optimization issues. After finishing the course the students should understand the context of functional languages and their connection to mathematical calculi, as well as the links to mathematical logic and type theory.
Syllabus
  • Untyped and typed lambda calculi. Strong normalization, Church-Rosser property.
  • Recursive definitions. The Fixpoint Theorem.
  • Simple functional language and its semantics.
  • Types, typing. Parametric polymorphism, impredicative type systems. Typing in predicative type systems.
  • Subtyping, dependent types, Pure Type Systems.
  • Imperative features, input/output, exceptions, nondeterminism, destructible arrays, state. Continuations.
  • Constructor classes. Monads. Monadic data type for I/O. Monadic parser combinators.
  • Implementation of functional languages. Translation of definitions by patterns, guarded clauses, list comprehensions.
  • Graph reduction, G-machine. Supercombinators, lambda lifting. Optimal reduction, full laziness.
Literature
  • FIELD, Anthony J. and Peter G. HARRISON. Functional programming. 1st ed. Wokingham: Addison-Wesley Publishing Company, 1988, 602 s. ISBN 0-201-19249-7. info
  • JONES, Simon L. Peyton. The implementation of functional programming languages. New York: Prentice Hall, 1987, xvi, 445 s. ISBN 0-13-453325-9. info
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Teaching methods
The course is organized as a series of lectures.
Assessment methods
Evaluation: final written exam.
Language of instruction
Czech
Further Comments
Study Materials
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2012, Spring 2013, Autumn 2014, Autumn 2015, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024.

IA014 Functional Programming

Faculty of Informatics
Spring 2010
Extent and Intensity
3/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
RNDr. Libor Škarvada (lecturer)
Mgr. Matej Kollár (assistant)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: RNDr. Libor Škarvada
Timetable
Thu 14:00–16:50 B011
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 22 fields of study the course is directly associated with, display
Course objectives
The course surveys the main results in functional programming. Functional languages are viewed as various modifications and enhancements of common mathematical calculi. The course is also partly devoted to the implementation of interpreters and compilers, and to the optimization issues. After finishing the course the students should understand the context of functional languages and their connection to mathematical calculi, as well as the links to mathematical logic and type theory.
Syllabus
  • Untyped and typed lambda calculi. Strong normalization, Church-Rosser property.
  • Recursive definitions. The Fixpoint Theorem.
  • Simple functional language and its semantics.
  • Types, typing. Parametric polymorphism, impredicative type systems. Typing in predicative type systems.
  • Subtyping, dependent types, Pure Type Systems.
  • Imperative features, input/output, exceptions, nondeterminism, destructible arrays, state. Continuations.
  • Constructor classes. Monads. Monadic data type for I/O. Monadic parser combinators.
  • Implementation of functional languages. Translation of definitions by patterns, guarded clauses, list comprehensions.
  • Graph reduction, G-machine. Supercombinators, lambda lifting. Optimal reduction, full laziness.
Literature
  • FIELD, Anthony J. and Peter G. HARRISON. Functional programming. 1st ed. Wokingham: Addison-Wesley Publishing Company, 1988, 602 s. ISBN 0-201-19249-7. info
  • JONES, Simon L. Peyton. The implementation of functional programming languages. New York: Prentice Hall, 1987, xvi, 445 s. ISBN 0-13-453325-9. info
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Teaching methods
The course is organized as a series of lectures.
Assessment methods
Evaluation: final written exam.
Language of instruction
Czech
Further Comments
Study Materials
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2011, Spring 2012, Spring 2013, Autumn 2014, Autumn 2015, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024.

IA014 Functional Programming

Faculty of Informatics
Spring 2009
Extent and Intensity
3/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
RNDr. Libor Škarvada (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: RNDr. Libor Škarvada
Timetable
Thu 14:00–16:50 B204
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 19 fields of study the course is directly associated with, display
Course objectives
The course surveys the main results in functional programming. Functional languages are viewed as various modifications and enhancements of common mathematical calculi. The course is also partly devoted to the implementation of interpreters and compilers, and to the optimization issues.
Syllabus
  • Untyped and typed lambda calculi. Strong normalization, Church-Rosser property.
  • Recursive definitions. The Fixpoint Theorem.
  • PCF and its semantics.
  • Types, typing. Parametric polymorphism, impredicative type systems. Typing in predicative type systems.
  • Subtyping, dependent types, Pure Type Systems.
  • Imperative features, input/output, exceptions, nondeterminism, destructible arrays, state. Continuations.
  • Monads. Monadic data type for I/O. Monadic parser combinators.
  • Implementation of functional languages. Translation of definitions by patterns, guarded clauses, list comprehensions.
  • Graph reduction, G-machine. Supercombinators, lambda lifting.
  • Optimal reduction, full laziness, fully lazy lambda lifting.
Literature
  • FIELD, Anthony J. and Peter G. HARRISON. Functional programming. 1st ed. Wokingham: Addison-Wesley Publishing Company, 1988, 602 s. ISBN 0-201-19249-7. info
  • JONES, Simon L. Peyton. The implementation of functional programming languages. New York: Prentice Hall, 1987, xvi, 445 s. ISBN 0-13-453325-9. info
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Assessment methods
The course is organized as a series of lectures. Evaluation: final written exam.
Language of instruction
Czech
Further Comments
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Autumn 2014, Autumn 2015, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024.

IA014 Functional Programming

Faculty of Informatics
Spring 2008
Extent and Intensity
3/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
RNDr. Libor Škarvada (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: RNDr. Libor Škarvada
Timetable
Thu 16:00–18:50 B011
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 19 fields of study the course is directly associated with, display
Course objectives
The course surveys the main results in functional programming. Functional languages are viewed as various modifications and enhancements of common mathematical calculi. The course is also partly devoted to the implementation of interpreters and compilers, and to the optimization issues.
Syllabus
  • Untyped and typed lambda calculi. Strong normalization, Church-Rosser property.
  • Recursive definitions. The Fixpoint Theorem.
  • PCF and its semantics.
  • Types, typing. Parametric polymorphism, impredicative type systems. Typing in predicative type systems.
  • Subtyping, dependent types, Pure Type Systems.
  • Imperative features, input/output, exceptions, nondeterminism, destructible arrays, state. Continuations.
  • Monads. Monadic data type for I/O. Monadic parser combinators.
  • Implementation of functional languages. Translation of definitions by patterns, guarded clauses, list comprehensions.
  • Graph reduction, G-machine. Supercombinators, lambda lifting.
  • Optimal reduction, full laziness, fully lazy lambda lifting.
Literature
  • FIELD, Anthony J. and Peter G. HARRISON. Functional programming. 1st ed. Wokingham: Addison-Wesley Publishing Company, 1988, 602 s. ISBN 0-201-19249-7. info
  • JONES, Simon L. Peyton. The implementation of functional programming languages. New York: Prentice Hall, 1987, xvi, 445 s. ISBN 0-13-453325-9. info
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Assessment methods (in Czech)
Kurs je ukončen závěrečnou písemnou zkouškou.
Language of instruction
Czech
Further Comments
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Autumn 2014, Autumn 2015, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024.

IA014 Functional Programming

Faculty of Informatics
Spring 2007
Extent and Intensity
3/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
RNDr. Libor Škarvada (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: RNDr. Libor Škarvada
Timetable
Thu 16:00–18:50 B204
Prerequisites (in Czech)
! I014 Func.Programming
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 7 fields of study the course is directly associated with, display
Course objectives
The course surveys the main results in functional programming. Functional languages are viewed as various modifications and enhancements of common mathematical calculi. The course is also partly devoted to the implementation of interpreters and compilers, and to the optimization issues.
Syllabus
  • Untyped and typed lambda calculi. Strong normalization, Church-Rosser property.
  • Recursive definitions. The Fixpoint Theorem.
  • PCF and its semantics.
  • Types, typing. Parametric polymorphism, impredicative type systems. Typing in predicative type systems.
  • Subtyping, dependent types, Pure Type Systems.
  • Imperative features, input/output, exceptions, nondeterminism, destructible arrays, state. Continuations.
  • Monads. Monadic data type for I/O. Monadic parser combinators.
  • Implementation of functional languages. Translation of definitions by patterns, guarded clauses, list comprehensions.
  • Graph reduction, G-machine. Supercombinators, lambda lifting.
  • Optimal reduction, full laziness, fully lazy lambda lifting.
Literature
  • FIELD, Anthony J. and Peter G. HARRISON. Functional programming. 1st ed. Wokingham: Addison-Wesley Publishing Company, 1988, 602 s. ISBN 0-201-19249-7. info
  • JONES, Simon L. Peyton. The implementation of functional programming languages. New York: Prentice Hall, 1987, xvi, 445 s. ISBN 0-13-453325-9. info
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Assessment methods (in Czech)
Kurs je ukončen závěrečnou písemnou zkouškou.
Language of instruction
Czech
Further Comments
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Autumn 2014, Autumn 2015, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024.

IA014 Functional Programming

Faculty of Informatics
Spring 2006
Extent and Intensity
3/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
RNDr. Libor Škarvada (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: RNDr. Libor Škarvada
Timetable
Thu 16:00–18:50 B011
Prerequisites (in Czech)
! I014 Func.Programming
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 7 fields of study the course is directly associated with, display
Course objectives
The course surveys the main results in functional programming. Functional languages are viewed as various modifications and enhancements of common mathematical calculi. The course is also partly devoted to the implementation of interpreters and compilers, and to the optimization issues.
Syllabus
  • Untyped and typed lambda calculi. Strong normalization, Church-Rosser property.
  • Recursive definitions. The Fixpoint Theorem.
  • PCF and its semantics.
  • Types, typing. Parametric polymorphism, impredicative type systems. Typing in predicative type systems.
  • Subtyping, dependent types, Pure Type Systems.
  • Imperative features, input/output, exceptions, nondeterminism, destructible arrays, state. Continuations.
  • Monads. Monadic data type for I/O. Monadic parser combinators.
  • Implementation of functional languages. Translation of definitions by patterns, guarded clauses, list comprehensions.
  • Graph reduction, G-machine. Supercombinators, lambda lifting.
  • Optimal reduction, full laziness, fully lazy lambda lifting.
Literature
  • FIELD, Anthony J. and Peter G. HARRISON. Functional programming. 1st ed. Wokingham: Addison-Wesley Publishing Company, 1988, 602 s. ISBN 0-201-19249-7. info
  • JONES, Simon L. Peyton. The implementation of functional programming languages. New York: Prentice Hall, 1987, xvi, 445 s. ISBN 0-13-453325-9. info
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Assessment methods (in Czech)
Kurs je ukončen závěrečnou písemnou zkouškou.
Language of instruction
Czech
Further Comments
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Autumn 2014, Autumn 2015, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024.

IA014 Functional Programming

Faculty of Informatics
Spring 2005
Extent and Intensity
3/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
RNDr. Libor Škarvada (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: RNDr. Libor Škarvada
Timetable
Thu 16:00–18:50 B204
Prerequisites (in Czech)
! I014 Func.Programming
Course Enrolment Limitations
The course is only offered to the students of the study fields the course is directly associated with.
fields of study / plans the course is directly associated with
there are 7 fields of study the course is directly associated with, display
Course objectives
The course surveys the main results in functional programming. Functional languages are viewed as various modifications and enhancements of common mathematical calculi. The course is also partly devoted to the implementation of interpreters and compilers, and to the optimization issues.
Syllabus
  • Untyped and typed lambda calculi. Strong normalization, Church-Rosser property.
  • Recursive definitions. The Fixpoint Theorem.
  • PCF and its semantics.
  • Types, typing. Parametric polymorphism, impredicative type systems. Typing in predicative type systems.
  • Subtyping, dependent types, Pure Type Systems.
  • Imperative features, input/output, exceptions, nondeterminism, destructible arrays, state. Continuations.
  • Monads. Monadic data type for I/O. Monadic parser combinators.
  • Implementation of functional languages. Translation of definitions by patterns, guarded clauses, list comprehensions.
  • Graph reduction, G-machine. Supercombinators, lambda lifting.
  • Optimal reduction, full laziness, fully lazy lambda lifting.
Literature
  • FIELD, Anthony J. and Peter G. HARRISON. Functional programming. 1st ed. Wokingham: Addison-Wesley Publishing Company, 1988, 602 s. ISBN 0-201-19249-7. info
  • JONES, Simon L. Peyton. The implementation of functional programming languages. New York: Prentice Hall, 1987, xvi, 445 s. ISBN 0-13-453325-9. info
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Assessment methods (in Czech)
Kurs je ukončen závěrečnou písemnou zkouškou.
Language of instruction
Czech
Further Comments
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Autumn 2014, Autumn 2015, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024.

IA014 Functional Programming

Faculty of Informatics
Spring 2004
Extent and Intensity
3/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
RNDr. Libor Škarvada (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: RNDr. Libor Škarvada
Timetable
Thu 16:00–18:50 B204
Prerequisites (in Czech)
! I014 Func.Programming
Course Enrolment Limitations
The course is only offered to the students of the study fields the course is directly associated with.
fields of study / plans the course is directly associated with
there are 7 fields of study the course is directly associated with, display
Course objectives
The course surveys the main results in functional programming. Functional languages are viewed as various modifications and enhancements of common mathematical calculi. The course is also partly devoted to the implementation of interpreters and compilers, and to the optimization issues.
Syllabus
  • Untyped and typed lambda calculi. Strong normalization, Church-Rosser property.
  • Recursive definitions. The Fixpoint Theorem.
  • PCF and its semantics.
  • Types, typing. Parametric polymorphism, impredicative type systems. Typing in predicative type systems.
  • Subtyping, dependent types, Pure Type Systems.
  • Imperative features, input/output, exceptions, nondeterminism, destructible arrays, state. Continuations.
  • Monads. Monadic data type for I/O. Monadic parser combinators.
  • Implementation of functional languages. Translation of definitions by patterns, guarded clauses, list comprehensions.
  • Graph reduction, G-machine. Supercombinators, lambda lifting.
  • Optimal reduction, full laziness, fully lazy lambda lifting.
Literature
  • FIELD, Anthony J. and Peter G. HARRISON. Functional programming. 1st ed. Wokingham: Addison-Wesley Publishing Company, 1988, 602 s. ISBN 0-201-19249-7. info
  • JONES, Simon L. Peyton. The implementation of functional programming languages. New York: Prentice Hall, 1987, xvi, 445 s. ISBN 0-13-453325-9. info
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Assessment methods (in Czech)
Kurs je ukončen závěrečnou písemnou zkouškou.
Language of instruction
Czech
Further Comments
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Autumn 2014, Autumn 2015, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024.

IA014 Functional Programming

Faculty of Informatics
Spring 2003
Extent and Intensity
3/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
RNDr. Libor Škarvada (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: RNDr. Libor Škarvada
Timetable
Thu 17:00–19:50 B011
Prerequisites (in Czech)
! I014 Func.Programming
Course Enrolment Limitations
The course is only offered to the students of the study fields the course is directly associated with.
fields of study / plans the course is directly associated with
there are 7 fields of study the course is directly associated with, display
Course objectives
The course surveys the main results in functional programming. Functional languages are viewed as various modifications and enhancements of common mathematical calculi. The course is also partly devoted to the implementation of interpreters and compilers, and to the optimization issues.
Syllabus
  • Untyped and typed lambda calculi. Strong normalization, Church-Rosser property.
  • Recursive definitions. The Fixpoint Theorem.
  • Combinatory calculus. S, K, I combinators, B, C combinators.
  • PCF and its semantics.
  • Types, typing. Parametric polymorphism, impredicative type systems. Typing in predicative type systems.
  • Subtyping, dependent types, Pure Type Systems.
  • Imperative features, input/output, exceptions, nondeterminism, destructible arrays, state. Continuations.
  • Monads. Monadic data type for I/O. Monadic parser combinators.
  • Implementation of functional languages. Translation of definitions by patterns, guarded clauses, list comprehensions.
  • Graph reduction, G-machine. Supercombinators, lambda lifting.
  • Optimal reduction, full laziness, fully lazy lambda lifting.
Literature
  • FIELD, Anthony J. and Peter G. HARRISON. Functional programming. 1st ed. Wokingham: Addison-Wesley Publishing Company, 1988, 602 s. ISBN 0-201-19249-7. info
  • JONES, Simon L. Peyton. The implementation of functional programming languages. New York: Prentice Hall, 1987, xvi, 445 s. ISBN 0-13-453325-9. info
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Assessment methods (in Czech)
Kurs je ukončen závěrečnou písemnou zkouškou.
Language of instruction
Czech
Further Comments
The course is taught annually.
Teacher's information
http://www.fi.muni.cz/usr/skarvada/vyuka/IA014/
The course is also listed under the following terms Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Autumn 2014, Autumn 2015, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024.

IA014 Functional Programming

Faculty of Informatics
Spring 2014

The course is not taught in Spring 2014

Extent and Intensity
3/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
RNDr. Libor Škarvada (lecturer)
Mgr. Matej Kollár (assistant)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: RNDr. Libor Škarvada
Supplier department: Department of Computer Science – Faculty of Informatics
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 18 fields of study the course is directly associated with, display
Course objectives
The course surveys the main results in functional programming.
Syllabus
  • Simple functional language and its semantics.
  • Types, typing. Parametric polymorphism, impredicative type systems. Typing in predicative type systems.
  • Subtyping, dependent types, Pure Type Systems.
  • Imperative features, input/output, exceptions, nondeterminism, destructible arrays, state. Continuations.
  • Implementation of functional languages. Translation of definitions by patterns, guarded clauses, list comprehensions.
  • Graph reduction, G-machine. Supercombinators, lambda lifting. Optimal reduction, full laziness.
Literature
  • FIELD, Anthony J. and Peter G. HARRISON. Functional programming. 1st ed. Wokingham: Addison-Wesley Publishing Company, 1988, 602 s. ISBN 0-201-19249-7. info
  • JONES, Simon L. Peyton. The implementation of functional programming languages. New York: Prentice Hall, 1987, xvi, 445 s. ISBN 0-13-453325-9. info
Bookmarks
https://is.muni.cz/ln/tag/FI:IA014!
Teaching methods
The course is organized as a series of lectures.
Assessment methods
Evaluation: final written exam.
Language of instruction
Czech
Further Comments
Study Materials
The course is taught annually.
The course is taught: every week.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Autumn 2014, Autumn 2015, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024.
  • Enrolment Statistics (recent)