- Student Records
Programme & Unit Catalogues


CM50262: Functional programming

Follow this link for further information on academic years Academic Year: 2019/0
Further information on owning departmentsOwning Department/School: Department of Computer Science
Further information on credits Credits: 6      [equivalent to 12 CATS credits]
Further information on notional study hours Notional Study Hours: 120
Further information on unit levels Level: Masters UG & PG (FHEQ level 7)
Further information on teaching periods Period:
Semester 2
Further information on unit assessment Assessment Summary: CW 50%, EX 50%
Further information on unit assessment Assessment Detail:
  • Coursework 1 (CW 25%)
  • Coursework 2 (CW 25%)
  • Examination (EX 50%)
Further information on supplementary assessment Supplementary Assessment:
Like-for-like reassessment (where allowed by programme regulations)
Further information on requisites Requisites: Before taking this unit you must take CM50258 OR take CM50109 OR take another programming unit
Further information on descriptions Description: Aims:
To illustrate how the logical and semantic foundations of programming languages are translated into usable programming languages. To give students practical experience of using a functional programming language.

Learning Outcomes:
On completion of this unit, students will be able to:
1. Define and explain the syntax and semantics of the lambda-calculus, and its role as a model of computation.
2. Demonstrate the difference between reduction orders and explain their relationship with call-by-name, call-by-value and call-by-need evaluation.
3. Define and explain the simply-typed lambda calculus, Hindley-Milner polymorphism, and type inference.
4. Write programs over structured datatypes in a typed higher-order functional programming language.
5. Formally reason about and proof properties of functional programs using the formalism of the typed lambda-calculus.

Skills:
Use of IT (T/F,A), Problem Solving (T/F,A)

Content:
The lambda calculus, syntax and semantics; free and bound variables; alpha conversion; beta and eta reduction. Normal form subject to a reduction scheme. Reduction order: normal and applicative; Y combinator. Programming in the lambda-calculus: Church numerals and operations (addition, subtraction, multiplication), Booleans, recursion via fixed points. The diamond property. Church-Rosser theorem.
Typed lambda calculus. Hindley-Milner polymorphism and type checking and type inference.
Programming in a typed higher-order functional programming language (e.g. Haskell.) Types and type constructors: product, sum and function types. Recursive types, especially lists. Programming with map and fold. Call-by-name, call-by-value and call-by-need; graph reduction. Relationship of functional programming to other programming styles; integration of effects in functional programming languages.
Further information on programme availabilityProgramme availability:

CM50262 is Compulsory on the following programmes:

Department of Computer Science

Notes: