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.
  • Enrolment Statistics (Spring 2012, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2012/IA014