FI:I014 Func.Programming - Course Information
I014 Functional ProgrammingFaculty of Informatics
- 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).
- 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
- Wed 17:00–19:50 D1
- Prerequisites (in Czech)
- I015 Intro to 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
- Informatics (programme FI, B-IN)
- Informatics (programme FI, M-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
- Information Technology (programme FI, B-IN)
- Course objectives
- The course gives an insight into functional languages from the point of view of common mathematical calculi, namely various modifications and enhancements of the (typed) lambda calculus. It is also partly devoted to the implementation of interpreters and compilers, and to the optimization issues.
- Untyped and typed lambda calculi. Strong normalization, Church-Rosser property.
- Recursive definitions. The Fixpoint Theorem.
- PCF and its semantics.
- Types, typing.
- Polymorphism, predicative and impredicative type systems.
- Type classes and constructor classes. Subtyping, type systems for OOP.
- Imperative features, input/output, exceptions, nondeterminism, destructible arrays, state. Continuations.
- Monads. Monadic data type IO.
- Implementation of functional languages. SECD machine. Translation of definitions by patterns, guarded clauses, list comprehensions.
- Graph reduction, G-machine. Supercombinators, lambda lifting.
- Optimal reduction, full laziness, fully lazy lambda lifting.
- 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
- Assessment methods (in Czech)
- Kurs je ukončen závěrečnou písemnou zkouškou.
- Language of instruction
- Further Comments
- The course is taught annually.
- Enrolment Statistics (recent)
- Permalink: https://is.muni.cz/course/fi/spring2002/I014