#HASKELL FUNCTIONAL PROGRAMMING HOW TO#

Students are formally asked for feedback at the end of the course.

Paul Chiusano and Rúnar Bjarnason, Functional Programming in Scala.

Paul Hudak, The Haskell School of Expression, Cambridge University Press, 2000.

Simon Thompson, Haskell: The Craft of Functional Programming, Addison-Wesley, 1996.

Miran Lipovača, Learn You a Haskell for Great Good! A Beginner's Guide, No Starch Press, 2011.

Bryan O'Sullivan, Don Stewart, and John Goerzen, Real World Haskell, O'Reilly Media, 2008.

Richard Bird, Thinking Functionally With Haskell, Cambridge University Press, October 2014.

Graham Hutton, Programming in Haskell (2nd edition), Cambridge University Press, 2016.

Richard Bird, Introduction to Functional Programming using Haskell, second edition, Prentice-Hall International, 1998.

Simple cost models for functional programs time and space complexity. Normal order reduction and lazy evaluation. Use of trees for representing sets and symbolic data. Further data structures: binary trees, general trees. Recursive definitions and structural induction. Basic operations on lists, including map, fold and filter, together with their algebraic properties. Type definitions and built-in types: numbers, characters, strings and lists. SyllabusPrinciples of functional programming: expressions, evaluations, functions, and types.

Arithmetic expressions: representing, evaluating and manipulating arithmetic expressions.

Advice on writing efficient programs use of accumulating parameters. Insertion and searching in a binary search tree. Binary search trees for representing sets. Binary trees and the relationship between size and depth. Proving properties of infinite lists: induction, take lemma.

Infinite lists and their applications: Pascal's triangle, digits of a number, sieve of Eratosthenes.

Simple manipulation of programs to achieve efficiency. The algebraic properties of list functions and their proof by equational reasoning. Many small examples illustrating the use of these functions in a compositional style of programming. The functions map, foldl, foldr, concat and filter. Lists and their operations list comprehensions.Simple programs involving pattern matching. Reduction strategies: innermost vs outermost. Programming with a functional notation: sessions and scripts, expressions and values.

Reason about the time and space complexity of programs.

Use polymorphism and higher-order functions.

Reason formally about functional programs.

Learning outcomesĪt the end of the course the student will be able to: The course provides hands-on experience of programming through two lab exercises: the first one aims to make you acquainted with the mechanics of writing Haskell programs, and the second one tackles a more challenging programming task.

#HASKELL FUNCTIONAL PROGRAMMING HOW TO#

This makes the language very powerful, so that we can easily construct programs that would be difficult or very large in other languages.Īn important theme of the course is how to apply mathematical reasoning to programs, so as to prove that a program performs its task correctly, or to derive it by algebraic manipulation from a simpler but less efficient program for the same problem. It makes use of a programming language called Haskell, in which programs can be viewed as mathematical functions. MSc students will be assessed by invigilated exam lasting 3 hours in week 0 of HT. Preliminary Examinations - Mathematics and Computer Science Preliminary Examinations - Computer Science Preliminary Examinations - Computer Science and Philosophy

Haskell functional programming