CS141 Functional Programming
CS141-15 Functional Programming
Introductory description
The principal aim of this module is to introduce students to the functional programming paradigm.
Module aims
Students should be able to understand the differences between imperative and functional programming, apply functional programming techniques, and write programs in Haskell.
Outline syllabus
This is an indicative module outline only to give an indication of the sort of topics that may be covered. Actual sessions held may differ.
- Differences between imperative and functional programming.
- Functional programming basics: expressions and reduction.
- Types, including parametric polymorphism.
- Ad-hoc polymorphism via type classes.
- Recursive and higher-order functions.
- Algebraic data types.
- Strict vs Lazy evaluation.
- Inductive construction.
- Functors, Applicatives, and Monads.
- Practical Haskell programming.
Learning outcomes
By the end of the module, students should be able to:
- Understand the differences between programming paradigms as well as their strengths and weaknesses in order to identify suitable programming languages for a particular task's needs.
- Apply key techniques of the functional programming paradigm to solve programming problems.
- Identify and exploit patterns in programs to design and implement programming abstractions.
- Prove simple properties about functionally pure computer programs.
- Use different evaluation strategies to evaluate programs.
Indicative reading list
Please see Talis Aspire link for most up to date list.
View reading list on Talis Aspire
Subject specific skills
Understanding of Functional Programming as a programming paradigm, including intermediate knowledge of programming abstractions and formal reasoning. See syllabus for details.
Transferable skills
Technical skills.
Critical thinking.
Multitasking.
Study time
| Type | Required |
|---|---|
| Lectures | 30 sessions of 1 hour (20%) |
| Practical classes | 10 sessions of 1 hour (7%) |
| Private study | 110 hours (73%) |
| Total | 150 hours |
Private study description
Background reading of recommended texts.
Work on unsupervised practical assignments.
Exam revision.
Costs
No further costs have been identified for this module.
You do not need to pass all assessment components to pass the module.
Students can register for this module without taking any assessment.
Assessment group D4
| Weighting | Study time | Eligible for self-certification | |
|---|---|---|---|
| Coursework 1 | 15% | Yes (extension) | |
|
This assessment is eligible for self-certification (extension). |
|||
| Coursework 2 | 25% | No | |
|
Coursework 2. This assignment is worth more than 3 CATS and is not, therefore, eligible for self-certification. |
|||
| In-person Examination | 60% | No | |
|
CS141 exam
|
|||
Assessment group R2
| Weighting | Study time | Eligible for self-certification | |
|---|---|---|---|
| In-person Examination - Resit | 100% | No | |
|
CS141 resit examination
|
|||
Feedback on assessment
Individual feedback on coursework via Tabula
Courses
This module is Optional for:
- Year 1 of UCSA-G500 Undergraduate Computer Science
-
UCSA-G503 Undergraduate Computer Science MEng
- Year 1 of G500 Computer Science
- Year 1 of G503 Computer Science MEng
- Year 1 of UCSA-I1N1 Undergraduate Computer Science with Business Studies
- Year 1 of UCSA-G406 Undergraduate Computer Systems Engineering
- Year 1 of UCSA-G408 Undergraduate Computer Systems Engineering
This module is Option list B for:
- Year 1 of UCSA-G4G1 Undergraduate Discrete Mathematics
- Year 1 of UCSA-G4G3 Undergraduate Discrete Mathematics