FI:I015 Introduction to Functional Pro

I015 Introduction to Functional Programming

Faculty of Informatics
Autumn 1996

Extent and Intensity

0/2. 2 credit(s). Recommended Type of Completion: k (colloquium). Other types of completion: z (credit).

Teacher(s)

RNDr. Libor Škarvada (lecturer)

Guaranteed by

Contact Person: RNDr. Libor Škarvada

Prerequisites

There are no special prerequisities apart from the basic math skills (on the secondary-school level), and certain aptitude for abstract reasoning.

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

This course offers the basic information about functional programming. After finishing the course the students should be able to write simple programs in purely functional style.
Basic notions: term, value, evaluation step.
Evaluation order, strict vs. lazy reduction.
Lambda abstraction, let and letrec expressions.
Higher-order functions, partial application, currying.
Simple types: ground types and type constructors, product types.
Polymorfic types, typing.
User defined type constructors, sum types, recursive types; definitions by patterns.
List constructors, list enumeration and list comprehension.
Infinite lists and trees.
Recursive functions, operations on lists and trees, time complexity.
Modules, abstract data types.

Language of instruction

Czech