FI:I014 Functional Programming - Course Information

I014 Functional Programming

Faculty of Informatics
Spring 1996

Extent and Intensity

0/0. 3 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).

Teacher(s)

RNDr. Libor Škarvada (lecturer)

Guaranteed by

Contact Person: RNDr. Libor Škarvada

Prerequisites

Before enrolling this course the students should go through I015 Introduction to 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.

fields of study / plans the course is directly associated with

Syllabus

The course should result in 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, denotational and operational semantics, full abstraction, parallel or.
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.

Language of instruction

Czech