This module aims to introduce students to recursion and to the principles of recursive, applicative and functional programming. In it, they will use various functional abstractions to control the complexity of programming, and will use abstraction mechanisms in programming. They will also study the principles of program evaluation and explore the evaluation mechanism via a meta-circular evaluator.
Pre-requisites: COMP1202 AND COMP1206
Having successfully completed this module you will be able to:
Having successfully completed this module, you will be able to demonstrate knowledge and understanding of:
Having successfully completed this module you will be able to:
Recursive Techniques recursion on numbers, lists, trees, graphs.
Procedural Abstraction:
Objects:
Metalinguistic Abstraction
Environment model:
| Type | Hours |
|---|---|
| Revision | 10 |
| Tutorial | 12 |
| Completion of assessment task | 29 |
| Lecture | 36 |
| Wider reading or practice | 27 |
| Follow-up work | 18 |
| Preparation for scheduled sessions | 18 |
| Total study time | 150 |
Graham Hutton (2016). Programming in Haskell. Cambridge University Press.
Abelson H and Sussman GJ with Sussman J (1996). Structure and Interpretation of Computer Programs. MIT Press.
This is how we’ll formally assess what you have learned in this module.
| Method | Percentage contribution |
|---|---|
| Final Assessment | 40% |
| Continuous Assessment | 60% |
This is how we’ll assess you if you don’t meet the criteria to pass this module.
| Method | Percentage contribution |
|---|---|
| Set Task | 100% |
An internal repeat is where you take all of your modules again, including any you passed. An external repeat is where you only re-take the modules you failed.
| Method | Percentage contribution |
|---|---|
| Set Task | 100% |
Repeat type: Internal & External