School of Computer Science

Module 06-25344 (2013)

Functional Programming

Level 2/I

Martin Escardo Semester 1 10 credits
Co-ordinator: Martin Escardo
Reviewer: Achim Jung

The Module Description is a strict subset of this Syllabus Page.

Outline

The purpose of this module is to present the basic ideas of functional programming, to demonstrate the main elements of good programming style and to illustrate some of its uses and applications.


Aims

The aims of this module are to:

  • present the basic ideas of functional programming languages
  • demonstrate the main elements of good programming style
  • illustrate some of the uses and applications of functional programming

Learning Outcomes

On successful completion of this module, the student should be able to:

1 demonstrate an understanding of the main features and advantages of a functional language
2 write programs and implement algorithms in a functional style 3 use functional programming techniques to solve problems
4 use higher-order and list-manipulating functions
5 use various data types appropriately in the solution of problems


Restrictions


Teaching methods

Eleven two-hour weekly lectures plus eleven two-hour demonstrator-supervised laboratory sessions.

Contact Hours: 45 (22 hrs lectures, 22 hrs labs, 1 revision lecture)


Assessment

Sessional: 1.5 hr examination (50%), continuous assessment (50%). In order to pass the module, students have to both achieve 40% overall and at least 40% in the examination.

Supplementary (where allowed): By examination only (100%).


Detailed Syllabus

  1. Introduction: aims of the module; structure and organisation of the module; assessment; teaching methods; style of presentation; useful books.
  2. Functional language paradigm: uses; implementation; history; main features; advantages and disadvantages; languages (e.g., Lisp, ML, OCAML, Haskell);
  3. Fundamental ideas (higher-order functions, currying, uncurrying, function composition, recursion, local definitions); programming style; literate scripts; type systems.
  4. Numbers: basic operations, basic numerical types, numerical type classes.
  5. Lists: basic operations.
  6. Advanced features: e.g., modules; monads; interactive programs; lazy evaluation; proving properties possessed by programs.

Programmes containing this module